%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%                                                          %
%                           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 found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-116)) where (h, g)=(6, 2)
% next D is D_246 = 116 at 40.370000s
%T% Ecpp sieve(116): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 10
% D[[16]]=116
% A[[16]]=-147780825592457838449082
% B[[16]]=-21176891713910423124178
% m[[16]]=18465154640415060617334049001717343780852204600
% Factor [P]=11^1
% Factor [P]=5^2
% Factor [P]=3^1
% Factor [P]=2^3
% End of depth 16 at 40.390000 s

% N_17=2797750703093191002626371060866264209220031
% Pmax[142]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 40.400000s
% 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]=2393^1
% Factor [P]=83^1
% Factor [P]=2^6
% End of depth 17 at 40.400000 s

% N_18=220094022907330665324249179716116677
% Pmax[118]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 40.400000s
% 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]=181^1
% Factor [P]=2^2
% End of depth 18 at 40.410000 s

% N_19=303997269209020255972719861486349
% Pmax[108]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 40.410000s
% 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 40.410000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[19]]=3
% A[[19]]=17113218489907789
% B[[19]]=-17541634566109275
% m[[19]]=303997269209020238859501371578561
% Factor [P]=7^1
% End of depth 19 at 40.420000 s

% N_20=43428181315574319837071624511223
% Pmax[106]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 40.430000s
% 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 40.430000s
%T% Ecpp sieve(3): 0.000000
% 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(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 40.440000s
%T% Ecpp sieve(43): 0.000000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 40.440000s
%T% Ecpp sieve(67): 0.010000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 40.450000s
%T% Ecpp sieve(24): 0.000000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 40.450000s
%T% Ecpp sieve(51): 0.000000
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 40.450000s
%T% Ecpp sieve(123): 0.000000
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 40.460000s
%T% Ecpp sieve(267): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[20]]=267
% A[[20]]=2357813336026612
% B[[20]]=793591942084938
% m[[20]]=43428181315574317479258288484612
% Factor [P]=599^1
% Factor [P]=2^2
% End of depth 20 at 40.460000 s

% N_21=18125284355414990600692107047
% Pmax[94]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 40.460000s
% 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.470000s
%T% Ecpp sieve(7): 0.000000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 40.470000s
%T% Ecpp sieve(11): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[21]]=11
% A[[21]]=-80955165491412
% B[[21]]=-77428793447398
% m[[21]]=18125284355415071555857598460
% Factor [P]=4789^1
% Factor [P]=5^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 21 at 40.480000 s

% N_22=63079572476561117685869
% Pmax[76]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 40.480000s
% 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]=11^1
% Factor [P]=2^2
% End of depth 22 at 40.480000 s

% N_23=1433626647194570856497
% Pmax[71]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 40.480000s
% 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]=89^1
% Factor [P]=7^1
% Factor [P]=2^4
% End of depth 23 at 40.480000 s

% N_24=143822897993034797
% Pmax[57]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 40.490000s
% 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]=1259^1
% Factor [P]=983^1
% Factor [P]=181^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 24 at 40.490000 s

% N_25=107008669
% Pmax[27]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 40.490000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[25]]=-1
% Factor [P]=383^1
% Factor [P]=199^1
% Factor [P]=13^1
% Factor [P]=3^3
% Factor [P]=2^2
% Cofactor is 1
% End of depth 25 at 40.490000 s

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

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


% Time for building is 3.080000 s

% Starting phase 2: proving
% Starting proving job for step 0
% D=52 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
% Twisting
%T% ProveStep(52): 0.480000
% N_0 is prime
% Time for proof[0] is 0.480000 s

% Starting proving job for step 1
% 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.190000
% N_1 is prime
% Time for proof[1] is 0.190000 s

% Starting proving job for step 2
% 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.160000
% N_2 is prime
% Time for proof[2] is 0.160000 s

% Starting proving job for step 3
% 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.150000
% N_3 is prime
% Time for proof[3] is 0.150000 s

% Starting proving job for step 4
% 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.120000
% N_4 is prime
% Time for proof[4] is 0.120000 s

% Starting proving job for step 5
% 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.100000
% N_5 is prime
% Time for proof[5] is 0.100000 s

% Starting proving job for step 6
% D=403 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(403)=1
% Entering AEcModProveLarge
%T% ProveStep(403): 0.120000
% N_6 is prime
% Time for proof[6] is 0.120000 s

% Starting proving job for step 7
% 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.090000
% N_7 is prime
% Time for proof[7] is 0.090000 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
%T% ProveStep(-1): 0.010000
% N_9 is prime
% Time for proof[9] is 0.010000 s

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

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

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

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

% Starting proving job for step 14
% 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_14 is prime
% Time for proof[14] is 0.030000 s

% Starting proving job for step 15
% D=40 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(40): 0.060000
% N_15 is prime
% Time for proof[15] is 0.060000 s

% Starting proving job for step 16
% D=116 h=6 g=2 invcode=4 (f^4) g0=2
%T% Factor of degree 1 found: 0.040000
%T% one root in GetInvariant: 0.040000s
% u has been computed
%T% FindJ: 0.040000
% E found
%T% find E: 0.040000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(116): 0.080000
% N_16 is prime
% Time for proof[16] is 0.080000 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
%T% ProveStep(-1): 0.000000
% N_18 is prime
% Time for proof[18] is 0.000000 s

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

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

% Starting proving job for step 21
% 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.000000
% N_21 is prime
% Time for proof[21] is 0.000000 s

% Starting proving job for step 22
%T% ProveStep(-1): 0.010000
% N_22 is prime
% Time for proof[22] is 0.010000 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
% b=1
% Nonresidue is 6
%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
% Using complete factorization theorem
% b=1
% Nonresidue is 11
% b=1
% Nonresidue is 14
% b=1
% Nonresidue is 19
%T% ProveStep(-1): 0.000000
% N_27 is prime
% Time for proof[27] is 0.000000 s
% Time for proving  is 1.760000 s
% Total time is        4.840000 s
This number is prime
%T% PrintCertif: 0.020000
% Time for this number is 4.940000s

Working on 4351958403444169471413694193389018898819799660386044182829365454301938427498877881777140625445202945884589115928695982270086168893366885075937132450067901623090423812227
% Performing a quick factorization
% This number might be prime
% Entering ECPP: delay mode
% Starting phase 1: building the sequence of primes
% N_0=4351958403444169471413694193389018898819799660386044182829365454301938427498877881777140625445202945884589115928695982270086168893366885075937132450067901623090423812227
% Pmax[561]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 42.470000s
% 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 42.580000s
%T% Ecpp sieve(3): 0.040000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 42.890000s
%T% Ecpp sieve(8): 0.040000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 43.050000s
%T% Ecpp sieve(19): 0.030000
% No factor found, sieve only: no PRP test
% 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 43.180000s
%T% Ecpp sieve(163): 0.020000
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 43.320000s
%T% Ecpp sieve(123): 0.020000
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 43.460000s
%T% Ecpp sieve(267): 0.020000
% 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 43.640000s
%T% Ecpp sieve(219): 0.030000
% Testing if N is a norm in Q(sqrt(-291)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-328)) where (h, g)=(4, 2)
% next D is D_80 = 328 at 43.830000s
%T% Ecpp sieve(328): 0.020000
% Testing if N is a norm in Q(sqrt(-723)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1227)) where (h, g)=(4, 2)
% next D is D_91 = 1227 at 44.010000s
%T% Ecpp sieve(1227): 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(-456)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1128)) where (h, g)=(8, 4)
% next D is D_115 = 1128 at 44.240000s
%T% Ecpp sieve(1128): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 11
% D[[0]]=1128
% A[[0]]=-1295432085107461802589795884088115705710378436331496602057419987176345416120162203066
% B[[0]]=-118087933512942390699037185099060910367806625646998311932934424022670749028919727447
% m[[0]]=4351958403444169471413694193389018898819799660386044182829365454301938427498877881778436057530310407687178911812784097975796547329698381677994552437244247039210586015294
% Factor [P]=7213^1
% Factor [P]=13^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 0 at 44.440000 s

% N_1=2578415754225910642947440692546469929543049444430251281120724246879707003083747105344241971422864466986352343295630810215527607044793518396860933924647121613996207
% Pmax[540]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 44.480000s
% 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]=577^1
% Factor [P]=239^1
% Factor [P]=151^1
% Factor [P]=29^1
% Factor [P]=3^2
% Factor [P]=2^4
% End of depth 1 at 44.630000 s

% N_2=29651167261835632401375911383965680391066450826566611707620093546703155439288987304921219574510055074994033276037623528231280675254860506211685974455111
% Pmax[504]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 44.670000s
% 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 44.760000s
%T% Ecpp sieve(11): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[2]]=11
% A[[2]]=5077650648499303578876847949525311389844089022158623676300152984737368594663
% B[[2]]=2904888245998413485260565191377056641407260117112749250894803001913693555825
% m[[2]]=29651167261835632401375911383965680391066450826566611707620093546703155439283909654272720270931178227044507964647779439209122051578560353226948605860449
% Factor [P]=1973^1
% Factor [P]=11^1
% Factor [P]=3^1
% End of depth 2 at 44.890000 s

% N_3=455408119642993017883486328832660314105061524928452467517856111239662035037919637135768023943405339155024773297820262010000492275700139047243063261
% Pmax[488]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 44.930000s
% 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 45.010000s
%T% Ecpp sieve(3): 0.040000
% 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 45.250000s
%T% Ecpp sieve(4): 0.040000
%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 45.480000s
%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 45.580000s
%T% Ecpp sieve(11): 0.030000
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 45.690000s
%T% Ecpp sieve(15): 0.030000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 45.800000s
%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 45.910000s
%T% Ecpp sieve(35): 0.020000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 46.010000s
%T% Ecpp sieve(52): 0.020000
% Extra square factor: 15
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 46.140000s
%T% Ecpp sieve(91): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 46.260000s
%T% Ecpp sieve(123): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 11
% D[[3]]=123
% A[[3]]=33251634126629252034427546875062111314062865046413772057328892619050478414
% B[[3]]=2412638313117996852070481828306267601298141815117219090033028459037806724
% m[[3]]=455408119642993017883486328832660314105061524928452467517856111239662035004668003009138771908977792279962661983757396963586720218371246428192584848
% Factor [P]=719^1
% Factor [P]=281^1
% Factor [P]=3^1
% Factor [P]=2^4
% End of depth 3 at 46.380000 s

% N_4=46959592748078446269809121922073245976546352120181877789050640309509347515070110536532011549438659561598942735453447618568972679611696919509
% Pmax[464]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 46.420000s
% 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 46.490000s
%T% Ecpp sieve(4): 0.040000
%T% Ecpp sieve(4): 0.050000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 46.690000s
%T% Ecpp sieve(7): 0.030000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 46.790000s
%T% Ecpp sieve(11): 0.030000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 46.890000s
%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 46.980000s
%T% Ecpp sieve(67): 0.030000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 47.070000s
%T% Ecpp sieve(20): 0.020000
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 47.180000s
%T% Ecpp sieve(35): 0.020000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 47.280000s
%T% Ecpp sieve(52): 0.020000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 47.370000s
%T% Ecpp sieve(91): 0.020000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 47.460000s
%T% Ecpp sieve(235): 0.020000
% Testing if N is a norm in Q(sqrt(-715)) where (h, g)=(-4, 4)
% next D is D_48 = 715 at 47.550000s
%T% Ecpp sieve(715): 0.030000
% Testing if N is a norm in Q(sqrt(-1540)) where (h, g)=(-8, 8)
% next D is D_61 = 1540 at 47.650000s
%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 47.740000s
%T% Ecpp sieve(55): 0.020000
% Testing if N is a norm in Q(sqrt(-388)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-955)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1507)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-260)) where (h, g)=(8, 4)
% next D is D_97 = 260 at 47.910000s
%T% Ecpp sieve(260): 0.020000
% Testing if N is a norm in Q(sqrt(-308)) where (h, g)=(8, 4)
% next D is D_100 = 308 at 48.010000s
%T% Ecpp sieve(308): 0.020000
% Testing if N is a norm in Q(sqrt(-1060)) where (h, g)=(8, 4)
% next D is D_114 = 1060 at 48.100000s
%T% Ecpp sieve(1060): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 17
% D[[4]]=1060
% A[[4]]=10414157470720278416466513844149786990069865768183881734217306785154226
% B[[4]]=273660882224275301716875499829963503620238700573420796189149992831346
% m[[4]]=46959592748078446269809121922073245976546352120181877789050640309509337100912639816253595082924815411811952665587679434687238462304911765284
% Factor [P]=19^1
% Factor [P]=2^2
% End of depth 4 at 48.220000 s

% N_5=617889378264190082497488446343069026007188843686603655119087372493543909222534734424389408985852834365946745599837887298516295556643575859
% Pmax[458]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 48.250000s
% 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 48.320000s
%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 48.430000s
%T% Ecpp sieve(11): 0.030000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 48.520000s
%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 48.620000s
%T% Ecpp sieve(40): 0.020000
% Testing if N is a norm in Q(sqrt(-55)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-155)) where (h, g)=(4, 2)
% next D is D_72 = 155 at 48.730000s
%T% Ecpp sieve(155): 0.030000
% Testing if N is a norm in Q(sqrt(-355)) where (h, g)=(4, 2)
% next D is D_81 = 355 at 48.830000s
%T% Ecpp sieve(355): 0.020000
% Testing if N is a norm in Q(sqrt(-1243)) where (h, g)=(4, 2)
% next D is D_92 = 1243 at 48.920000s
%T% Ecpp sieve(1243): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-1555)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-31)) where (h, g)=(3, 1)
% next D is D_229 = 31 at 49.020000s
%T% Ecpp sieve(31): 0.020000
% 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(-283)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-379)) where (h, g)=(3, 1)
% next D is D_238 = 379 at 49.190000s
%T% Ecpp sieve(379): 0.020000
% 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)
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-515)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1915)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2563)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2728)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-2920)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4360)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-295)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-395)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-712)) where (h, g)=(8, 2)
% next D is D_578 = 712 at 49.560000s
%T% Ecpp sieve(712): 0.030000
% Testing if N is a norm in Q(sqrt(-904)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-979)) where (h, g)=(8, 2)
% next D is D_581 = 979 at 49.680000s
%T% Ecpp sieve(979): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-995)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1195)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1864)) where (h, g)=(8, 2)
% next D is D_595 = 1864 at 49.800000s
%T% Ecpp sieve(1864): 0.030000
% Testing if N is a norm in Q(sqrt(-2248)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2395)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3883)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4195)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-5995)) where (h, g)=(16, 4)
% next D is D_694 = 5995 at 50.000000s
%T% Ecpp sieve(5995): 0.030000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-6952)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-9640)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-13288)) where (h, g)=(16, 4)
% next D is D_757 = 13288 at 50.120000s
% D too large for using tabjac
%T% Ecpp sieve(13288): 0.050000
% Testing if N is a norm in Q(sqrt(-13795)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-17515)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-21835)) where (h, g)=(16, 4)
% next D is D_782 = 21835 at 50.300000s
%T% Ecpp sieve(21835): 0.050000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-25960)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-79)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-103)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-179)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-227)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-443)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-523)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-571)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-683)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-739)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1051)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1723)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1867)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2203)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2683)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-415)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-803)) where (h, g)=(10, 2)
% next D is D_1087 = 803 at 50.850000s
%T% Ecpp sieve(803): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 17
% D[[5]]=803
% A[[5]]=1075536437288278421882166662226491289090178723291628698319167110521928
% B[[5]]=40463979109602075316583776338750231386906750934711396476997776818178
% m[[5]]=617889378264190082497488446343069026007188843686603655119087372493542833686097446145967526819190607874657655421114595669817976389533053932
% Factor [P]=65537^1
% Factor [P]=101^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 5 at 50.950000 s

% N_6=7778960252067699072887711558787780550426844812156391730133037142266080336324985368982954868504111675744722735429005332863112676853
% Pmax[432]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 50.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 51.040000s
%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 51.200000s
%T% Ecpp sieve(11): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[6]]=11
% A[[6]]=169510977337615015822818502860528193479017716014399967011225178821
% B[[6]]=14715080608055758095913253025976646424915244466008455412945622569
% m[[6]]=7778960252067699072887711558787780550426844812156391730133037142096569358987370353160136365643583482265705019414605365851887498033
% Factor [P]=977^1
% Factor [P]=353^1
% Factor [P]=59^1
% Factor [P]=3^1
% End of depth 6 at 51.290000 s

% N_7=127432151895243897406022674435100418743090649807799777562398001002074446131929045683277871898131070449563320586852144969809
% Pmax[406]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 51.320000s
% 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]=47^1
% Factor [P]=11^1
% Factor [P]=7^1
% Factor [P]=2^4
% End of depth 7 at 51.380000 s

% N_8=2200748685673595907122524772642657134966334792204334373487116624103247549943510736447877036096488505967866133373379127
% Pmax[390]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 51.410000s
% 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 51.450000s
%T% Ecpp sieve(3): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[8]]=3
% A[[8]]=-48816157773531126862994335244337185581792283334389343340879
% B[[8]]=46260052899970114364330937554932840671079832107516488905267
% m[[8]]=2200748685673595907122524772642657134966334792204334373487165440261021081070373730783121373282070298251200522716720007
% Factor [P]=1447^1
% Factor [P]=73^1
% Factor [P]=3^1
% End of depth 8 at 51.570000 s

% N_9=6944769009329950194931805917589398109034705065130294369036758275698803952975842731720553541044044198676526533299
% Pmax[372]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 51.590000s
% 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]=17^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 9 at 51.650000 s

% N_10=68085970679705394067958881544994099108183382991473474206242728193125528950743556193338760206314158810554181699
% Pmax[365]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 51.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 51.700000s
%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 51.810000s
%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 51.870000s
%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 51.930000s
%T% Ecpp sieve(43): 0.010000
% Extra square factor: 37
% Factorization completed using trial division only
% 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 52.010000s
%T% Ecpp sieve(67): 0.010000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 52.050000s
%T% Ecpp sieve(163): 0.010000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 7
% D[[10]]=163
% A[[10]]=16415411736653416360595126229719818218670336674166358813
% B[[10]]=132880781360536789685595930285354335097725359339255473
% m[[10]]=68085970679705394067958881544994099108183382991473474189827316456472112590148429963618941987643822136387822887
% Factor [P]=3^2
% Factor [P]=1163^1
% End of depth 10 at 52.130000 s

% N_11=6504821885899053603511883208655211532261716154721837602926083544136057379397002958213331612462388663073261
% Pmax[352]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 52.140000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[11]]=1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 11 at 52.200000 s

% N_12=1084136980983175600585313868109201922043619359120306267154347257356009563232833826368888602077064777178877
% Pmax[349]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 52.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 52.250000s
%T% Ecpp sieve(3): 0.020000
% No factor found, sieve only: no PRP test
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[12]]=3
% A[[12]]=-30819687588691397262919256777941955836985639815314994
% B[[12]]=33599081241745107423175983948302542647887400138910268
% m[[12]]=1084136980983175600585313868109201922043619359120306297974034846047406826152090604310844439062704592493872
% Factor [P]=331^1
% Factor [P]=19^1
% Factor [P]=3^1
% Factor [P]=2^4
% End of depth 12 at 52.350000 s

% N_13=3591379727113397733427790149829072991346065084275144094099601307996126921847970677342862004633436001
% Pmax[331]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 52.370000s
% 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]=37511^1
% Factor [P]=11083^1
% Factor [P]=1553^1
% Factor [P]=2^1
% End of depth 13 at 52.420000 s

% N_14=2781274794957784676168791463026496694212705895110284307646767920153786731633147247697509
% Pmax[291]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 52.430000s
% 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 52.450000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[14]]=3
% A[[14]]=62189922003200959615279768623018969598481833
% B[[14]]=-49185068130707175179714519392953442055124993
% m[[14]]=2781274794957784676168791463026496694212705832920362304445808304874018108614177649215677
% Factor [P]=997^1
% Factor [P]=439^1
% Factor [P]=151^1
% End of depth 14 at 52.510000 s

% N_15=42083056406586209717096369938104023700674135924652509088547428174702237452210569
% Pmax[265]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 52.530000s
% 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 52.540000s
%T% Ecpp sieve(3): 0.020000
% No factor found, sieve only: no PRP test
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[15]]=3
% A[[15]]=-12901952929815903144951358355703971263627
% B[[15]]=-789902150724943037474573187729443121493
% m[[15]]=42083056406586209717096369938104023700687037877582324991692379533057941423474197
% Factor [P]=2113^1
% Factor [P]=7^1
% Factor [P]=3^1
% End of depth 15 at 52.590000 s

% N_16=948393311396259205307199647039957264568251817041496517965708415772157425089
% Pmax[250]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 52.600000s
% 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 52.620000s
%T% Ecpp sieve(3): 0.010000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 52.670000s
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[16]]=4
% A[[16]]=-19878517259586237548364744074630858366
% B[[16]]=-29147975046070391138713093835726690760
% m[[16]]=948393311396259205307199647039957264588130334301082755514073159846788283456
% Factor [P]=12457^1
% Factor [P]=2^6
% End of depth 16 at 52.720000 s

% N_17=1189583807543272865290599220117149575274105841972739668853447308549897
% Pmax[230]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 52.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 52.740000s
%T% Ecpp sieve(3): 0.020000
% Extra square factor: 71
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[17]]=3
% A[[17]]=-46676049614098586181499310881731929
% B[[17]]=29323947111506542462078444160594793
% m[[17]]=1189583807543272865290599220117149621950155456071325850352758190281827
% Factor [P]=4783^1
% Factor [P]=37^1
% End of depth 17 at 52.800000 s

% N_18=6721913802505906986402287494093097863210104797234156163172260937
% Pmax[213]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 52.820000s
% 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]=3^2
% Factor [P]=2^3
% End of depth 18 at 52.830000 s

% N_19=93359913923693152588920659640181914766807011072696613377392513
% Pmax[206]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 52.850000s
% 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 52.860000s
%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 52.920000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[19]]=8
% A[[19]]=-19321593241870277379753789559650
% B[[19]]=-120255088502230954988442560788
% m[[19]]=93359913923693152588920659640201236360048881350076367166952164
% Factor [P]=19^1
% Factor [P]=17^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 19 at 52.950000 s

% N_20=24086665098992041431610077306553466553160186106830848082289
% Pmax[194]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 52.970000s
% 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 52.980000s
%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 53.040000s
%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 53.070000s
%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 53.090000s
%T% Ecpp sieve(43): 0.010000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 53.110000s
%T% Ecpp sieve(163): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[20]]=163
% A[[20]]=-267551777441147182541000846398
% B[[20]]=-12325520132145349541688855448
% m[[20]]=24086665098992041431610077306821018330601333289371848928688
% Factor [P]=83^1
% Factor [P]=2^4
% End of depth 20 at 53.130000 s

% N_21=18137549020325332403320841345497754767019076272117356121
% Pmax[184]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 53.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 53.140000s
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[21]]=4
% A[[21]]=4996288249943782967908149578
% B[[21]]=3449177431097703768396787040
% m[[21]]=18137549020325332403320841340501466517075293304209206544
% Factor [P]=13421^1
% Factor [P]=113^1
% Factor [P]=2^4
% End of depth 21 at 53.170000 s

% N_22=747472633213391821697704353025763782763642654533
% Pmax[160]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 53.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 53.180000s
%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 53.210000s
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[22]]=4
% A[[22]]=-586865500787611818833566
% B[[22]]=-813246490437996430465962
% m[[22]]=747472633213391821697704939891264570375461488100
% Factor [P]=733^1
% Factor [P]=353^1
% Factor [P]=5^2
% Factor [P]=3^2
% Factor [P]=2^2
% End of depth 22 at 53.230000 s

% N_23=3209771431058206222579947447531797526541
% Pmax[132]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 53.240000s
% 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]=613^1
% Factor [P]=2^1
% End of depth 23 at 53.250000 s

% N_24=2618084364647802791663904932733929467
% Pmax[121]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 53.250000s
% 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]=6899^1
% Factor [P]=59^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 24 at 53.260000 s

% N_25=1071998629395975176810159555071
% Pmax[100]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 53.260000s
% 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]=47^1
% Factor [P]=5^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 25 at 53.260000 s

% N_26=760282715883670338163233727
% Pmax[90]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 53.260000s
% 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]=4139^1
% Factor [P]=11^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 26 at 53.270000 s

% N_27=927714833627004934783
% Pmax[70]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 53.270000s
% 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]=3137^1
% Factor [P]=61^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 27 at 53.270000 s

% N_28=808014020588921
% Pmax[50]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 53.270000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[28]]=-1
% Factor [P]=2791^1
% Factor [P]=419^1
% Factor [P]=5^1
% Factor [P]=2^3
% End of depth 28 at 53.270000 s

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

% N_30=18899
% Pmax[15]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 53.280000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[30]]=-1
% Factor [P]=859^1
% Factor [P]=11^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 30 at 53.280000 s

% N_31=859
% Pmax[10]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 53.280000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[31]]=-1
% Factor [P]=13^1
% Factor [P]=11^1
% Factor [P]=3^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 31 at 53.280000 s


% Time for building is 10.850000 s

% Starting phase 2: proving
% Starting proving job for step 0
% Entering FindEForD0mod3
% D=1128 h=8 g=4 invcode=10 (w3) g0=4
%T% one root in GetInvariant: 0.050000s
% u has been computed
%T% FindW: 0.150000
% E found
%T% find E: 0.150000
% Suggested twist(1128)=1
% Entering AEcModProveLarge
%T% ProveStep(1128): 0.610000
% N_0 is prime
% Time for proof[0] is 0.610000 s

% Starting proving job for step 1
%T% ProveStep(1): 0.240000
% N_1 is prime
% Time for proof[1] is 0.240000 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.350000
% N_2 is prime
% Time for proof[2] is 0.350000 s

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

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

% Starting proving job for step 5
% D=803 h=10 g=2 invcode=11 (Stark's) g0=2
%T% Factor of degree 1 found: 1.240000
%T% one root in FindG2G3s: 1.240000s
% Using Stark's theorem
% E found
%T% find E: 1.270000
% Suggested twist(803)=1
% Entering AEcModProveLarge
%T% ProveStep(803): 1.550000
% N_5 is prime
% Time for proof[5] is 1.550000 s

% Starting proving job for step 6
% 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.240000
% N_6 is prime
% Time for proof[6] is 0.240000 s

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

% Starting proving job for step 8
% 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.170000
% N_8 is prime
% Time for proof[8] is 0.170000 s

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

% Starting proving job for step 10
% D=163 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(163)=1
% Entering AEcModProveLarge
%T% ProveStep(163): 0.150000
% N_10 is prime
% Time for proof[10] is 0.150000 s

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

% Starting proving job for step 12
% 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.120000
% N_12 is prime
% Time for proof[12] is 0.120000 s

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

% Starting proving job for step 14
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.090000
% N_14 is prime
% Time for proof[14] is 0.090000 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.060000
% N_15 is prime
% Time for proof[15] is 0.060000 s

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

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

% Starting proving job for step 18
%T% ProveStep(-1): 0.000000
% N_18 is prime
% Time for proof[18] is 0.000000 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.050000
% N_19 is prime
% Time for proof[19] is 0.050000 s

% Starting proving job for step 20
% D=163 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(163)=-1
% Entering AEcModProveLarge
%T% ProveStep(163): 0.030000
% N_20 is prime
% Time for proof[20] is 0.030000 s

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

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

% Starting proving job for step 23
%T% ProveStep(1): 0.010000
% N_23 is prime
% Time for proof[23] is 0.010000 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.010000
% N_27 is prime
% Time for proof[27] is 0.010000 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
%T% ProveStep(-1): 0.000000
% N_29 is prime
% Time for proof[29] is 0.000000 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
% Using complete factorization theorem
%T% ProveStep(-1): 0.000000
% N_31 is prime
% Time for proof[31] is 0.000000 s
% Time for proving  is 4.790000 s
% Total time is        15.640000 s
This number is prime
%T% PrintCertif: 0.030000
% Time for this number is 15.830000s

Working on 712695798495122072027627860244676947389938822262041977579025855118286140847334266976674509793958586370410877591048451554592134153302776514814954432759521709031139541007278795719825832913044454475378776544511
% Performing a quick factorization
% This number might be prime
% Entering ECPP: delay mode
% Starting phase 1: building the sequence of primes
% N_0=712695798495122072027627860244676947389938822262041977579025855118286140847334266976674509793958586370410877591048451554592134153302776514814954432759521709031139541007278795719825832913044454475378776544511
% Pmax[688]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.190000
% next D is D_1 = 0 at 58.580000s
% 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]=509^1
% Factor [P]=19^1
% Factor [P]=7^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 0 at 58.810000 s

% N_1=1052773089642261949610215903577229341610320726564016097580433187760589303584108995932869270121214509314165882669909230179464576204710366064692607401745308815798542832041713511263166510942943490073974883
% Pmax[668]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 58.960000s
% 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 59.160000s
%T% Ecpp sieve(8): 0.140000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 59.500000s
%T% Ecpp sieve(19): 0.080000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 59.780000s
%T% Ecpp sieve(43): 0.080000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[1]]=43
% A[[1]]=41939984759372680359385136415971428375387746044343863490280251691718607368262991416052709449677477280
% B[[1]]=7551574665533742087630728926197868534097160472608424342781720714671053001743912558847273667255131418
% m[[1]]=1052773089642261949610215903577229341610320726564016097580433187760589303584108995932869270121214509272225897910536549820079439788738937689304861357401445325518291140323106143000175094890234040396497604
% Factor [P]=35617^1
% Factor [P]=397^1
% Factor [P]=2^2
% End of depth 1 at 60.090000 s

% N_2=18613452736679989963369314549458936195779785460400460029601825080143310693413904744862751451953866829226645334974980281401287935846496647358927202591067431104565708481747461447707044326861328149
% Pmax[643]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.140000
% next D is D_1 = 0 at 60.240000s
% 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 60.420000s
%T% Ecpp sieve(4): 0.150000
%T% Ecpp sieve(4): 0.150000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 61.000000s
%T% Ecpp sieve(7): 0.090000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 61.270000s
%T% Ecpp sieve(19): 0.080000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 61.530000s
%T% Ecpp sieve(43): 0.080000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 61.780000s
%T% Ecpp sieve(67): 0.090000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 62.040000s
%T% Ecpp sieve(163): 0.090000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 62.290000s
%T% Ecpp sieve(20): 0.080000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 62.540000s
%T% Ecpp sieve(35): 0.090000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 62.800000s
%T% Ecpp sieve(52): 0.080000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 63.050000s
%T% Ecpp sieve(91): 0.080000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 63.300000s
%T% Ecpp sieve(115): 0.080000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 63.510000s
%T% Ecpp sieve(235): 0.080000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 63.760000s
%T% Ecpp sieve(403): 0.080000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 64.000000s
%T% Ecpp sieve(427): 0.080000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-340)) where (h, g)=(-4, 4)
% next D is D_37 = 340 at 64.200000s
%T% Ecpp sieve(340): 0.080000
% Testing if N is a norm in Q(sqrt(-532)) where (h, g)=(-4, 4)
% next D is D_43 = 532 at 64.450000s
%T% Ecpp sieve(532): 0.080000
% Testing if N is a norm in Q(sqrt(-595)) where (h, g)=(-4, 4)
% next D is D_45 = 595 at 64.700000s
%T% Ecpp sieve(595): 0.080000
% Cofactor after sieve is a probable prime
% Number of D tried was 18
% D[[2]]=595
% A[[2]]=-8249992408989954487406426545331434806465064000532892948254201723926834331340394825893677882355629
% B[[2]]=-103643183939041527270902162730086516783391805040335091686816330502321368724950423398922851532733
% m[[2]]=18613452736679989963369314549458936195779785460400460029601825080143310693413904744862751451953875079219054324929467687827833267281303112422927735484015685306289635316078801842532938004743683779
% Factor [P]=181^1
% End of depth 2 at 65.050000 s

% N_3=102836755451270662781045936737342188926960140665195911765755939669300059079634832844545588132341851266403615054858937501811233520891177416701258207094009311084473123293253048853773138147755159
% Pmax[635]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 65.130000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 65.290000s
%T% Ecpp sieve(19): 0.050000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 65.510000s
%T% Ecpp sieve(67): 0.040000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 65.730000s
%T% Ecpp sieve(163): 0.040000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 65.940000s
%T% Ecpp sieve(403): 0.050000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-760)) where (h, g)=(-4, 4)
% next D is D_49 = 760 at 66.110000s
%T% Ecpp sieve(760): 0.040000
% Testing if N is a norm in Q(sqrt(-155)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-355)) where (h, g)=(4, 2)
% next D is D_81 = 355 at 66.380000s
%T% Ecpp sieve(355): 0.050000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-568)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-955)) 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(-1240)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2755)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-31)) 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)
% next D is D_232 = 107 at 67.000000s
%T% Ecpp sieve(107): 0.050000
% Testing if N is a norm in Q(sqrt(-139)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-283)) where (h, g)=(3, 1)
% next D is D_235 = 283 at 67.270000s
%T% Ecpp sieve(283): 0.040000
% Testing if N is a norm in Q(sqrt(-307)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-331)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-499)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-152)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-247)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-472)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-515)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-856)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1147)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1432)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-3235)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-3763)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1235)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-2680)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-3835)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4120)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-5035)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-5395)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-6232)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-6955)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-9139)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-10915)) where (h, g)=(12, 4)
% next D is D_408 = 10915 at 68.690000s
%T% Ecpp sieve(10915): 0.050000
% Testing if N is a norm in Q(sqrt(-95)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-248)) where (h, g)=(8, 2)
% next D is D_567 = 248 at 68.970000s
%T% Ecpp sieve(248): 0.040000
% Testing if N is a norm in Q(sqrt(-295)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-995)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1195)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1339)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1528)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1795)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1912)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2059)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2395)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2419)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2587)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2995)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3403)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3448)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3595)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4387)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4867)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-5707)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-6355)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-10168)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-11635)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-13795)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-15067)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-18715)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-20155)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-22243)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-9880)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-28120)) where (h, g)=(32, 8)
% next D is D_899 = 28120 at 70.740000s
%T% Ecpp sieve(28120): 0.050000
% Testing if N is a norm in Q(sqrt(-34840)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-103)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-179)) where (h, g)=(5, 1)
% next D is D_1051 = 179 at 71.090000s
%T% Ecpp sieve(179): 0.040000
% Testing if N is a norm in Q(sqrt(-347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-443)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-523)) where (h, g)=(5, 1)
% next D is D_1055 = 523 at 71.420000s
%T% Ecpp sieve(523): 0.040000
% Testing if N is a norm in Q(sqrt(-571)) where (h, g)=(5, 1)
% next D is D_1056 = 571 at 71.620000s
%T% Ecpp sieve(571): 0.040000
% Testing if N is a norm in Q(sqrt(-619)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-739)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-947)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1123)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2203)) where (h, g)=(5, 1)
% next D is D_1068 = 2203 at 72.050000s
%T% Ecpp sieve(2203): 0.040000
% Testing if N is a norm in Q(sqrt(-2347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-415)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-664)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-779)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-923)) where (h, g)=(10, 2)
% next D is D_1091 = 923 at 72.490000s
%T% Ecpp sieve(923): 0.040000
% Testing if N is a norm in Q(sqrt(-1643)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1891)) where (h, g)=(10, 2)
% next D is D_1104 = 1891 at 72.760000s
%T% Ecpp sieve(1891): 0.050000
% Testing if N is a norm in Q(sqrt(-2776)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-3811)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-3928)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-4435)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-4579)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-4915)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-5272)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-5515)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-7363)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-7387)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-10147)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-2360)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-3320)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-3515)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-4355)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-4408)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-5560)) where (h, g)=(20, 4)
% next D is D_1223 = 5560 at 73.900000s
%T% Ecpp sieve(5560): 0.040000
% Testing if N is a norm in Q(sqrt(-6136)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-7163)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-7192)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-8632)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-11320)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-12280)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-13528)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-15355)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-16435)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-21235)) where (h, g)=(20, 4)
% next D is D_1334 = 21235 at 74.630000s
%T% Ecpp sieve(21235): 0.070000
% Testing if N is a norm in Q(sqrt(-22555)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-29203)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-37843)) where (h, g)=(20, 4)
% next D is D_1355 = 37843 at 74.990000s
%T% Ecpp sieve(37843): 0.090000
% Testing if N is a norm in Q(sqrt(-16120)) where (h, g)=(40, 8)
% Testing if N is a norm in Q(sqrt(-50635)) where (h, g)=(40, 8)
% next D is D_1543 = 50635 at 75.310000s
% D too large for using tabjac
%T% Ecpp sieve(50635): 0.100000
% Testing if N is a norm in Q(sqrt(-58435)) where (h, g)=(40, 8)
% Testing if N is a norm in Q(sqrt(-109915)) where (h, g)=(40, 8)
% Testing if N is a norm in Q(sqrt(-1255)) where (h, g)=(12, 2)
% next D is D_1594 = 1255 at 75.700000s
%T% Ecpp sieve(1255): 0.050000
% Testing if N is a norm in Q(sqrt(-1807)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-2155)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-2627)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-2872)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-4555)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-4792)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-5155)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-6283)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-6931)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-7555)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-7891)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-8248)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-9523)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-12307)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-16003)) where (h, g)=(12, 2)
% next D is D_1667 = 16003 at 76.730000s
%T% Ecpp sieve(16003): 0.060000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-7960)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-9715)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-14555)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-16315)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-17560)) where (h, g)=(24, 4)
% next D is D_1800 = 17560 at 77.120000s
%T% Ecpp sieve(17560): 0.050000
% Testing if N is a norm in Q(sqrt(-22072)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-25915)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-31915)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-32635)) where (h, g)=(24, 4)
% next D is D_1880 = 32635 at 77.520000s
%T% Ecpp sieve(32635): 0.080000
% Testing if N is a norm in Q(sqrt(-41035)) where (h, g)=(24, 4)
% next D is D_1893 = 41035 at 77.770000s
% D too large for using tabjac
%T% Ecpp sieve(41035): 0.110000
% Testing if N is a norm in Q(sqrt(-42835)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-52915)) where (h, g)=(24, 4)
% next D is D_1904 = 52915 at 78.110000s
% D too large for using tabjac
%T% Ecpp sieve(52915): 0.110000
% Testing if N is a norm in Q(sqrt(-62155)) where (h, g)=(24, 4)
% next D is D_1908 = 62155 at 78.390000s
% D too large for using tabjac
%T% Ecpp sieve(62155): 0.110000
% Testing if N is a norm in Q(sqrt(-71)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-251)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-463)) where (h, g)=(7, 1)
% next D is D_2268 = 463 at 78.790000s
%T% Ecpp sieve(463): 0.040000
% Testing if N is a norm in Q(sqrt(-467)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-827)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-859)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-1627)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2011)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2083)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2179)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2707)) where (h, g)=(7, 1)
% next D is D_2287 = 2707 at 79.410000s
%T% Ecpp sieve(2707): 0.040000
% Testing if N is a norm in Q(sqrt(-3067)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-3187)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-535)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-536)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-703)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-899)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-1112)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-2008)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-2335)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-3715)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-5251)) where (h, g)=(14, 2)
% next D is D_2346 = 5251 at 80.190000s
%T% Ecpp sieve(5251): 0.040000
% Testing if N is a norm in Q(sqrt(-7067)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-7099)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-7915)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-9235)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-10123)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-10411)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-12667)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-13435)) where (h, g)=(14, 2)
% next D is D_2378 = 13435 at 80.810000s
%T% Ecpp sieve(13435): 0.050000
% Testing if N is a norm in Q(sqrt(-21547)) where (h, g)=(14, 2)
% next D is D_2387 = 21547 at 81.030000s
%T% Ecpp sieve(21547): 0.070000
% Testing if N is a norm in Q(sqrt(-30067)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-1976)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-3224)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-6520)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-7384)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-11128)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-17755)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-19795)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-20920)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-24568)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-28792)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-28795)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-30115)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-30355)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-32227)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-33115)) where (h, g)=(28, 4)
% next D is D_2611 = 33115 at 82.120000s
%T% Ecpp sieve(33115): 0.090000
% Testing if N is a norm in Q(sqrt(-36835)) where (h, g)=(28, 4)
% next D is D_2624 = 36835 at 82.380000s
%T% Ecpp sieve(36835): 0.090000
% Testing if N is a norm in Q(sqrt(-42883)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-44515)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-53755)) where (h, g)=(28, 4)
% next D is D_2659 = 53755 at 82.750000s
% D too large for using tabjac
%T% Ecpp sieve(53755): 0.100000
% Testing if N is a norm in Q(sqrt(-57187)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-66235)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-106723)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-895)) where (h, g)=(16, 2)
% next D is D_2678 = 895 at 83.190000s
%T% Ecpp sieve(895): 0.040000
% Testing if N is a norm in Q(sqrt(-1159)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-2195)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-3832)) where (h, g)=(16, 2)
% next D is D_2698 = 3832 at 83.510000s
%T% Ecpp sieve(3832): 0.040000
% Testing if N is a norm in Q(sqrt(-5363)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-5752)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-6395)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-6595)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-7288)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-8083)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-9763)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-10195)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-19147)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-22843)) where (h, g)=(16, 2)
% next D is D_2765 = 22843 at 84.230000s
%T% Ecpp sieve(22843): 0.070000
% Cofactor after sieve is a probable prime
% Number of D tried was 40
% D[[3]]=22843
% A[[3]]=126548085262860969110018947956237615247370761282457499366640475239107216615869491470651446711252
% B[[3]]=4160109352470746045537389959371407522445827414313016163939132882924648971654604295314082530982
% m[[3]]=102836755451270662781045936737342188926960140665195911765755939669300059079634832844545588132341724718318352193889827482863277283275930045939975749594642670609234016076637179362302486701043908
% Factor [P]=2251^1
% Factor [P]=2^2
% End of depth 3 at 84.520000 s

% N_4=11421230059003849709134377691841646926583756182274090600372716533685035437542740209300931600659898347214388293412908427683615868866718130379828492847028284163619948475859304682619112250227
% Pmax[622]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 84.600000s
% 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 84.760000s
%T% Ecpp sieve(3): 0.070000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 85.190000s
%T% Ecpp sieve(8): 0.080000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 85.440000s
%T% Ecpp sieve(11): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[4]]=11
% A[[4]]=735473256846189025565847593306071578105505888194273435782345448965566602577197162498504487133
% B[[4]]=2025833146779132371247733566160278414823118594444508917944083955435515337833239805922280752173
% m[[4]]=11421230059003849709134377691841646926583756182274090600372716533685035437542740209300931600659162873957542104387342580090309797288612624491634219411245938714654381873282107520120607763095
% Factor [P]=135661^1
% Factor [P]=5^1
% Factor [P]=3^6
% End of depth 4 at 85.660000 s

% N_5=23097253076846850852546965246880863188062619418768637863293157508727673547567497226430761120777570569918734443225583976961514923770969178997232398552973277070388106772686822916751
% Pmax[593]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.070000
% next D is D_1 = 0 at 85.740000s
% 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 85.880000s
%T% Ecpp sieve(11): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[5]]=11
% A[[5]]=59110596017554809211352095171026121207969381677669185371553346145047651447748239876284340
% B[[5]]=89896379614550378247254098671248233979366347005241697963567708849541389675122303594199458
% m[[5]]=23097253076846850852546965246880863188062619418768637863293157508727673547567497226430761061666974552363925231873488805935393715801587501328047026999627132022736659024446946632412
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 5 at 86.100000 s

% N_6=1924771089737237571045580437240071932338551618230719821941096459060639462297291435535896755138914546030327102656124067161282809650132291777337252249968927668561388252037245552701
% Pmax[589]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 86.180000s
% 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 86.310000s
%T% Ecpp sieve(4): 0.090000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[6]]=4
% A[[6]]=54182152956764616392802428546975266746955584780723383845928208903485986501663545389303060
% B[[6]]=34508617256848736352088781644132331379415483184468527119922238796876612744716211522794651
% m[[6]]=1924771089737237571045580437240071932338551618230719821941096459060639462297291435535896700956761589265710709853695520186016062694547511053953406321760024182574886588491856249642
% Factor [P]=137^1
% Factor [P]=2^1
% End of depth 6 at 86.570000 s

% N_7=7024712006340283106005768019124350118023911015440583291755826492922041833201793560349987959696210179801863904575531095569401688666231792167713161758248263440054330614933781933
% Pmax[581]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 86.650000s
% 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 86.780000s
%T% Ecpp sieve(3): 0.070000
% Extra square factor: 11
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[7]]=3
% A[[7]]=2932119903011326983984686063315258651179316595016047688769548643850987840369856729322267
% B[[7]]=-2549609179183218717378521798786829091155388429396056426784465928954764008725402427806691
% m[[7]]=7024712006340283106005768019124350118023911015440583291755826492922041833201793560349985027576307168474879919889467780310750509349636776120024392209604412452213960758204459667
% Factor [P]=463^1
% Factor [P]=3^2
% End of depth 7 at 87.120000 s

% N_8=1685796017840240726183289661416930673871828897393948474143466880950813974850442419090469169084786937478972862944436712337593114794729247928971536407392467591124060657116501
% Pmax[569]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 87.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 87.280000s
%T% Ecpp sieve(3): 0.040000
% Extra square factor: 25
% 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 87.610000s
%T% Ecpp sieve(4): 0.040000
%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 87.900000s
%T% Ecpp sieve(7): 0.030000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 88.050000s
%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 88.200000s
%T% Ecpp sieve(19): 0.030000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[8]]=19
% A[[8]]=15887628560118415797811191093545379233164920149771997905025366011683744228271469569510
% B[[8]]=18482947090845192515632031020288193972130909088580001552981331709067672988833970722804
% m[[8]]=1685796017840240726183289661416930673871828897393948474143466880950813974850442419090453281456226819063175051753343166958359949874579475931066511041380783846895789187546992
% Factor [P]=3^2
% Factor [P]=43^2
% Factor [P]=11^1
% Factor [P]=2^4
% End of depth 8 at 88.410000 s

% N_9=575589595877733775758972110715364390891004725934967739230961207856968131439613283692267893051740641632378084438675275933469343883186747112507754342157644538576608837
% Pmax[548]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 88.450000s
% 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 88.560000s
%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 88.820000s
%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 88.960000s
%T% Ecpp sieve(19): 0.030000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 89.100000s
%T% Ecpp sieve(67): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[9]]=67
% A[[9]]=39513211903431168088487353606865512317770846962064461315677410330854695353451532010
% B[[9]]=3325757614473889012330617453290915551348574218425111145292872261715472403519698212
% m[[9]]=575589595877733775758972110715364390891004725934967739230961207856968131439613283652754681148309473543890730831809763615698496921122285796830344011302949185125076828
% Factor [P]=223^1
% Factor [P]=2^2
% End of depth 9 at 89.270000 s

% N_10=645279816006427999729789361788525101895745208447273250258925120915883555425575430103985068551916450161312478510997492842711319418298526678060923779487611194086409
% Pmax[538]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 89.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 89.410000s
%T% Ecpp sieve(3): 0.040000
% 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 89.670000s
%T% Ecpp sieve(4): 0.040000
%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 89.930000s
%T% Ecpp sieve(8): 0.040000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 90.070000s
%T% Ecpp sieve(19): 0.030000
% 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 90.230000s
%T% Ecpp sieve(67): 0.020000
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 90.360000s
%T% Ecpp sieve(15): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 7
% D[[10]]=15
% A[[10]]=-1539723141638390602457963284491676732543740252283786429483867271943102581166803974
% B[[10]]=-118426323405149681924039195430057930062046039480450641496778044569989683046360192
% m[[10]]=645279816006427999729789361788525101895745208447273250258925120915883555425575431643708210190307052619275763002674225386451571702084956161928195722590192360890384
% Factor [P]=59221^1
% Factor [P]=38671^1
% Factor [P]=5783^1
% Factor [P]=1583^1
% Factor [P]=173^1
% Factor [P]=19^2
% Factor [P]=3^1
% Factor [P]=2^4
% End of depth 10 at 90.520000 s

% N_11=10267348231344372035773533618402813142777824725949879747622271353817661137582511095484730251387168629675097762752376361157738689988157242389
% Pmax[462]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 90.550000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[11]]=1
% Factor [P]=53^1
% Factor [P]=7^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 11 at 90.660000 s

% N_12=2767479307639992462472650570998062841719090222627999931973658046851121600426552855925803302260692353012155731200101445055994256061497909
% Pmax[450]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 90.700000s
% 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 90.760000s
%T% Ecpp sieve(3): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[12]]=3
% A[[12]]=79873637328260633442256950514823330202576477844478259315708010505069
% B[[12]]=-39539513108254378150217915758148948596076462275565447935699935595125
% m[[12]]=2767479307639992462472650570998062841719090222627999931973658046851041726789224595292361045310177529681953154722256966796678548050992841
% Factor [P]=13^1
% Factor [P]=3^3
% End of depth 12 at 90.920000 s

% N_13=7884556432022770548355129831903312939370627414894586700779652555131173010795511667499604117692813474877359415163125261528998712395991
% Pmax[442]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 90.950000s
% 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 91.010000s
%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(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 91.190000s
%T% Ecpp sieve(43): 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 91.290000s
%T% Ecpp sieve(67): 0.020000
% Extra square factor: 97
% Factorization completed using trial division only
% 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 91.410000s
%T% Ecpp sieve(163): 0.010000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 91.470000s
%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 91.550000s
%T% Ecpp sieve(24): 0.020000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 91.630000s
%T% Ecpp sieve(115): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[13]]=115
% A[[13]]=1534378005731040583428409392771297615197671151675505678153802872467
% B[[13]]=503758999174078123325269859730607001026627962071654101485395169855
% m[[13]]=7884556432022770548355129831903312939370627414894586700779652555129638632789780626916175708300042177262161744011449755850844909523525
% Factor [P]=3^2
% Factor [P]=907^1
% Factor [P]=31^1
% Factor [P]=29^1
% Factor [P]=5^2
% End of depth 13 at 91.740000 s

% N_14=42976175943639832017499563370210236396549488896190544250330290929266357219646262610196968187528616002138637409671435905281093
% Pmax[415]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 91.760000s
% 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 91.820000s
%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 91.970000s
%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 92.120000s
%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 92.190000s
%T% Ecpp sieve(11): 0.020000
% Extra square factor: 7
% 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 92.280000s
%T% Ecpp sieve(67): 0.020000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 92.360000s
%T% Ecpp sieve(51): 0.020000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 92.430000s
%T% Ecpp sieve(52): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 92.510000s
%T% Ecpp sieve(91): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 9
% D[[14]]=91
% A[[14]]=-393159225972994467075726783381990553417076479883699258118085411
% B[[14]]=-13800193822048337772467817784060128553088941927045888110049719
% m[[14]]=42976175943639832017499563370210236396549488896190544250330291322425583192640729685923751569519169419215117293370694023366505
% Factor [P]=3^2
% Factor [P]=5^1
% End of depth 14 at 92.630000 s

% N_15=955026132080885155944434741560227475478877531026456538896228696053901848725349548576083368211537098204780384297126533852589
% Pmax[409]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 92.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 92.710000s
%T% Ecpp sieve(3): 0.030000
% 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 92.840000s
%T% Ecpp sieve(4): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[15]]=4
% A[[15]]=-42867150818319174316896785013763349124134913867702840298990566
% B[[15]]=-22262703727551929847462263326027333776673036054478185125423550
% m[[15]]=955026132080885155944434741560227475478877531026456538896228738921052667044523865472868381974886222339694251999966832843156
% Factor [P]=60353^1
% Factor [P]=3049^1
% Factor [P]=41^1
% Factor [P]=2^2
% End of depth 15 at 92.940000 s

% N_16=31645730126087331698180884143880204589906828284969667092630995735607838748973912145615240553967911846167805691157
% Pmax[374]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 92.960000s
% 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 93.010000s
%T% Ecpp sieve(4): 0.020000
%T% Ecpp sieve(4): 0.020000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 93.120000s
%T% Ecpp sieve(163): 0.020000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 93.180000s
%T% Ecpp sieve(148): 0.010000
% Testing if N is a norm in Q(sqrt(-292)) where (h, g)=(4, 2)
% next D is D_78 = 292 at 93.230000s
%T% Ecpp sieve(292): 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(-772)) where (h, g)=(4, 2)
% next D is D_87 = 772 at 93.300000s
%T% Ecpp sieve(772): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[16]]=772
% A[[16]]=-350914375069522894075108009600278182361509558962466964196
% B[[16]]=-2111534408169899857078221660404822055973929201725914711
% m[[16]]=31645730126087331698180884143880204589906828284969667092981910110677361643049020155215518736329421405130272655354
% Factor [P]=8231^1
% Factor [P]=257^1
% Factor [P]=193^1
% Factor [P]=2^1
% End of depth 16 at 93.370000 s

% N_17=38756280495694154353785345489615814297605067377007196927266134734010304236125285923346740639102640707067
% Pmax[345]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 93.390000s
% 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 93.420000s
%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 93.470000s
%T% Ecpp sieve(11): 0.020000
% Extra square factor: 19
% 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 93.530000s
%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 93.580000s
%T% Ecpp sieve(43): 0.020000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 93.620000s
%T% Ecpp sieve(163): 0.010000
% Testing if N is a norm in Q(sqrt(-1387)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1672)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-31)) 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(-283)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-331)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-379)) where (h, g)=(3, 1)
% next D is D_238 = 379 at 93.740000s
%T% Ecpp sieve(379): 0.010000
% Testing if N is a norm in Q(sqrt(-499)) where (h, g)=(3, 1)
% next D is D_239 = 499 at 93.780000s
%T% Ecpp sieve(499): 0.010000
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-424)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-808)) where (h, g)=(6, 2)
% next D is D_261 = 808 at 93.850000s
%T% Ecpp sieve(808): 0.010000
% Testing if N is a norm in Q(sqrt(-1147)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1192)) where (h, g)=(6, 2)
% next D is D_270 = 1192 at 93.910000s
%T% Ecpp sieve(1192): 0.010000
% Testing if N is a norm in Q(sqrt(-2563)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2923)) where (h, g)=(6, 2)
% next D is D_290 = 2923 at 93.970000s
%T% Ecpp sieve(2923): 0.010000
% Testing if N is a norm in Q(sqrt(-2728)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-583)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1864)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4867)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-5587)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-5947)) where (h, g)=(8, 2)
% next D is D_624 = 5947 at 94.070000s
%T% Ecpp sieve(5947): 0.020000
% Testing if N is a norm in Q(sqrt(-3784)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-4712)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6952)) where (h, g)=(16, 4)
% next D is D_710 = 6952 at 94.150000s
%T% Ecpp sieve(6952): 0.030000
% Testing if N is a norm in Q(sqrt(-8968)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-13288)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-79)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-103)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-131)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-179)) where (h, g)=(5, 1)
% next D is D_1051 = 179 at 94.270000s
%T% Ecpp sieve(179): 0.020000
% Testing if N is a norm in Q(sqrt(-227)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-443)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-619)) where (h, g)=(5, 1)
% next D is D_1057 = 619 at 94.340000s
%T% Ecpp sieve(619): 0.010000
% Testing if N is a norm in Q(sqrt(-739)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-787)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1051)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1723)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2203)) where (h, g)=(5, 1)
% next D is D_1068 = 2203 at 94.430000s
%T% Ecpp sieve(2203): 0.020000
% Testing if N is a norm in Q(sqrt(-2347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-296)) where (h, g)=(10, 2)
% next D is D_1074 = 296 at 94.490000s
%T% Ecpp sieve(296): 0.020000
% Testing if N is a norm in Q(sqrt(-803)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1384)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1576)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1643)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-2152)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-3139)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-3811)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-4579)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-6403)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-7363)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-10483)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-12331)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-15688)) where (h, g)=(20, 4)
% next D is D_1311 = 15688 at 94.680000s
% D too large for using tabjac
%T% Ecpp sieve(15688): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 18
% D[[17]]=15688
% A[[17]]=-6135767006029496122522937534642096789847075278500166
% B[[17]]=-86498506717521251177625568992563501148316514923993
% m[[17]]=38756280495694154353785345489615814297605067377007203063033140763506426759062820565443530486177919207234
% Factor [P]=6733^1
% Factor [P]=953^1
% Factor [P]=349^1
% Factor [P]=199^1
% Factor [P]=29^1
% Factor [P]=2^1
% End of depth 17 at 94.760000 s

% N_18=1499457215411803007402652857900049042978394678270590955177689951574190418399755879662360627
% Pmax[300]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 94.770000s
% 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 94.800000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[18]]=3
% A[[18]]=2423377879161221553800215527102597540244342531
% B[[18]]=204180081006344245523797288051098735345834207
% m[[18]]=1499457215411803007402652857900049042978394675847213076016468397773974891297158339418018097
% Factor [P]=541^1
% Factor [P]=151^1
% Factor [P]=7^2
% End of depth 18 at 94.840000 s

% N_19=374596560961003874331484785724415734598294537940810075003008698975900697800536651283
% Pmax[278]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 94.860000s
% 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]=271^1
% Factor [P]=59^1
% Factor [P]=13^1
% Factor [P]=11^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 19 at 94.880000 s

% N_20=27305818274612446576505962193735446513876202034937049160328079501036675549561
% Pmax[254]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 94.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 94.910000s
%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 94.980000s
%T% Ecpp sieve(7): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[20]]=7
% A[[20]]=-248068085881932156654106034922459108614
% B[[20]]=-82536137423316511193872791873142486408
% m[[20]]=27305818274612446576505962193735446514124270120818981316982185535959134658176
% Factor [P]=2^7
% End of depth 20 at 95.020000 s

% N_21=213326705270409738878952829638558175891595860318898291538923324499680739517
% Pmax[247]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 95.030000s
% 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 95.040000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[21]]=3
% A[[21]]=28028588164505324904968123488840013359
% B[[21]]=4750616331459563971019771614383751527
% m[[21]]=213326705270409738878952829638558175863567272154392966633955201010840726159
% Factor [P]=12703^1
% Factor [P]=1579^1
% Factor [P]=43^1
% End of depth 21 at 95.070000 s

% N_22=247336574814339820641416855241128039416919491423108001295226564249
% Pmax[218]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 95.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 95.100000s
%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 95.140000s
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[22]]=4
% A[[22]]=-275835405539478165559995937380614
% B[[22]]=-477823484225145347947169952374100
% m[[22]]=247336574814339820641416855241128315252325030901273561291163944864
% Factor [P]=2^5
% End of depth 22 at 95.180000 s

% N_23=7729267962948119395044276726285259851635157215664798790348873277
% Pmax[213]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 95.190000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[23]]=1
% Factor [P]=1487^1
% Factor [P]=79^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 23 at 95.210000 s

% N_24=10966020508185028893226921258906670542217016130890784535381
% Pmax[193]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 95.230000s
% 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 95.230000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.020000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 95.290000s
%T% Ecpp sieve(11): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[24]]=11
% A[[24]]=-179176736498734429680770313807
% B[[24]]=-32696648605578140898771847445
% m[[24]]=10966020508185028893226921259085847278715750560571554849189
% Factor [P]=3^2
% End of depth 24 at 95.320000 s

% N_25=1218446723131669877025213473231760808746194506730172761021
% Pmax[190]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 95.330000s
% 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]=541^1
% Factor [P]=5^1
% Factor [P]=2^2
% End of depth 25 at 95.340000 s

% N_26=112610602877233814882182391241382699514435721509258111
% Pmax[177]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 95.350000s
% 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^7
% End of depth 26 at 95.360000 s

% N_27=293256778326129726255683310524434113318843024763693
% Pmax[168]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 95.370000s
% 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 95.380000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[27]]=3
% A[[27]]=25320548458837673791769647
% B[[27]]=-13315366299232026854858439
% m[[27]]=293256778326129726255683285203885654481169232994047
% Factor [P]=463^1
% End of depth 27 at 95.400000 s

% N_28=633383970466802864483117246660660160866456226769
% Pmax[159]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 95.400000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[28]]=-1
% Factor [P]=2129^1
% Factor [P]=17^1
% Factor [P]=11^1
% Factor [P]=3^1
% Factor [P]=2^4
% End of depth 28 at 95.410000 s

% N_29=33144277986263189207183732930351725517117
% Pmax[135]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 95.420000s
% 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 95.420000s
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[29]]=4
% A[[29]]=165828222134504781098
% B[[29]]=162078771503829346654
% m[[29]]=33144277986263189207017904708217220736020
% Factor [P]=37^1
% Factor [P]=5^1
% Factor [P]=2^2
% End of depth 29 at 95.450000 s

% N_30=44789564846301607036510682038131379373
% Pmax[126]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 95.450000s
% 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]=31^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 30 at 95.450000 s

% N_31=80268037358963453470449250964393153
% Pmax[116]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 95.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 95.460000s
%T% Ecpp sieve(4): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[31]]=4
% A[[31]]=-338693838804752014
% B[[31]]=-227133569178773348
% m[[31]]=80268037358963453809143089769145168
% Factor [P]=2^4
% End of depth 31 at 95.470000 s

% N_32=5016752334935215863071443110571573
% Pmax[112]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 95.470000s
% 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 95.470000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[32]]=3
% A[[32]]=-137108399387783857
% B[[32]]=-20561259340977591
% m[[32]]=5016752334935216000179842498355431
% Factor [P]=3^3
% End of depth 32 at 95.480000 s

% N_33=185805642034637629636290462902053
% Pmax[108]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 95.480000s
% 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 95.490000s
%T% Ecpp sieve(3): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[33]]=3
% A[[33]]=-6853753113659197
% B[[33]]=15234266598642651
% m[[33]]=185805642034637636490043576561251
% Factor [P]=13^1
% Factor [P]=3^3
% End of depth 33 at 95.500000 s

% N_34=529360803517486143846277995901
% Pmax[99]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 95.500000s
% 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 95.500000s
%T% Ecpp sieve(3): 0.010000
% 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 95.510000s
%T% Ecpp sieve(4): 0.010000
%T% Ecpp sieve(4): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[34]]=4
% A[[34]]=1447289096724630
% B[[34]]=75494179530526
% m[[34]]=529360803517484696557181271272
% Factor [P]=281^1
% Factor [P]=29^1
% Factor [P]=17^1
% Factor [P]=2^3
% End of depth 34 at 95.530000 s

% N_35=477648650066667054562073
% Pmax[79]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 95.530000s
% 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]=3^1
% Factor [P]=2^1
% End of depth 35 at 95.530000 s

% N_36=79608108344444509093679
% Pmax[77]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 95.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 95.540000s
%T% Ecpp sieve(7): 0.000000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 95.540000s
%T% Ecpp sieve(19): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[36]]=19
% A[[36]]=262994138471
% B[[36]]=114539470675
% m[[36]]=79608108344181514955209
% Factor [P]=11^2
% End of depth 36 at 95.540000 s

% N_37=657918250778359627729
% Pmax[70]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 95.550000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[37]]=-1
% Factor [P]=601^1
% Factor [P]=7^1
% Factor [P]=3^1
% Factor [P]=2^4
% End of depth 37 at 95.550000 s

% N_38=3258053297967473
% Pmax[52]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 95.550000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[38]]=1
% Factor [P]=661^1
% Factor [P]=3^3
% Factor [P]=2^1
% End of depth 38 at 95.550000 s

% N_39=91277337871
% Pmax[37]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 95.550000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[39]]=-1
% Factor [P]=227^1
% Factor [P]=5^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 39 at 95.550000 s

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

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

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

% N_43=4363
% Pmax[13]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 95.560000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[43]]=-1
% Factor [P]=727^1
% Factor [P]=3^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 43 at 95.560000 s

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


% Time for building is 37.180000 s

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

% Starting proving job for step 1
% 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.730000
% N_1 is prime
% Time for proof[1] is 0.730000 s

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

% Starting proving job for step 3
% D=22843 h=16 g=2 invcode=11 (Stark's) g0=2
%T% Factor of degree 1 found: 6.580000
%T% one root in FindG2G3s: 6.580000s
% Using Stark's theorem
% E found
%T% find E: 6.700000
% Suggested twist(22843)=1
% Entering AEcModProveLarge
%T% ProveStep(22843): 7.340000
% N_3 is prime
% Time for proof[3] is 7.340000 s

% Starting proving job for step 4
% 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.630000
% N_4 is prime
% Time for proof[4] is 0.630000 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.540000
% N_5 is prime
% Time for proof[5] is 0.540000 s

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

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

% Starting proving job for step 8
% 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.480000
% N_8 is prime
% Time for proof[8] is 0.480000 s

% Starting proving job for step 9
% D=67 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(67)=-1
% Entering AEcModProveLarge
%T% ProveStep(67): 0.450000
% N_9 is prime
% Time for proof[9] is 0.450000 s

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

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

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

% Starting proving job for step 13
% D=115 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.030000
% Suggested twist(115)=-1
% Entering AEcModProveLarge
%T% ProveStep(115): 0.270000
% N_13 is prime
% Time for proof[13] is 0.270000 s

% Starting proving job for step 14
% D=91 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.030000
% Suggested twist(91)=1
% Entering AEcModProveLarge
%T% ProveStep(91): 0.230000
% N_14 is prime
% Time for proof[14] is 0.230000 s

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

% Starting proving job for step 16
% D=772 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.030000
% E found
%T% find E: 0.030000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(772): 0.350000
% N_16 is prime
% Time for proof[16] is 0.350000 s

% Starting proving job for step 17
% D=15688 h=20 g=4 invcode=3 (f1^2/sqrt(2)) g0=4
%T% Factor of degree 1 found: 0.590000
%T% one root in GetInvariant: 0.590000s
% u has been computed
%T% FindJ: 0.620000
% E found
%T% find E: 0.620000
% Entering AEcModProveLarge
%T% ProveStep(15688): 0.750000
% N_17 is prime
% Time for proof[17] is 0.750000 s

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

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

% Starting proving job for step 20
% 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.060000
% N_20 is prime
% Time for proof[20] is 0.060000 s

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

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

% Starting proving job for step 23
%T% ProveStep(1): 0.020000
% N_23 is prime
% Time for proof[23] is 0.020000 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.030000
% N_24 is prime
% Time for proof[24] is 0.030000 s

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

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

% Starting proving job for step 27
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.030000
% N_27 is prime
% Time for proof[27] is 0.030000 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
% E found
%T% find E: 0.000000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.020000
% N_29 is prime
% Time for proof[29] is 0.020000 s

% Starting proving job for step 30
%T% ProveStep(1): 0.010000
% N_30 is prime
% Time for proof[30] is 0.010000 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
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.010000
% N_32 is prime
% Time for proof[32] is 0.010000 s

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

% Starting proving job for step 34
% E found
%T% find E: 0.000000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.010000
% N_34 is prime
% Time for proof[34] is 0.010000 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
% 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.010000
% N_36 is prime
% Time for proof[36] is 0.010000 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
%T% ProveStep(-1): 0.000000
% N_42 is prime
% Time for proof[42] is 0.000000 s

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

% Starting proving job for step 44
% Using complete factorization theorem
% b=1
% Nonresidue is 5
%T% ProveStep(-1): 0.000000
% N_44 is prime
% Time for proof[44] is 0.000000 s
% Time for proving  is 15.180000 s
% Total time is        52.360000 s
This number is prime
%T% PrintCertif: 0.060000
% Time for this number is 52.700000s

Working on 22588431954061225189047661759428483728119373484449553792925620569921165505748309069983517830973306674292050827150154584489860077331286208461841073259567891584253894451102801981023950138214544634592985056297812032837927743042822163995509891
% Performing a quick factorization
% This number might be prime
% Entering ECPP: delay mode
% Starting phase 1: building the sequence of primes
% N_0=22588431954061225189047661759428483728119373484449553792925620569921165505748309069983517830973306674292050827150154584489860077331286208461841073259567891584253894451102801981023950138214544634592985056297812032837927743042822163995509891
% Pmax[792]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.360000
% next D is D_1 = 0 at 111.550000s
% 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 111.850000s
%T% Ecpp sieve(3): 0.240000
% 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 112.880000s
%T% Ecpp sieve(7): 0.160000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 113.340000s
%T% Ecpp sieve(8): 0.270000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 113.920000s
%T% Ecpp sieve(19): 0.150000
% 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 114.470000s
%T% Ecpp sieve(163): 0.140000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 114.830000s
%T% Ecpp sieve(15): 0.160000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 115.290000s
%T% Ecpp sieve(35): 0.150000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 115.750000s
%T% Ecpp sieve(40): 0.140000
% 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 116.300000s
%T% Ecpp sieve(51): 0.150000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 116.760000s
%T% Ecpp sieve(91): 0.150000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 117.200000s
%T% Ecpp sieve(115): 0.150000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 12
% D[[0]]=115
% A[[0]]=-241143790590118183034947283521927939652291068620850182630902567570650164275411201091433884758167943678142607787301161008
% B[[0]]=-16734083956969544206665681701396800184424077905430369300134808368971516179626928921669407862666804234354047308426308430
% m[[0]]=22588431954061225189047661759428483728119373484449553792925620569921165505748309069983517830973306674292050827150154584731003867921404391496788356781495831236544963071952984611926517708864708910004186147731696791005871421185429951296670900
% Factor [P]=3^2
% Factor [P]=366167^1
% Factor [P]=7^1
% Factor [P]=5^2
% Factor [P]=2^2
% End of depth 0 at 117.880000 s

% N_1=9791885641069587941527617552693769890197717263473264624518243094093967058290520259180689490658420049682444239554913201731053268617179398495806626173171583577700955805512188931369513333284222646958678515944605547536346791016827629
% Pmax[761]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.230000
% next D is D_1 = 0 at 118.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 118.380000s
%T% Ecpp sieve(4): 0.230000
%T% Ecpp sieve(4): 0.220000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 119.280000s
%T% Ecpp sieve(43): 0.120000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 119.670000s
%T% Ecpp sieve(67): 0.130000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 120.060000s
%T% Ecpp sieve(163): 0.120000
% 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 120.370000s
%T% Ecpp sieve(20): 0.130000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 120.780000s
%T% Ecpp sieve(52): 0.120000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 121.170000s
%T% Ecpp sieve(115): 0.120000
% Testing if N is a norm in Q(sqrt(-355)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-772)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-955)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-260)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-3172)) where (h, g)=(8, 4)
% next D is D_144 = 3172 at 121.940000s
%T% Ecpp sieve(3172): 0.110000
% Testing if N is a norm in Q(sqrt(-23)) 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(-283)) where (h, g)=(3, 1)
% next D is D_235 = 283 at 122.800000s
%T% Ecpp sieve(283): 0.120000
% Cofactor after sieve is a probable prime
% Number of D tried was 10
% D[[1]]=283
% A[[1]]=5413523788442332813975018547136424312716777265623887793758623636454870969095723550431686369147752526141736609849129
% B[[1]]=186669742535471175974285027803872852480323048425969274394167814959402833034785692520133937556892149843729918790725
% m[[1]]=9791885641069587941527617552693769890197717263473264624518243094093967058290520259180689490658420049682444239554907788207264826284365423477259489748858866800435331917718430307733058462315126923408246829575457795010205054406978501
% Factor [P]=252419^1
% Factor [P]=2221^1
% Factor [P]=1301^1
% Factor [P]=97^1
% End of depth 1 at 123.230000 s

% N_2=138403381645003146255895832641503312488300175168966999379112439380005288550699719612941951743255552195617696563868227021938812281563841631485253728458813152452844112030629931572602696584673898709217650913221481312167
% Pmax[715]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.230000
% next D is D_1 = 0 at 123.460000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 123.690000s
%T% Ecpp sieve(43): 0.130000
% Testing if N is a norm in Q(sqrt(-31)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-59)) where (h, g)=(3, 1)
% next D is D_230 = 59 at 124.130000s
%T% Ecpp sieve(59): 0.130000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[2]]=59
% A[[2]]=-372625192302682130438529894524178600180509025164303481854967508577663001326797410388709724544043991727741047
% B[[2]]=-83844488073830717822510950114173307736510399417117063031663447128066722544504069769643814846210961673260551
% m[[2]]=138403381645003146255895832641503312488300175168966999379112439380005288550699719612941951743255552195617696936493419324620942720093736155663853908967838316756325966998138509235604023382084287418942194957213209053215
% Factor [P]=18061^1
% Factor [P]=4447^1
% Factor [P]=5^1
% Factor [P]=3^2
% End of depth 2 at 124.610000 s

% N_3=38293517920901020437111080884181566389509348432985842779710796290473404277978321928083299321553401239671635113030598548246845633688577729469874048646445080733892215784721334990313138292219222000874273041081
% Pmax[683]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 124.760000s
% 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 124.960000s
%T% Ecpp sieve(3): 0.130000
% 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 125.620000s
%T% Ecpp sieve(4): 0.150000
%T% Ecpp sieve(4): 0.150000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 126.250000s
%T% Ecpp sieve(8): 0.150000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 126.590000s
%T% Ecpp sieve(11): 0.100000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 126.900000s
%T% Ecpp sieve(19): 0.090000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 127.120000s
%T% Ecpp sieve(67): 0.090000
% 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 127.490000s
%T% Ecpp sieve(163): 0.080000
% No factor found, sieve only: no PRP test
% Extra square factor: 9
% 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 127.770000s
%T% Ecpp sieve(15): 0.090000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 128.050000s
%T% Ecpp sieve(20): 0.090000
% Cofactor after sieve is a probable prime
% Number of D tried was 10
% D[[3]]=20
% A[[3]]=12140473625992932029238210708300428609762994367224287993819156214096893397596659627198403820054610386388
% B[[3]]=537725386241625702999741675875096351552076041262248700776938347403520366608981878219566768208061274583
% m[[3]]=38293517920901020437111080884181566389509348432985842779710796290473404277978321928083299321553401239659494639404605616217607422980277300860111054279220792740073059570624441592716478665020818180819662654694
% Factor [P]=2069^1
% Factor [P]=23^1
% Factor [P]=2^1
% End of depth 3 at 128.380000 s

% N_4=402352721551064581052714826362048105464825986435222253763746362351833528883711117827172329854302658705733652461855187511480104051319449648644703955694000386030565696205102670820985549257368800101074481
% Pmax[667]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 128.530000s
% 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]=232363^1
% Factor [P]=14011^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 4 at 128.800000 s

% N_5=20597740617771882039666463328541623549852807935497342715141894173932169577251434796688728461990617205666988318923904567311849775600416888275161082776543638177084312385808034709065883401765179
% Pmax[633]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 128.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 129.040000s
%T% Ecpp sieve(3): 0.060000
% 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 129.410000s
%T% Ecpp sieve(8): 0.080000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 129.650000s
%T% Ecpp sieve(67): 0.040000
% 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 129.890000s
%T% Ecpp sieve(163): 0.050000
% 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 130.130000s
%T% Ecpp sieve(15): 0.050000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 130.340000s
%T% Ecpp sieve(40): 0.040000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 130.570000s
%T% Ecpp sieve(115): 0.040000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 130.810000s
%T% Ecpp sieve(232): 0.040000
% Extra square factor: 3
% 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 131.050000s
%T% Ecpp sieve(235): 0.050000
% No factor found, sieve only: no PRP test
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-435)) where (h, g)=(-4, 4)
% next D is D_40 = 435 at 131.250000s
%T% Ecpp sieve(435): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 11
% D[[5]]=435
% A[[5]]=-269249623752240756479656621557818675460209637572571473658295740980910254409588752129286620168591
% B[[5]]=-4769539986099124124304825911497131487355119349343556790848871174223571685023296330102034614499
% m[[5]]=20597740617771882039666463328541623549852807935497342715141894173932169577251434796688728461990886455290740559680384223933407594275877097912733654250201933918065222640217623461195170021933771
% Factor [P]=199^1
% Factor [P]=89^1
% Factor [P]=23^1
% End of depth 5 at 131.550000 s

% N_6=50564843312242409015439835544458058612193375120589127157875096473898976016505180510978754205789294433306592954220011203878227469236453635821348202296784199252405708661081723864056899107
% Pmax[614]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 131.630000s
% 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 131.770000s
%T% Ecpp sieve(3): 0.070000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 132.190000s
%T% Ecpp sieve(7): 0.050000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 132.390000s
%T% Ecpp sieve(8): 0.080000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 132.620000s
%T% Ecpp sieve(11): 0.050000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 132.820000s
%T% Ecpp sieve(427): 0.050000
% Testing if N is a norm in Q(sqrt(-168)) where (h, g)=(-4, 4)
% next D is D_32 = 168 at 133.030000s
%T% Ecpp sieve(168): 0.040000
% Testing if N is a norm in Q(sqrt(-483)) where (h, g)=(-4, 4)
% next D is D_41 = 483 at 133.230000s
%T% Ecpp sieve(483): 0.040000
% Testing if N is a norm in Q(sqrt(-219)) 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(-264)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-552)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-616)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1288)) where (h, g)=(8, 4)
% next D is D_119 = 1288 at 133.700000s
%T% Ecpp sieve(1288): 0.040000
% 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)
% Testing if N is a norm in Q(sqrt(-1992)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2163)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2667)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-3507)) where (h, g)=(8, 4)
% 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)
% next D is D_234 = 211 at 134.500000s
%T% Ecpp sieve(211): 0.040000
% Testing if N is a norm in Q(sqrt(-283)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-307)) where (h, g)=(3, 1)
% next D is D_236 = 307 at 134.750000s
%T% Ecpp sieve(307): 0.040000
% Testing if N is a norm in Q(sqrt(-331)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-379)) where (h, g)=(3, 1)
% next D is D_238 = 379 at 135.000000s
%T% Ecpp sieve(379): 0.050000
% Extra square factor: 9
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-547)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-424)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-843)) where (h, g)=(6, 2)
% next D is D_263 = 843 at 135.450000s
%T% Ecpp sieve(843): 0.040000
% Testing if N is a norm in Q(sqrt(-1059)) where (h, g)=(6, 2)
% next D is D_266 = 1059 at 135.650000s
%T% Ecpp sieve(1059): 0.050000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-1192)) where (h, g)=(6, 2)
% next D is D_270 = 1192 at 135.800000s
%T% Ecpp sieve(1192): 0.040000
% Testing if N is a norm in Q(sqrt(-1219)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1267)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1347)) where (h, g)=(6, 2)
% next D is D_275 = 1347 at 136.100000s
%T% Ecpp sieve(1347): 0.050000
% Testing if N is a norm in Q(sqrt(-2283)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2443)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2787)) where (h, g)=(6, 2)
% next D is D_289 = 2787 at 136.420000s
%T% Ecpp sieve(2787): 0.050000
% Testing if N is a norm in Q(sqrt(-3427)) where (h, g)=(6, 2)
% next D is D_292 = 3427 at 136.620000s
%T% Ecpp sieve(3427): 0.040000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-231)) where (h, g)=(12, 4)
% next D is D_295 = 231 at 136.840000s
%T% Ecpp sieve(231): 0.050000
% Testing if N is a norm in Q(sqrt(-2472)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-3048)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-3304)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4587)) where (h, g)=(12, 4)
% next D is D_371 = 4587 at 137.200000s
%T% Ecpp sieve(4587): 0.050000
% Testing if N is a norm in Q(sqrt(-4648)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-6963)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-7107)) where (h, g)=(12, 4)
% next D is D_396 = 7107 at 137.510000s
%T% Ecpp sieve(7107): 0.050000
% Testing if N is a norm in Q(sqrt(-10248)) where (h, g)=(24, 8)
% Testing if N is a norm in Q(sqrt(-12243)) where (h, g)=(24, 8)
% Testing if N is a norm in Q(sqrt(-183)) where (h, g)=(8, 2)
% next D is D_566 = 183 at 137.810000s
%T% Ecpp sieve(183): 0.040000
% Testing if N is a norm in Q(sqrt(-371)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-579)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-583)) where (h, g)=(8, 2)
% next D is D_576 = 583 at 138.110000s
%T% Ecpp sieve(583): 0.050000
% Testing if N is a norm in Q(sqrt(-1043)) where (h, g)=(8, 2)
% next D is D_583 = 1043 at 138.310000s
%T% Ecpp sieve(1043): 0.040000
% Testing if N is a norm in Q(sqrt(-1731)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2248)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2947)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3787)) where (h, g)=(8, 2)
% next D is D_613 = 3787 at 138.680000s
%T% Ecpp sieve(3787): 0.040000
% Testing if N is a norm in Q(sqrt(-3883)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1416)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-2568)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-2739)) where (h, g)=(16, 4)
% next D is D_652 = 2739 at 139.040000s
%T% Ecpp sieve(2739): 0.040000
% Testing if N is a norm in Q(sqrt(-3336)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-3531)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-4008)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-4179)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-4683)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-5907)) where (h, g)=(16, 4)
% next D is D_691 = 5907 at 139.510000s
%T% Ecpp sieve(5907): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 27
% D[[6]]=5907
% A[[6]]=220493094553761567137701702347031753406158644594530752738049034856779521885984862422620247041
% B[[6]]=5100018231959955862021293729424655820265402222215899338890490402971447885228771471290074739
% m[[6]]=50564843312242409015439835544458058612193375120589127157875096473898976016505180510978754205568801338752831387082309501531195715830294991226817449558735164395626186775096861441436652067
% Factor [P]=21673^1
% Factor [P]=149^1
% Factor [P]=7^1
% End of depth 6 at 139.740000 s

% N_7=2236893597113551556827463040022273831935285254279568157997466680794802233994313389254390565069377154203018702553557410684947909650642940962009118872593956762972294982751197047753
% Pmax[590]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.070000
% next D is D_1 = 0 at 139.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 139.950000s
%T% Ecpp sieve(4): 0.080000
%T% Ecpp sieve(4): 0.090000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 140.350000s
%T% Ecpp sieve(8): 0.080000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 140.560000s
%T% Ecpp sieve(11): 0.050000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 140.740000s
%T% Ecpp sieve(67): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[7]]=67
% A[[7]]=26458161600984721647027122922308959378542016897167205200492168647598269435394275549024417
% B[[7]]=11094936368997132778068805869612153865229711225333805746975649182639252869987151595275663
% m[[7]]=2236893597113551556827463040022273831935285254279568157997466680794802233994313389254390538611215553218297055526434488375988531108626043794803918380425309164702859588475648023337
% Factor [P]=1031^1
% End of depth 7 at 140.960000 s

% N_8=2169634914756112082276879767237898964049743214626157282247785335397480343350449456114830784297978228145777939404883111906875393897794416871778776314670522953155052947115080527
% Pmax[580]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 141.040000s
% 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 141.160000s
%T% Ecpp sieve(11): 0.050000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 141.340000s
%T% Ecpp sieve(19): 0.050000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 141.520000s
%T% Ecpp sieve(67): 0.050000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 141.660000s
%T% Ecpp sieve(163): 0.040000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 141.830000s
%T% Ecpp sieve(88): 0.050000
% Testing if N is a norm in Q(sqrt(-568)) where (h, g)=(4, 2)
% next D is D_83 = 568 at 142.010000s
%T% Ecpp sieve(568): 0.040000
% Testing if N is a norm in Q(sqrt(-1243)) where (h, g)=(4, 2)
% next D is D_92 = 1243 at 142.170000s
%T% Ecpp sieve(1243): 0.050000
% Testing if N is a norm in Q(sqrt(-31)) 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(-283)) where (h, g)=(3, 1)
% next D is D_235 = 283 at 142.540000s
%T% Ecpp sieve(283): 0.040000
% Testing if N is a norm in Q(sqrt(-307)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-331)) 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)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-152)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-451)) where (h, g)=(6, 2)
% next D is D_255 = 451 at 143.000000s
%T% Ecpp sieve(451): 0.040000
% Testing if N is a norm in Q(sqrt(-472)) where (h, g)=(6, 2)
% next D is D_256 = 472 at 143.170000s
%T% Ecpp sieve(472): 0.050000
% Testing if N is a norm in Q(sqrt(-856)) where (h, g)=(6, 2)
% next D is D_264 = 856 at 143.350000s
%T% Ecpp sieve(856): 0.040000
% Testing if N is a norm in Q(sqrt(-1147)) where (h, g)=(6, 2)
% next D is D_269 = 1147 at 143.530000s
%T% Ecpp sieve(1147): 0.040000
% Testing if N is a norm in Q(sqrt(-1363)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1432)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-3763)) where (h, g)=(6, 2)
% next D is D_294 = 3763 at 143.790000s
%T% Ecpp sieve(3763): 0.050000
% Testing if N is a norm in Q(sqrt(-3256)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-6232)) where (h, g)=(12, 4)
% next D is D_388 = 6232 at 144.020000s
%T% Ecpp sieve(6232): 0.040000
% Testing if N is a norm in Q(sqrt(-11803)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-248)) where (h, g)=(8, 2)
% next D is D_567 = 248 at 144.250000s
%T% Ecpp sieve(248): 0.050000
% Testing if N is a norm in Q(sqrt(-376)) where (h, g)=(8, 2)
% next D is D_571 = 376 at 144.430000s
%T% Ecpp sieve(376): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 17
% D[[8]]=376
% A[[8]]=2056366491134675479728531185235692483754302111976729702528633824956161707343014286207598
% B[[8]]=108788010148311006381211877476904427276388628502084839584133515242245650319346622011623
% m[[8]]=2169634914756112082276879767237898964049743214626157282247785335397480343350449456114828727931487093470298210873697876214391639595682440142076247680845566791447709932828872930
% Factor [P]=757^1
% Factor [P]=7^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 8 at 144.630000 s

% N_9=40944233152596944372086804439288525458572244095605912101298081437959621501235128441495163765455502801855033230301903683985499898012501229327726885843471726579500093089807
% Pmax[564]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 144.670000s
% 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 144.790000s
%T% Ecpp sieve(11): 0.030000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 144.940000s
%T% Ecpp sieve(67): 0.020000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 145.080000s
%T% Ecpp sieve(88): 0.030000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 145.220000s
%T% Ecpp sieve(187): 0.030000
% Testing if N is a norm in Q(sqrt(-184)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-568)) where (h, g)=(4, 2)
% next D is D_83 = 568 at 145.410000s
%T% Ecpp sieve(568): 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)
% Testing if N is a norm in Q(sqrt(-31)) 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(-331)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-499)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-451)) where (h, g)=(6, 2)
% next D is D_255 = 451 at 145.810000s
%T% Ecpp sieve(451): 0.020000
% Testing if N is a norm in Q(sqrt(-1048)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1363)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2227)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-3427)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-15283)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-248)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-376)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-632)) where (h, g)=(8, 2)
% next D is D_577 = 632 at 146.250000s
%T% Ecpp sieve(632): 0.020000
% Testing if N is a norm in Q(sqrt(-979)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2059)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3883)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4267)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4843)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4867)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4216)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-7843)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-10168)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-16027)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-19987)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-47)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-79)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-131)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-227)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-443)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-523)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-571)) where (h, g)=(5, 1)
% next D is D_1056 = 571 at 147.120000s
%T% Ecpp sieve(571): 0.020000
% Testing if N is a norm in Q(sqrt(-739)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-787)) where (h, g)=(5, 1)
% next D is D_1061 = 787 at 147.300000s
%T% Ecpp sieve(787): 0.020000
% Testing if N is a norm in Q(sqrt(-1051)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1123)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1867)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-319)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1891)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-2363)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-3859)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-5272)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-7123)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-7627)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-8947)) where (h, g)=(10, 2)
% next D is D_1153 = 8947 at 147.900000s
%T% Ecpp sieve(8947): 0.040000
% Testing if N is a norm in Q(sqrt(-9307)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-10483)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-2552)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-5368)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-7192)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-7667)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-43747)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-1067)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-1336)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-2104)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-2867)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-4792)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-5371)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-7291)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-8248)) where (h, g)=(12, 2)
% next D is D_1653 = 8248 at 148.650000s
%T% Ecpp sieve(8248): 0.030000
% Testing if N is a norm in Q(sqrt(-10603)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-10747)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-3128)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-9112)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-22072)) where (h, g)=(24, 4)
% next D is D_1829 = 22072 at 148.970000s
%T% Ecpp sieve(22072): 0.030000
% Testing if N is a norm in Q(sqrt(-56947)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-57523)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-202147)) where (h, g)=(48, 8)
% Testing if N is a norm in Q(sqrt(-71)) where (h, g)=(7, 1)
% next D is D_2264 = 71 at 149.250000s
%T% Ecpp sieve(71): 0.030000
% Testing if N is a norm in Q(sqrt(-251)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-463)) where (h, g)=(7, 1)
% next D is D_2268 = 463 at 149.440000s
%T% Ecpp sieve(463): 0.030000
% Testing if N is a norm in Q(sqrt(-827)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-1171)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-1523)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-1787)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-1987)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2083)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2251)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2467)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2707)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-3019)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-3907)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-4603)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-391)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-536)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-899)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-1112)) where (h, g)=(14, 2)
% next D is D_2308 = 1112 at 150.210000s
%T% Ecpp sieve(1112): 0.020000
% Testing if N is a norm in Q(sqrt(-1403)) where (h, g)=(14, 2)
% next D is D_2311 = 1403 at 150.350000s
%T% Ecpp sieve(1403): 0.030000
% Testing if N is a norm in Q(sqrt(-1816)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-2008)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-2123)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-3352)) where (h, g)=(14, 2)
% next D is D_2331 = 3352 at 150.630000s
%T% Ecpp sieve(3352): 0.020000
% Testing if N is a norm in Q(sqrt(-5027)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-6499)) where (h, g)=(14, 2)
% next D is D_2353 = 6499 at 150.820000s
%T% Ecpp sieve(6499): 0.020000
% Testing if N is a norm in Q(sqrt(-8899)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-9427)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-13483)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-18547)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-21547)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-1496)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-3608)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-18139)) where (h, g)=(28, 4)
% next D is D_2539 = 18139 at 151.260000s
%T% Ecpp sieve(18139): 0.040000
% Testing if N is a norm in Q(sqrt(-18328)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-19459)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-21208)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-23851)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-37048)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-40843)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-50083)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-73627)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-799)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-943)) where (h, g)=(16, 2)
% next D is D_2679 = 943 at 151.810000s
%T% Ecpp sieve(943): 0.020000
% Testing if N is a norm in Q(sqrt(-1139)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-3832)) where (h, g)=(16, 2)
% next D is D_2698 = 3832 at 151.990000s
%T% Ecpp sieve(3832): 0.030000
% Testing if N is a norm in Q(sqrt(-5752)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-7003)) where (h, g)=(16, 2)
% next D is D_2716 = 7003 at 152.170000s
%T% Ecpp sieve(7003): 0.030000
% Testing if N is a norm in Q(sqrt(-7051)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-11203)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-11512)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-11563)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-16531)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-17323)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-18883)) where (h, g)=(16, 2)
% next D is D_2761 = 18883 at 152.570000s
%T% Ecpp sieve(18883): 0.050000
% Testing if N is a norm in Q(sqrt(-24403)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-28963)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-5336)) where (h, g)=(32, 4)
% Testing if N is a norm in Q(sqrt(-6392)) where (h, g)=(32, 4)
% next D is D_2804 = 6392 at 152.870000s
%T% Ecpp sieve(6392): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 25
% D[[9]]=6392
% A[[9]]=-166923828032998035892961917364730460049267927351128020725175708756237666662290542690
% B[[9]]=-160055660025892037268934806408869635161258065218625879338687575512953697683351647197
% m[[9]]=40944233152596944372086804439288525458572244095605912101298081437959621501235128441495330689283535799890926192219268414445549165939852357348452061552227964246162383632498
% Factor [P]=36877^1
% Factor [P]=11261^1
% Factor [P]=43^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 9 at 153.080000 s

% N_10=127385277980770648087182568643086986723987335697875179295651972937852332980732389100682625267493143359466141800311599945125222341781567507283096981208634876491
% Pmax[526]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 153.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 153.220000s
%T% Ecpp sieve(3): 0.030000
% Extra square factor: 5
% Factorization completed using trial division only
% No factor found, sieve only: no PRP test
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[10]]=3
% A[[10]]=9680748639283627446430113884596821224291545261694237163848087280276665098057576
% B[[10]]=-11773192964047473274212506260971232194570667927692565007674027807407789079530586
% m[[10]]=127385277980770648087182568643086986723987335697875179295651972937852332980732379419933985983865696929352257203490375653579960647544403659195816704543536818916
% Factor [P]=3541^1
% Factor [P]=1171^1
% Factor [P]=277^1
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 10 at 153.470000 s

% N_11=3960943220440325284756475317627739755903119455068226472802180584363966695802519480479911301687887232655722058286829788546126564989517340675679353101
% Pmax[491]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 153.510000s
% 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 153.590000s
%T% Ecpp sieve(3): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[11]]=3
% A[[11]]=113934592860593053228419687243374633315908323659243134776318796430057632211
% B[[11]]=30890567230424886902043876114647105085166532812419862050358662226975819781
% m[[11]]=3960943220440325284756475317627739755903119455068226472802180584363966695688584887619318248459467545412347424970921464886883430213198544245621720891
% Factor [P]=51517^1
% Factor [P]=3^1
% End of depth 11 at 153.730000 s

% N_12=25628712984324431965865476882244306124859233877931727862014355030792209016367314916236829580264556977388353520656103583198319196984804655069341
% Pmax[474]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 153.760000s
% 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 153.840000s
%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(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 154.060000s
%T% Ecpp sieve(4): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[12]]=4
% A[[12]]=-173408293291254266347874532594466797467269370203036356705259770533130710
% B[[12]]=-134577501606984876870508394930697720811622971426737121769935428486621354
% m[[12]]=25628712984324431965865476882244306124859233877931727862014355030792209189775608207491095928139089571855150987925473786234675902244575188200052
% Factor [P]=229^1
% Factor [P]=2^2
% End of depth 12 at 154.230000 s

% N_13=27978944306031039264045280439131338564256805543593589369011304618768787325082541711234820882247914379754531646206849111609908190223335358297
% Pmax[464]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 154.270000s
% 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 154.340000s
%T% Ecpp sieve(3): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[13]]=3
% A[[13]]=8107668026712061502435437768143362270891809228190809418748845603764655
% B[[13]]=-3923497436078984867043707960657354915072078459849845730296637462889311
% m[[13]]=27978944306031039264045280439131338564256805543593589369011304618768779217414514999173318446810146236392260754397620920800489441377731593643
% Factor [P]=7^1
% Factor [P]=3^1
% End of depth 13 at 154.520000 s

% N_14=1332330681239573298287870497101492312583657406837789969952919267560418057972119761865396116514768868399631464495124805752404259113225313983
% Pmax[459]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 154.550000s
% 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]=47^1
% Factor [P]=13^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 14 at 154.630000 s

% N_15=363428991063713392877215083770183391321237699628420613735111638723518291863644234005836365661420858810592325285085871727333404013427527
% Pmax[448]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 154.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 154.730000s
%T% Ecpp sieve(3): 0.030000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 154.910000s
%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 155.000000s
%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(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 155.100000s
%T% Ecpp sieve(67): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 155.170000s
%T% Ecpp sieve(163): 0.010000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 155.230000s
%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 155.320000s
%T% Ecpp sieve(51): 0.010000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 155.400000s
%T% Ecpp sieve(88): 0.020000
% Extra square factor: 3
% 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 155.500000s
%T% Ecpp sieve(187): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-312)) where (h, g)=(-4, 4)
% next D is D_36 = 312 at 155.610000s
%T% Ecpp sieve(312): 0.010000
% Testing if N is a norm in Q(sqrt(-408)) where (h, g)=(-4, 4)
% next D is D_39 = 408 at 155.690000s
%T% Ecpp sieve(408): 0.010000
% Testing if N is a norm in Q(sqrt(-627)) where (h, g)=(-4, 4)
% next D is D_46 = 627 at 155.770000s
%T% Ecpp sieve(627): 0.020000
% Testing if N is a norm in Q(sqrt(-39)) where (h, g)=(4, 2)
% next D is D_67 = 39 at 155.850000s
%T% Ecpp sieve(39): 0.020000
% Testing if N is a norm in Q(sqrt(-219)) where (h, g)=(4, 2)
% next D is D_75 = 219 at 155.930000s
%T% Ecpp sieve(219): 0.020000
% Testing if N is a norm in Q(sqrt(-291)) where (h, g)=(4, 2)
% next D is D_77 = 291 at 156.020000s
%T% Ecpp sieve(291): 0.020000
% Testing if N is a norm in Q(sqrt(-323)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1027)) where (h, g)=(4, 2)
% next D is D_90 = 1027 at 156.130000s
%T% Ecpp sieve(1027): 0.020000
% Testing if N is a norm in Q(sqrt(-1227)) where (h, g)=(4, 2)
% next D is D_91 = 1227 at 156.210000s
%T% Ecpp sieve(1227): 0.020000
% Testing if N is a norm in Q(sqrt(-1243)) where (h, g)=(4, 2)
% next D is D_92 = 1243 at 156.300000s
%T% Ecpp sieve(1243): 0.020000
% Testing if N is a norm in Q(sqrt(-1387)) where (h, g)=(4, 2)
% next D is D_93 = 1387 at 156.380000s
%T% Ecpp sieve(1387): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1411)) where (h, g)=(4, 2)
% next D is D_94 = 1411 at 156.490000s
%T% Ecpp sieve(1411): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 21
% D[[15]]=1411
% A[[15]]=25714171994830169985848477794327918830936160011178498090661186569293
% B[[15]]=749437456346151146072652132046328778919765156672617144342680315063
% m[[15]]=363428991063713392877215083770183391321237699628420613735111638723492577691649403835850517183626530891761389125074693229242742826858235
% Factor [P]=5^1
% End of depth 15 at 156.590000 s

% N_16=72685798212742678575443016754036678264247539925684122747022327744698515538329880767170103436725306178352277825014938645848548565371647
% Pmax[445]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 156.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 156.680000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[16]]=3
% A[[16]]=16951786913309478509266183099147816699581479446102360619743940905321
% B[[16]]=1061463344746332922282365031063821762582746392043030614249676202293
% m[[16]]=72685798212742678575443016754036678264247539925684122747022327744681563751416571288660837253626158361652696345568836285228804624466327
% Factor [P]=9349^1
% Factor [P]=457^1
% End of depth 16 at 156.780000 s

% N_17=17012502586368819931464607842315172491621996788686165839715203218514708801492845345483500441926097564502199616375927657512558739
% Pmax[423]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 156.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 156.860000s
%T% Ecpp sieve(3): 0.030000
% Extra square factor: 11
% Factorization completed using trial division only
% 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 157.020000s
%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 157.100000s
%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 157.170000s
%T% Ecpp sieve(19): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[17]]=19
% A[[17]]=6697877134750990039178561839961120716971995931336923389367693880
% B[[17]]=1104737459481595510094665084275649790571578119071638475368500882
% m[[17]]=17012502586368819931464607842315172491621996788686165839715203211816831666741855306304938601964976847530203685039004268144864860
% Factor [P]=3923^1
% Factor [P]=5^1
% Factor [P]=2^2
% End of depth 17 at 157.260000 s

% N_18=216830264929503185463479579942839312918965036817310296198256477336436804317382810429581170047985939937932751529938876728841
% Pmax[407]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 157.290000s
% 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 157.340000s
%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 157.480000s
%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 157.570000s
%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 157.640000s
%T% Ecpp sieve(19): 0.020000
% 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 157.690000s
%T% Ecpp sieve(20): 0.020000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 157.760000s
%T% Ecpp sieve(40): 0.020000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 157.830000s
%T% Ecpp sieve(88): 0.020000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 157.900000s
%T% Ecpp sieve(235): 0.020000
% Testing if N is a norm in Q(sqrt(-760)) where (h, g)=(-4, 4)
% next D is D_49 = 760 at 157.970000s
%T% Ecpp sieve(760): 0.020000
% Testing if N is a norm in Q(sqrt(-55)) where (h, g)=(4, 2)
% next D is D_68 = 55 at 158.040000s
%T% Ecpp sieve(55): 0.020000
% Testing if N is a norm in Q(sqrt(-155)) where (h, g)=(4, 2)
% next D is D_72 = 155 at 158.110000s
%T% Ecpp sieve(155): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 12
% D[[18]]=155
% A[[18]]=-2840366842850560305945965512918826787198044245282783172976597
% B[[18]]=-2354478746389592899296100502319085288917058124771804079918119
% m[[18]]=216830264929503185463479579942839312918965036817310296198256480176803647167943116375546682966812727135976996812722049705439
% Factor [P]=2393^1
% Factor [P]=3^1
% End of depth 18 at 158.200000 s

% N_19=30203407846427522700025014618030270639220648672142400919105234736983374727391435628297351019196646766398801617596050941
% Pmax[394]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 158.230000s
% 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 158.270000s
%T% Ecpp sieve(4): 0.040000
%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 158.420000s
%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 158.480000s
%T% Ecpp sieve(11): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[19]]=11
% A[[19]]=83162904469090290012452853376756281612826686916819811875317
% B[[19]]=101756198250334453327996466986290731416378209706625301592055
% m[[19]]=30203407846427522700025014618030270639220648672142400919105151574078905637101423175443974262915033939711884797784175625
% Factor [P]=37097^1
% Factor [P]=23^1
% Factor [P]=11^1
% Factor [P]=5^4
% Factor [P]=3^2
% End of depth 19 at 158.550000 s

% N_20=572102847161797259565301603449253994021856928361376308877290226631300316321815025908355070618897897231721949
% Pmax[358]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 158.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 158.600000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[20]]=4
% A[[20]]=1400533128067650225717666332863259499625563517137726410
% B[[20]]=285883868831485440367091280985204927404877778809336382
% m[[20]]=572102847161797259565301603449253994021856928361376307476757098563650090604148693045095570993334380093995540
% Factor [P]=13^1
% Factor [P]=5^1
% Factor [P]=2^2
% End of depth 20 at 158.720000 s

% N_21=2200395566006912536789621551727899977007142032159139644141373456014038810015956511711906042282055308053829
% Pmax[350]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 158.740000s
% 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 158.770000s
%T% Ecpp sieve(4): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[21]]=4
% A[[21]]=57820468814012831208361031401239823677999402996072260
% B[[21]]=36940410291966911800038243327868873008348242199544673
% m[[21]]=2200395566006912536789621551727899977007142032159139586320904642001207601654925110472082364282652311981570
% Factor [P]=229^1
% Factor [P]=7^2
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 21 at 158.840000 s

% N_22=19609620942936570152300343567666874405196881135007036684082565208102732391541975853061958508890939417
% Pmax[334]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 158.860000s
% 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 158.890000s
%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 158.980000s
%T% Ecpp sieve(4): 0.030000
%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 159.080000s
%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 159.130000s
%T% Ecpp sieve(43): 0.020000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 159.180000s
%T% Ecpp sieve(163): 0.010000
% Extra square factor: 9
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 159.230000s
%T% Ecpp sieve(24): 0.020000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 159.280000s
%T% Ecpp sieve(148): 0.010000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[22]]=148
% A[[22]]=-211590070252163884753463738693091759386274915076550
% B[[22]]=-15082683363674237955267142879499716826175732369204
% m[[22]]=19609620942936570152300343567666874405196881135007248274152817371987485855280668944821344783806015968
% Factor [P]=19183^1
% Factor [P]=883^1
% Factor [P]=617^1
% Factor [P]=2^5
% End of depth 22 at 159.340000 s

% N_23=58634986033589218654885183191755933936503946106853039848399828715352569142366599442055523
% Pmax[295]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 159.360000s
% 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 159.380000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[23]]=3
% A[[23]]=-237488414044416608504355689484163515228335240
% B[[23]]=243679569194892098706411189843115259530385358
% m[[23]]=58634986033589218654885183191755933936503946344341453892816437219708258626530114670390764
% Factor [P]=19^1
% Factor [P]=2^2
% End of depth 23 at 159.470000 s

% N_24=771512974126173929669541884102051762322420346636071761747584700259319192454343614084089
% Pmax[289]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 159.480000s
% 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 159.510000s
%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 159.580000s
%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[[24]]=4
% A[[24]]=-53455517614414664424220839656043580901160184
% B[[24]]=-7559092754419991617680867874372249018490925
% m[[24]]=771512974126173929669541884102051762322420400091589376162249124480158848497924515244274
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 24 at 159.670000 s

% N_25=42861831895898551648307882450113986795690022227310520897902729137786602694329139735793
% Pmax[285]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 159.680000s
% 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 159.710000s
%T% Ecpp sieve(3): 0.010000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 159.770000s
%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 159.850000s
%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 159.890000s
%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 159.930000s
%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 159.960000s
%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 160.000000s
%T% Ecpp sieve(67): 0.010000
% 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 160.050000s
%T% Ecpp sieve(163): 0.010000
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 160.070000s
%T% Ecpp sieve(24): 0.010000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 160.100000s
%T% Ecpp sieve(52): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 160.150000s
%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 160.180000s
%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(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 160.230000s
%T% Ecpp sieve(403): 0.010000
% Extra square factor: 3
% 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 160.280000s
%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 160.310000s
%T% Ecpp sieve(84): 0.020000
% Testing if N is a norm in Q(sqrt(-168)) where (h, g)=(-4, 4)
% next D is D_32 = 168 at 160.350000s
%T% Ecpp sieve(168): 0.010000
% Testing if N is a norm in Q(sqrt(-228)) where (h, g)=(-4, 4)
% next D is D_34 = 228 at 160.380000s
%T% Ecpp sieve(228): 0.010000
% Testing if N is a norm in Q(sqrt(-312)) where (h, g)=(-4, 4)
% next D is D_36 = 312 at 160.410000s
%T% Ecpp sieve(312): 0.020000
% Testing if N is a norm in Q(sqrt(-372)) where (h, g)=(-4, 4)
% next D is D_38 = 372 at 160.450000s
%T% Ecpp sieve(372): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 20
% D[[25]]=372
% A[[25]]=-11402015456330271696756613307188638765977692
% B[[25]]=-333768685261649082188038467174414288839383
% m[[25]]=42861831895898551648307882450113986795690033629325977228174425894399909882967905713486
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 25 at 160.490000 s

% N_26=7143638649316425274717980408352331132615005604887662871362404315733318313827984285581
% Pmax[282]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 160.510000s
% 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 160.530000s
%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 160.610000s
%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 160.640000s
%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 160.680000s
%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 160.710000s
%T% Ecpp sieve(163): 0.010000
% No factor found, sieve only: no PRP test
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[26]]=163
% A[[26]]=-4927235399639778988252212515039745087047819
% B[[26]]=-162361898160397885757405625949323674068349
% m[[26]]=7143638649316425274717980408352331132615010532123062511141392567945833353573071333401
% Factor [P]=677^1
% End of depth 26 at 160.750000 s

% N_27=10551903470186743389539114340254551156004446871673652158259073217054406726104979813
% Pmax[273]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 160.770000s
% 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 160.790000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[27]]=3
% A[[27]]=-167752223308332940687305202918013245082282
% B[[27]]=68475799754020573284587227917215404172524
% m[[27]]=10551903470186743389539114340254551156004614623896960491199760522257324739350062096
% Factor [P]=43^1
% Factor [P]=19^1
% Factor [P]=7^1
% Factor [P]=2^4
% End of depth 27 at 160.830000 s

% N_28=115316308250860545872739053377497717651737788773135168858189374478244937263399
% Pmax[256]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 160.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 160.860000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[28]]=3
% A[[28]]=177520788762365538386706319196937853693
% B[[28]]=-378484523048006009511224918931899963143
% m[[28]]=115316308250860545872739053377497717651560267984372803319802668159047999409707
% Factor [P]=7^1
% End of depth 28 at 160.920000 s

% N_29=16473758321551506553248436196785388235937181140624686188543238308435428487101
% Pmax[254]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 160.940000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[29]]=-1
% Factor [P]=191^1
% Factor [P]=5^2
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 29 at 160.960000 s

% N_30=287500145227774983477285099420338363628921136834636757217159481822607827
% Pmax[238]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 160.970000s
% 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 160.990000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[30]]=3
% A[[30]]=241665576577547094142747854484462240
% B[[30]]=-603213154699768810015119966577405106
% m[[30]]=287500145227774983477285099420338363387255560257089663074411627338145588
% Factor [P]=859^1
% Factor [P]=31^1
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 30 at 161.040000 s

% N_31=385589482502662220400536873629097122078581836474050394943230027599
% Pmax[218]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 161.050000s
% 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 161.060000s
%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 161.110000s
%T% Ecpp sieve(7): 0.010000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 161.130000s
%T% Ecpp sieve(43): 0.010000
% Extra square factor: 7
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[31]]=43
% A[[31]]=535995153546251679499789475926057
% B[[31]]=170843810444237304860425715381823
% m[[31]]=385589482502662220400536873629096586083428290222370895153754101543
% Factor [P]=7^2
% Factor [P]=36523^1
% Factor [P]=20563^1
% Factor [P]=53^1
% Factor [P]=17^1
% End of depth 31 at 161.170000 s

% N_32=11629241503930559332085714506466556624172118081242843
% Pmax[173]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 161.180000s
% 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]=2^2
% End of depth 32 at 161.190000 s

% N_33=2907310375982639833021428626616639156043029520310711
% Pmax[171]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 161.200000s
% 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 161.210000s
%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 161.230000s
%T% Ecpp sieve(43): 0.010000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 161.250000s
%T% Ecpp sieve(88): 0.010000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 161.270000s
%T% Ecpp sieve(187): 0.010000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 161.280000s
%T% Ecpp sieve(403): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[33]]=403
% A[[33]]=92806253674584312447468319
% B[[33]]=2735775656686830906085669
% m[[33]]=2907310375982639833021428533810385481458717072842393
% Factor [P]=15913^1
% Factor [P]=5209^1
% End of depth 33 at 161.300000 s

% N_34=35073974189235459375692105119562103983831129
% Pmax[145]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 161.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 161.320000s
%T% Ecpp sieve(4): 0.010000
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[34]]=4
% A[[34]]=-8526151980275949669946
% B[[34]]=-4110980088925825101980
% m[[34]]=35073974189235459375700631271542379933501076
% Factor [P]=2^2
% End of depth 34 at 161.360000 s

% N_35=8768493547308864843925157817885594983375269
% Pmax[143]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 161.370000s
% 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]=23813^1
% Factor [P]=997^1
% Factor [P]=79^1
% Factor [P]=7^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 35 at 161.370000 s

% N_36=55655660234709707878283239521283
% Pmax[106]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 161.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 161.380000s
%T% Ecpp sieve(3): 0.000000
% No factor found, sieve only: no PRP test
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[36]]=3
% A[[36]]=-14917988024806507
% B[[36]]=-159451382944231
% m[[36]]=55655660234709722796271264327791
% Factor [P]=61^1
% Factor [P]=19^1
% Factor [P]=13^1
% Factor [P]=3^1
% End of depth 36 at 161.380000 s

% N_37=1231292675708717125644814591
% Pmax[90]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 161.380000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[37]]=-1
% Factor [P]=937^1
% Factor [P]=23^1
% Factor [P]=7^1
% Factor [P]=5^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 37 at 161.380000 s

% N_38=90688729923681744643
% Pmax[67]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 161.380000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[38]]=1
% Factor [P]=2423^1
% Factor [P]=641^1
% Factor [P]=71^1
% Factor [P]=2^2
% End of depth 38 at 161.380000 s

% N_39=205600201537
% Pmax[38]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 161.390000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[39]]=-1
% Factor [P]=89^1
% Factor [P]=3^1
% Factor [P]=2^6
% End of depth 39 at 161.390000 s

% N_40=12031847
% Pmax[24]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 161.390000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[40]]=-1
% Factor [P]=83^1
% Factor [P]=2^1
% End of depth 40 at 161.390000 s

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

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


% Time for building is 50.200000 s

% Starting phase 2: proving
% Starting proving job for step 0
% D=115 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.130000
% Suggested twist(115)=1
% Entering AEcModProveLarge
%T% ProveStep(115): 1.300000
% N_0 is prime
% Time for proof[0] is 1.300000 s

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

% Starting proving job for step 2
% D=59 h=3 g=1 invcode=11 (Stark's) g0=1
%T% Factor of degree 1 found: 1.880000
%T% one root in FindG2G3s: 1.890000s
% Using Stark's theorem
% E found
%T% find E: 1.890000
% Suggested twist(59)=-1
% Entering AEcModProveLarge
%T% ProveStep(59): 2.800000
% N_2 is prime
% Time for proof[2] is 2.800000 s

% Starting proving job for step 3
% 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.090000
% E found
%T% find E: 0.090000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(20): 1.710000
% N_3 is prime
% Time for proof[3] is 1.710000 s

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

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

% Starting proving job for step 6
% Entering FindEForD0mod3
% D=5907 h=16 g=4 invcode=10 (w3) g0=4
%T% one root in GetInvariant: 0.660000s
% u has been computed
%T% FindW: 0.790000
% E found
%T% find E: 0.790000
% Suggested twist(5907)=-1
% Entering AEcModProveLarge
%T% ProveStep(5907): 1.410000
% N_6 is prime
% Time for proof[6] is 1.410000 s

% Starting proving job for step 7
% D=67 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(67)=1
% Entering AEcModProveLarge
%T% ProveStep(67): 0.550000
% N_7 is prime
% Time for proof[7] is 0.550000 s

% Starting proving job for step 8
% D=376 h=8 g=2 invcode=3 (f1^2/sqrt(2)) g0=2
%T% Factor of degree 1 found: 2.000000
%T% one root in GetInvariant: 2.230000s
% u has been computed
%T% FindJ: 2.280000
% E found
%T% find E: 2.280000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(376): 3.330000
% N_8 is prime
% Time for proof[8] is 3.330000 s

% Starting proving job for step 9
% D=6392 h=32 g=4 invcode=3 (f1^2/sqrt(2)) g0=4
%T% Factor of degree 2 found: 9.680000
%T% one root in GetInvariant: 9.730000s
% u has been computed
%T% FindJ: 9.830000
% E found
%T% find E: 9.830000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(6392): 10.760000
% N_9 is prime
% Time for proof[9] is 10.760000 s

% Starting proving job for step 10
% 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.370000
% N_10 is prime
% Time for proof[10] is 0.370000 s

% Starting proving job for step 11
% 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.300000
% N_11 is prime
% Time for proof[11] is 0.300000 s

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

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

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

% Starting proving job for step 15
% D=1411 h=4 g=2 invcode=11 (Stark's) g0=2
%T% one root in FindG2G3s: 0.030000s
% Using Stark's theorem
% E found
%T% find E: 0.060000
% Suggested twist(1411)=1
% Entering AEcModProveLarge
%T% ProveStep(1411): 0.300000
% N_15 is prime
% Time for proof[15] is 0.300000 s

% Starting proving job for step 16
% 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.230000
% N_16 is prime
% Time for proof[16] is 0.230000 s

% Starting proving job for step 17
% 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.230000
% N_17 is prime
% Time for proof[17] is 0.230000 s

% Starting proving job for step 18
% D=155 h=4 g=2 invcode=11 (Stark's) g0=2
%T% one root in FindG2G3s: 0.020000s
% Using Stark's theorem
% E found
%T% find E: 0.040000
% Suggested twist(155)=1
% Entering AEcModProveLarge
%T% ProveStep(155): 0.240000
% N_18 is prime
% Time for proof[18] is 0.240000 s

% Starting proving job for step 19
% 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_19 is prime
% Time for proof[19] is 0.190000 s

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

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

% Starting proving job for step 22
% 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.030000
% Suggested twist(148)=1
% Entering AEcModProveLarge
%T% ProveStep(148): 0.150000
% N_22 is prime
% Time for proof[22] is 0.150000 s

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

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

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

% Starting proving job for step 26
% D=163 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(163)=-1
% Entering AEcModProveLarge
%T% ProveStep(163): 0.080000
% N_26 is prime
% Time for proof[26] is 0.080000 s

% Starting proving job for step 27
% 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.070000
% N_27 is prime
% Time for proof[27] is 0.070000 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.050000
% N_28 is prime
% Time for proof[28] is 0.050000 s

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

% Starting proving job for step 30
% 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_30 is prime
% Time for proof[30] is 0.050000 s

% Starting proving job for step 31
% 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.050000
% N_31 is prime
% Time for proof[31] is 0.050000 s

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

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

% Starting proving job for step 34
% E found
%T% find E: 0.000000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.020000
% N_34 is prime
% Time for proof[34] is 0.020000 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
% M = 0 mod 6: hopeless
% E found
%T% find E: 0.010000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.020000
% N_36 is prime
% Time for proof[36] is 0.020000 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
% b=1
% Nonresidue is 6
%T% ProveStep(-1): 0.000000
% N_42 is prime
% Time for proof[42] is 0.000000 s
% Time for proving  is 29.790000 s
% Total time is        79.990000 s
This number is prime
%T% PrintCertif: 0.070000
% Time for this number is 80.450000s

Working on 6912259818674729589319267504322426205617675500904744864717658087743408606942177839978339572853851299138526457276530980273121577091359882229397498458163672008303526911675883149847493982399
% Performing a quick factorization
% This number might be prime
% Entering ECPP: delay mode
% Starting phase 1: building the sequence of primes
% N_0=6912259818674729589319267504322426205617675500904744864717658087743408606942177839978339572853851299138526457276530980273121577091359882229397498458163672008303526911675883149847493982399
% Pmax[621]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 191.550000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 191.700000s
%T% Ecpp sieve(19): 0.050000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 191.850000s
%T% Ecpp sieve(67): 0.050000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 192.010000s
%T% Ecpp sieve(163): 0.040000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 192.150000s
%T% Ecpp sieve(235): 0.040000
% Extra square factor: 19
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-760)) where (h, g)=(-4, 4)
% next D is D_49 = 760 at 192.380000s
%T% Ecpp sieve(760): 0.040000
% Testing if N is a norm in Q(sqrt(-323)) where (h, g)=(4, 2)
% next D is D_79 = 323 at 192.580000s
%T% Ecpp sieve(323): 0.050000
% Testing if N is a norm in Q(sqrt(-955)) where (h, g)=(4, 2)
% next D is D_88 = 955 at 192.770000s
%T% Ecpp sieve(955): 0.050000
% Testing if N is a norm in Q(sqrt(-1027)) where (h, g)=(4, 2)
% next D is D_90 = 1027 at 192.980000s
%T% Ecpp sieve(1027): 0.040000
% No factor found, sieve only: no PRP test
% 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(-307)) where (h, g)=(3, 1)
% next D is D_236 = 307 at 193.240000s
%T% Ecpp sieve(307): 0.040000
% Testing if N is a norm in Q(sqrt(-331)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-499)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-643)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-152)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-247)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-515)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1315)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1432)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1963)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2515)) where (h, g)=(6, 2)
% next D is D_287 = 2515 at 193.940000s
%T% Ecpp sieve(2515): 0.040000
% Testing if N is a norm in Q(sqrt(-3235)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1235)) where (h, g)=(12, 4)
% next D is D_309 = 1235 at 194.200000s
%T% Ecpp sieve(1235): 0.050000
% Testing if N is a norm in Q(sqrt(-2680)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4120)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4888)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-5035)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-6715)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-10795)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-20995)) where (h, g)=(24, 8)
% Testing if N is a norm in Q(sqrt(-95)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-376)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-395)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-632)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1339)) where (h, g)=(8, 2)
% next D is D_587 = 1339 at 195.020000s
%T% Ecpp sieve(1339): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 13
% D[[0]]=1339
% A[[0]]=4266626407596512584680444399597202942733869078302707380584024400926801335976842687582924572364
% B[[0]]=83986459899064350011059297179003421001164675229396034853033447331921443455371169086263729570
% m[[0]]=6912259818674729589319267504322426205617675500904744864717658087743408606942177839978339572849584672730929944691850535873524374148626013151094791077579647607376725575699040462264569410036
% Factor [P]=1459^1
% Factor [P]=17^1
% Factor [P]=11^1
% Factor [P]=2^2
% End of depth 0 at 195.240000 s

% N_1=6333782770664407888084714371357594394389310952949922539353430567181580496990996177128811006045442333525389106790463888050129909274745002575838325163726205780987568930168858296342973
% Pmax[601]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 195.320000s
% 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 195.460000s
%T% Ecpp sieve(3): 0.070000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[1]]=3
% A[[1]]=-1060690194190623972181905442639812024721179430147623118405669945533214279152074942879997695
% B[[1]]=2840778496269727818066325630940530685781990051694324739377276209359723745230362128817547767
% m[[1]]=6333782770664407888084714371357594394389310952949922539353430567181580496990996177128811007106132527716013078972369330689941933995924432723461443569396151314201848082243801176340669
% Factor [P]=331^1
% Factor [P]=97^1
% Factor [P]=31^1
% Factor [P]=13^1
% Factor [P]=7^1
% End of depth 1 at 195.930000 s

% N_2=69929488262372336774927031324589695239391906948039013285517513319066380132788178657452973230850319604024471644362961978306408184207130262706644706936166146439621230643364427
% Pmax[575]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 195.970000s
% 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 196.090000s
%T% Ecpp sieve(3): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[2]]=3
% A[[2]]=383587009319770463566587998948916298078656173859655530740466770071294528328741123052760
% B[[2]]=-210221279711485340887493188650335712982412863030750312027220551217484273707456932252506
% m[[2]]=69929488262372336774927031324589695239391906948039013285517513319066380132788178657452589643840999833560905056364013062008329528033270607175904240166094851911292489520311668
% Factor [P]=2287^1
% Factor [P]=283^1
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 2 at 196.360000 s

% N_3=3858777332095458714749401745782004647528869414004479662473290384089734646433873142550589898076380171840227297960048370649743261025284066536331277446525488639191497711
% Pmax[551]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 196.390000s
% 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 196.510000s
%T% Ecpp sieve(3): 0.040000
% 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(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 196.780000s
%T% Ecpp sieve(7): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[3]]=7
% A[[3]]=94727671001609900941585460430164550564732882704289487295026122968215735092686898216
% B[[3]]=30382743398638523691679920728326496334292419345434647053767200409466803600371788122
% m[[3]]=3858777332095458714749401745782004647528869414004479662473290384089734646433873142455862227074770270898641837529883820085010378320994579241305154478309753546504599496
% Factor [P]=37^1
% Factor [P]=7^1
% Factor [P]=2^3
% End of depth 3 at 196.950000 s

% N_4=1862344272246843009048939066497106490120110721044633041734213505834814018549166574544335051677012679005136021973882152550680684517854526660861561041655286460668243
% Pmax[540]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 196.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 197.090000s
%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 197.370000s
%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(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 197.520000s
%T% Ecpp sieve(8): 0.050000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 197.670000s
%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 197.800000s
%T% Ecpp sieve(19): 0.030000
% 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 197.960000s
%T% Ecpp sieve(43): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-168)) where (h, g)=(-4, 4)
% next D is D_32 = 168 at 198.110000s
%T% Ecpp sieve(168): 0.020000
% Testing if N is a norm in Q(sqrt(-483)) where (h, g)=(-4, 4)
% next D is D_41 = 483 at 198.240000s
%T% Ecpp sieve(483): 0.030000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-627)) where (h, g)=(-4, 4)
% next D is D_46 = 627 at 198.340000s
%T% Ecpp sieve(627): 0.020000
% Testing if N is a norm in Q(sqrt(-219)) where (h, g)=(4, 2)
% next D is D_75 = 219 at 198.470000s
%T% Ecpp sieve(219): 0.020000
% Testing if N is a norm in Q(sqrt(-291)) where (h, g)=(4, 2)
% next D is D_77 = 291 at 198.600000s
%T% Ecpp sieve(291): 0.020000
% Testing if N is a norm in Q(sqrt(-1387)) where (h, g)=(4, 2)
% next D is D_93 = 1387 at 198.720000s
%T% Ecpp sieve(1387): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 13
% D[[4]]=1387
% A[[4]]=-57292182471916745010522279163594683776076755833077941128192769764306760422559305
% B[[4]]=-73269975609043319149330160613973945361660128898822869084266216423007019176383609
% m[[4]]=1862344272246843009048939066497106490120110721044633041734213505834814018549166574601627234148929424015658301137476836326757440350932467789054330805962046883227549
% Factor [P]=3^2
% Factor [P]=167^1
% Factor [P]=23^1
% End of depth 4 at 198.920000 s

% N_5=53873246904649917817956523662735586511617655154752322651341187359623188942380935942654610609185380659424869135279494238385762976971635505483361705746826546421
% Pmax[524]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 198.960000s
% 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 199.050000s
%T% Ecpp sieve(4): 0.040000
%T% Ecpp sieve(4): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[5]]=4
% A[[5]]=14674791411516604349440945161921107148256362596593137581377495179808689113887922
% B[[5]]=189396836746405436393008742902889432078584555241883268502602150429854534346370
% m[[5]]=53873246904649917817956523662735586511617655154752322651341187359623188942380921267863199092581031218479707214172345982023166383834054127988181897057712658500
% Factor [P]=173^1
% Factor [P]=17^1
% Factor [P]=5^3
% Factor [P]=2^2
% End of depth 5 at 199.310000 s

% N_6=36636006055525275632748400994719882020821254780518410507542459952140896934635104568421080647793968866698202797805063571590048543919791994551636788206537
% Pmax[504]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 199.350000s
% 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 199.440000s
%T% Ecpp sieve(4): 0.040000
%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 199.670000s
%T% Ecpp sieve(7): 0.030000
% Extra square factor: 19
% 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 199.800000s
%T% Ecpp sieve(8): 0.040000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 199.930000s
%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 200.040000s
%T% Ecpp sieve(67): 0.030000
% Extra square factor: 7
% 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 200.170000s
%T% Ecpp sieve(163): 0.030000
% 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 200.250000s
%T% Ecpp sieve(52): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[6]]=52
% A[[6]]=-9450695154293315308310606205249252216227145014072244851215969957795869261220
% B[[6]]=-1049069049963218503193810598484249458769509730444425609811168193180348122843
% m[[6]]=36636006055525275632748400994719882020821254780518410507542459952140896934644555263575373963102279472903452050021290716604120788771007964509432657467758
% Factor [P]=21647^1
% Factor [P]=2^1
% End of depth 6 at 200.410000 s

% N_7=846214395886849809043941446729798171128129874359458828187334502520924306708656055425125282096879001083370722271476202628634932987735204982432500057
% Pmax[489]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 200.450000s
% 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 200.530000s
%T% Ecpp sieve(3): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[7]]=3
% A[[7]]=-57692796138380429442969131397285263778859491702199696083945570208947199391
% B[[7]]=-4335852752830191324008451828597773935926205593825928565235932296496303857
% m[[7]]=846214395886849809043941446729798171128129874359458828187334502520924306766348851563505711539848132480655986050335694330834629071680775191379699449
% Factor [P]=139^1
% Factor [P]=31^1
% Factor [P]=19^1
% End of depth 7 at 200.690000 s

% N_8=10335947965541520306872292346860282287111796293674913317137136501580832123295780576315248519498334361137105764560536628730986907106066558260919
% Pmax[472]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 200.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 200.800000s
%T% Ecpp sieve(3): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[8]]=3
% A[[8]]=62108771336997354212932913160967935879313664785496995564677527577563837
% B[[8]]=-111782962901589878361031972039990595038102231724608411922799338540928537
% m[[8]]=10335947965541520306872292346860282287111796293674913317137136501580832061187009239317894306565421200169169885246871843233991342428538980697083
% Factor [P]=181^1
% Factor [P]=7^1
% Factor [P]=3^2
% End of depth 8 at 201.020000 s

% N_9=906423569722136306837875326393079214865543830016216198994750197455128655721039133501525414940403507863647275738566328442865153242878100561
% Pmax[459]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 201.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 201.130000s
%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(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 201.340000s
%T% Ecpp sieve(4): 0.040000
%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 201.540000s
%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 201.650000s
%T% Ecpp sieve(11): 0.020000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 201.750000s
%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 201.860000s
%T% Ecpp sieve(163): 0.030000
% Extra square factor: 5
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 7
% D[[9]]=163
% A[[9]]=1585132183187987608441542440673693956879939561062824158901577759586337
% B[[9]]=82634914437614300294011519163139184412800109875891773471387705168785
% m[[9]]=906423569722136306837875326393079214865543830016216198994750197455127070588855945513916973397962834169690395799005265618706251665118514225
% Factor [P]=5^2
% End of depth 9 at 202.000000 s

% N_10=36256942788885452273515013055723168594621753200648647959790007898205082823554237820556678935918513366787615831960210624748250066604740569
% Pmax[454]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 202.030000s
% 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 202.100000s
%T% Ecpp sieve(4): 0.040000
%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 202.300000s
%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 202.390000s
%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 202.500000s
%T% Ecpp sieve(11): 0.020000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 202.590000s
%T% Ecpp sieve(163): 0.020000
% 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(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 202.640000s
%T% Ecpp sieve(20): 0.030000
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 202.750000s
%T% Ecpp sieve(35): 0.030000
% Extra square factor: 31
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 202.860000s
%T% Ecpp sieve(40): 0.030000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 202.960000s
%T% Ecpp sieve(88): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 10
% D[[10]]=88
% A[[10]]=-246311292068818259154768696121622521258296353013079272951930655944382
% B[[10]]=-30961581500842429372375024150032034026418725016217482549110741074998
% m[[10]]=36256942788885452273515013055723168594621753200648647959790007898205329134846306638815833704614634989308874128313223704021201997260684952
% Factor [P]=53939^1
% Factor [P]=307^1
% Factor [P]=2^3
% End of depth 10 at 203.080000 s

% N_11=273690629329601700158538157560745334310734483940272075650528316507353078957982535214678761143489172119066414693395837063779928603
% Pmax[427]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 203.110000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[11]]=-1
% Factor [P]=569^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 11 at 203.180000 s

% N_12=80167143916110632735365599754172622820953275905176354906423056973448470696538528182389795296862674903065733653601592578728743
% Pmax[415]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 203.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]=263^1
% Factor [P]=163^1
% Factor [P]=61^1
% Factor [P]=13^1
% Factor [P]=3^1
% Factor [P]=2^3
% End of depth 12 at 203.270000 s

% N_13=98258160522620832985324529297071084773921692813971335582331644097406291586595765334952118879385279194491537384621043
% Pmax[386]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 203.300000s
% 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 203.340000s
%T% Ecpp sieve(3): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[13]]=3
% A[[13]]=-18371172856128660754460756128926450409279904029116005384893
% B[[13]]=-4302427608561041099426574958689000981538200496925508287329
% m[[13]]=98258160522620832985324529297071084773921692813971335582350015270262420247350226091081045329794559098520653390005937
% Factor [P]=4657^1
% Factor [P]=3^1
% End of depth 13 at 203.440000 s

% N_14=7033008411897561590818447448076092246361870504185193299144657882060154623674055263838024860768345794754896098347
% Pmax[372]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 203.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 203.490000s
%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 203.610000s
%T% Ecpp sieve(7): 0.010000
% Extra square factor: 9
% 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 203.680000s
%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 203.740000s
%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 203.800000s
%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 203.850000s
%T% Ecpp sieve(43): 0.010000
% 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 203.910000s
%T% Ecpp sieve(51): 0.020000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 203.970000s
%T% Ecpp sieve(91): 0.010000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 204.020000s
%T% Ecpp sieve(187): 0.020000
% Extra square factor: 27
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 204.090000s
%T% Ecpp sieve(232): 0.010000
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 204.160000s
%T% Ecpp sieve(403): 0.010000
% No factor found, sieve only: no PRP test
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-168)) where (h, g)=(-4, 4)
% next D is D_32 = 168 at 204.210000s
%T% Ecpp sieve(168): 0.020000
% Testing if N is a norm in Q(sqrt(-627)) where (h, g)=(-4, 4)
% next D is D_46 = 627 at 204.270000s
%T% Ecpp sieve(627): 0.010000
% Testing if N is a norm in Q(sqrt(-3003)) where (h, g)=(-8, 8)
% next D is D_64 = 3003 at 204.320000s
%T% Ecpp sieve(3003): 0.020000
% Testing if N is a norm in Q(sqrt(-39)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-136)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-203)) where (h, g)=(4, 2)
% next D is D_74 = 203 at 204.410000s
%T% Ecpp sieve(203): 0.010000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-323)) where (h, g)=(4, 2)
% next D is D_79 = 323 at 204.450000s
%T% Ecpp sieve(323): 0.010000
% 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)
% next D is D_89 = 1003 at 204.520000s
%T% Ecpp sieve(1003): 0.010000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1243)) where (h, g)=(4, 2)
% next D is D_92 = 1243 at 204.590000s
%T% Ecpp sieve(1243): 0.010000
% Testing if N is a norm in Q(sqrt(-1507)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-264)) where (h, g)=(8, 4)
% next D is D_98 = 264 at 204.650000s
%T% Ecpp sieve(264): 0.010000
% Testing if N is a norm in Q(sqrt(-456)) where (h, g)=(8, 4)
% next D is D_101 = 456 at 204.690000s
%T% Ecpp sieve(456): 0.020000
% Testing if N is a norm in Q(sqrt(-616)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-651)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-987)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1032)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1128)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1131)) where (h, g)=(8, 4)
% next D is D_116 = 1131 at 204.820000s
%T% Ecpp sieve(1131): 0.010000
% Testing if N is a norm in Q(sqrt(-1672)) where (h, g)=(8, 4)
% next D is D_123 = 1672 at 204.870000s
%T% Ecpp sieve(1672): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1768)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1947)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2451)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2632)) where (h, g)=(8, 4)
% next D is D_138 = 2632 at 204.980000s
%T% Ecpp sieve(2632): 0.010000
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-2667)) where (h, g)=(8, 4)
% next D is D_139 = 2667 at 205.040000s
%T% Ecpp sieve(2667): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 25
% D[[14]]=2667
% A[[14]]=109595861841397152768213001054721094541938594354661019339
% B[[14]]=2458564052635551882362822964783553304273971983014839451
% m[[14]]=7033008411897561590818447448076092246361870504185193299035062020218757470905842262783303766226407200400235079009
% Factor [P]=27259^1
% Factor [P]=2729^1
% Factor [P]=3^1
% End of depth 14 at 205.100000 s

% N_15=31514210155732042348373253464671804970539448850888075245659032615899317497059923357798304601268611908873
% Pmax[344]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 205.120000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[15]]=-1
% Factor [P]=2^3
% End of depth 15 at 205.160000 s

% N_16=3939276269466505293546656683083975621317431106361009405707379076987414687132490419724788075158576488609
% Pmax[341]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 205.180000s
% 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 205.210000s
%T% Ecpp sieve(4): 0.030000
%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 205.310000s
%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 205.360000s
%T% Ecpp sieve(19): 0.020000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 205.410000s
%T% Ecpp sieve(20): 0.010000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 205.450000s
%T% Ecpp sieve(40): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[16]]=40
% A[[16]]=-1635554708305885698998717518242753202964471857827586
% B[[16]]=-571884294984668868198881302588135764694952877779276
% m[[16]]=3939276269466505293546656683083975621317431106361011041262087382873113685850008662477991039630434316196
% Factor [P]=43543^1
% Factor [P]=1409^1
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 16 at 205.510000 s

% N_17=2293132068925908452183225581624105154912445361918641264140863923244204789555784247682904553161
% Pmax[311]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 205.530000s
% 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 205.550000s
%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 205.640000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[17]]=8
% A[[17]]=64461022703592657370496815912037928820859786238
% B[[17]]=25043224701779485945326430585710785220032357450
% m[[17]]=2293132068925908452183225581624105154912445361854180241437271265873707973643746318862044766924
% Factor [P]=433^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 17 at 205.690000 s

% N_18=441326418192053204808165046501944795017791640079711362863216178959528093464924233807167969
% Pmax[298]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 205.710000s
% 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 205.730000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[18]]=3
% A[[18]]=1169788596912115782063787683891549936927600098
% B[[18]]=363730812232799583875798463194503551484217632
% m[[18]]=441326418192053204808165046501944795017791638909922765951100396895740409573374296879567872
% Factor [P]=3^1
% Factor [P]=2^10
% End of depth 18 at 205.780000 s

% N_19=143660943421892319273491226074851821294854049124323817041373827114498831241332778932151
% Pmax[287]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 205.790000s
% 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 205.810000s
%T% Ecpp sieve(3): 0.020000
% Extra square factor: 25
% 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 205.900000s
%T% Ecpp sieve(7): 0.010000
% 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 205.950000s
%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 205.980000s
%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 206.010000s
%T% Ecpp sieve(67): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 206.060000s
%T% Ecpp sieve(163): 0.010000
% 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 206.100000s
%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 206.140000s
%T% Ecpp sieve(24): 0.010000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 206.170000s
%T% Ecpp sieve(35): 0.020000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 206.210000s
%T% Ecpp sieve(88): 0.010000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 206.240000s
%T% Ecpp sieve(91): 0.020000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 206.280000s
%T% Ecpp sieve(235): 0.010000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-120)) where (h, g)=(-4, 4)
% next D is D_30 = 120 at 206.330000s
%T% Ecpp sieve(120): 0.010000
% Testing if N is a norm in Q(sqrt(-195)) where (h, g)=(-4, 4)
% next D is D_33 = 195 at 206.360000s
%T% Ecpp sieve(195): 0.010000
% Testing if N is a norm in Q(sqrt(-280)) where (h, g)=(-4, 4)
% next D is D_35 = 280 at 206.390000s
%T% Ecpp sieve(280): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 16
% D[[19]]=280
% A[[19]]=-23895347449590206873021660092202327220138722
% B[[19]]=-114270105310245277912632314771046529218363
% m[[19]]=143660943421892319273491226074851821294854073019671266631580700136158923443659999070874
% Factor [P]=1747^1
% Factor [P]=17^1
% Factor [P]=2^1
% End of depth 19 at 206.450000 s

% N_20=2418615835918588492432257417334789408647666133871027082251602749859573107573655663
% Pmax[271]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 206.470000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[20]]=-1
% Factor [P]=59^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 20 at 206.490000 s

% N_21=6832248124063809300656094399250817538552729191726065204100572739716308213484903
% Pmax[262]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 206.510000s
% 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 206.530000s
%T% Ecpp sieve(3): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 206.580000s
%T% Ecpp sieve(7): 0.010000
% Extra square factor: 9
% 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 206.620000s
%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 206.650000s
%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(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 206.700000s
%T% Ecpp sieve(43): 0.010000
% 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 206.740000s
%T% Ecpp sieve(163): 0.020000
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 206.770000s
%T% Ecpp sieve(24): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[21]]=24
% A[[21]]=1107127328737776129448968425165706333634
% B[[21]]=1042897837242803179829971081792416293337
% m[[21]]=6832248124063809300656094399250817538551622064397327427971123771291142507151270
% Factor [P]=271^1
% Factor [P]=31^1
% Factor [P]=7^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 21 at 206.810000 s

% N_22=11618086493213068683415400206184327611596616158616027731343417911628109761
% Pmax[243]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 206.820000s
% 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 206.840000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[22]]=3
% A[[22]]=6522820527285173263637694296615270146
% B[[22]]=1143847067528325508676855226145620976
% m[[22]]=11618086493213068683415400206184327605073795631330854467705723615012839616
% Factor [P]=601^1
% Factor [P]=2^6
% End of depth 22 at 206.870000 s

% N_23=302050917564815637567996053613361262611111575273784693939936658044219
% Pmax[228]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 206.890000s
% 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 206.900000s
%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 206.940000s
%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 206.970000s
%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 207.000000s
%T% Ecpp sieve(19): 0.010000
% Extra square factor: 9
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[23]]=19
% A[[23]]=21716471149024544756274650958958385
% B[[23]]=6226423113984494925607881282700173
% m[[23]]=302050917564815637567996053613361240894640426249239937665285699085835
% Factor [P]=3^4
% Factor [P]=7^1
% Factor [P]=5^1
% End of depth 23 at 207.040000 s

% N_24=106543533532562835120986262297481919186822019841001741680876789801
% Pmax[217]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 207.050000s
% 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]=47^1
% Factor [P]=19^1
% Factor [P]=5^2
% Factor [P]=3^1
% Factor [P]=2^3
% End of depth 24 at 207.060000 s

% N_25=198849446682648068534875442884438072390485292723034232327131
% Pmax[197]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 207.070000s
% 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]=7187^1
% Factor [P]=4363^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 25 at 207.080000 s

% N_26=634149316963788804552581115718869081368409353988473
% Pmax[169]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 207.090000s
% 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]=239^1
% Factor [P]=7^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 26 at 207.100000 s

% N_27=21058289067005007788821847503449195768360541741
% Pmax[154]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 207.110000s
% 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 207.120000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[27]]=3
% A[[27]]=290206521328626034887646
% B[[27]]=2108020110415889569404
% m[[27]]=21058289067005007788821557296927867142325654096
% Factor [P]=21157^1
% Factor [P]=349^1
% Factor [P]=37^2
% Factor [P]=2^4
% End of depth 27 at 207.130000 s

% N_28=130202744640079919958944759709940093
% Pmax[117]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 207.130000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[28]]=-1
% Factor [P]=19^1
% Factor [P]=13^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 28 at 207.130000 s

% N_29=43928051498002672050926032290803
% Pmax[106]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 207.130000s
% 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 207.140000s
%T% Ecpp sieve(8): 0.000000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 207.140000s
%T% Ecpp sieve(67): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[29]]=67
% A[[29]]=-13052413944968437
% B[[29]]=-282491479232327
% m[[29]]=43928051498002685103339977259241
% Factor [P]=73^1
% End of depth 29 at 207.150000 s

% N_30=601754130109625823333424346017
% Pmax[99]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 207.150000s
% 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]=2^1
% End of depth 30 at 207.160000 s

% N_31=300877065054812911666712173009
% Pmax[98]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 207.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 207.160000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[31]]=3
% A[[31]]=637068905539106
% B[[31]]=-515639237521240
% m[[31]]=300877065054812274597806633904
% Factor [P]=103^1
% Factor [P]=3^1
% Factor [P]=2^4
% End of depth 31 at 207.170000 s

% N_32=60857011540212838713148591
% Pmax[86]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 207.170000s
% 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 207.170000s
%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[[32]]=3
% A[[32]]=-4124130216361
% B[[32]]=8687531220459
% m[[32]]=60857011540216962843364953
% Factor [P]=19^1
% Factor [P]=3^3
% End of depth 32 at 207.190000 s

% N_33=118629652125179264801881
% Pmax[77]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 207.190000s
% 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 207.190000s
%T% Ecpp sieve(3): 0.000000
% 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 207.200000s
%T% Ecpp sieve(4): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[33]]=4
% A[[33]]=462890968968
% B[[33]]=255073792925
% m[[33]]=118629652124716373832914
% Factor [P]=569^1
% Factor [P]=101^1
% Factor [P]=2^1
% End of depth 33 at 207.210000 s

% N_34=1032118638959407453
% Pmax[60]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 207.210000s
% 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]=733^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 34 at 207.210000 s

% N_35=117339545129537
% Pmax[47]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 207.210000s
% 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]=1117^1
% Factor [P]=263^1
% Factor [P]=83^1
% Factor [P]=2^6
% End of depth 35 at 207.210000 s

% N_36=75193
% Pmax[17]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 207.210000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[36]]=-1
% Factor [P]=241^1
% Factor [P]=13^1
% Factor [P]=3^1
% Factor [P]=2^3
% Cofactor is 1
% End of depth 36 at 207.210000 s

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


% Time for building is 15.740000 s

% Starting phase 2: proving
% Starting proving job for step 0
% D=1339 h=8 g=2 invcode=11 (Stark's) g0=2
%T% Factor of degree 1 found: 1.260000
%T% one root in FindG2G3s: 1.530000s
% Using Stark's theorem
% E found
%T% find E: 1.600000
% Suggested twist(1339)=1
% Entering AEcModProveLarge
%T% ProveStep(1339): 2.220000
% N_0 is prime
% Time for proof[0] is 2.220000 s

% Starting proving job for step 1
% 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.500000
% N_1 is prime
% Time for proof[1] is 0.500000 s

% Starting proving job for step 2
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.440000
% N_2 is prime
% Time for proof[2] is 0.440000 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.460000
% N_3 is prime
% Time for proof[3] is 0.460000 s

% Starting proving job for step 4
% D=1387 h=4 g=2 invcode=11 (Stark's) g0=2
%T% one root in FindG2G3s: 0.040000s
% Using Stark's theorem
% E found
%T% find E: 0.080000
% Suggested twist(1387)=1
% Entering AEcModProveLarge
%T% ProveStep(1387): 0.490000
% N_4 is prime
% Time for proof[4] is 0.490000 s

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

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

% Starting proving job for step 7
% 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.300000
% N_7 is prime
% Time for proof[7] is 0.300000 s

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

% Starting proving job for step 9
% D=163 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(163)=-1
% Entering AEcModProveLarge
%T% ProveStep(163): 0.280000
% N_9 is prime
% Time for proof[9] is 0.280000 s

% Starting proving job for step 10
% 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
% Using the 8 | D theorem
% E found
%T% find E: 0.070000
% Suggested twist(88)=-1
% Entering AEcModProveLarge
%T% ProveStep(88): 0.340000
% N_10 is prime
% Time for proof[10] is 0.340000 s

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

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

% Starting proving job for step 13
% 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.160000
% N_13 is prime
% Time for proof[13] is 0.160000 s

% Starting proving job for step 14
% Entering FindEForD0mod3
% D=2667 h=8 g=4 invcode=10 (w3) g0=4
%T% one root in GetInvariant: 0.020000s
% u has been computed
%T% FindW: 0.050000
% E found
%T% find E: 0.050000
% Suggested twist(2667)=-1
% Entering AEcModProveLarge
%T% ProveStep(2667): 0.210000
% N_14 is prime
% Time for proof[14] is 0.210000 s

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

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

% Starting proving job for step 17
% 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.100000
% N_17 is prime
% Time for proof[17] is 0.100000 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.080000
% N_18 is prime
% Time for proof[18] is 0.080000 s

% Starting proving job for step 19
% D=280 h=-4 g=4 invcode=3 (f1^2/sqrt(2)) g0=4
%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(280): 0.170000
% N_19 is prime
% Time for proof[19] is 0.170000 s

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

% Starting proving job for step 21
% 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.010000
% E found
%T% find E: 0.010000
% Suggested twist(24)=-1
% Entering AEcModProveLarge
%T% ProveStep(24): 0.080000
% N_21 is prime
% Time for proof[21] is 0.080000 s

% Starting proving job for step 22
% 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.060000
% N_22 is prime
% Time for proof[22] is 0.060000 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
%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.010000
% N_25 is prime
% Time for proof[25] is 0.010000 s

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

% Starting proving job for step 27
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 0.020000
% N_27 is prime
% Time for proof[27] is 0.020000 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
% D=67 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(67)=-1
% Entering AEcModProveLarge
%T% ProveStep(67): 0.020000
% N_29 is prime
% Time for proof[29] is 0.020000 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
% 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_31 is prime
% Time for proof[31] is 0.010000 s

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

% Starting proving job for step 33
% E found
%T% find E: 0.000000
% Suggested twist(4)=1
% Entering AEcModProveLarge
%T% ProveStep(4): 0.010000
% N_33 is prime
% Time for proof[33] is 0.010000 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
% Using complete factorization theorem
%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
% Using complete factorization theorem
%T% ProveStep(-1): 0.000000
% N_37 is prime
% Time for proof[37] is 0.000000 s
% Time for proving  is 7.400000 s
% Total time is        23.140000 s
This number is prime
%T% PrintCertif: 0.040000
% Time for this number is 23.400000s

Working on 122108656298781931801396836140388905046089571585121670668659565964780581985524813504996029149785583163900402878377728348941631639107590231241517357288300034766652405151082653023030715026307537499820002763188766432314217049807
% Performing a quick factorization
% This number might be prime
% Entering ECPP: delay mode
% Starting phase 1: building the sequence of primes
% N_0=122108656298781931801396836140388905046089571585121670668659565964780581985524813504996029149785583163900402878377728348941631639107590231241517357288300034766652405151082653023030715026307537499820002763188766432314217049807
% Pmax[745]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.240000
% next D is D_1 = 0 at 215.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 215.460000s
%T% Ecpp sieve(3): 0.180000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 216.160000s
%T% Ecpp sieve(7): 0.130000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[0]]=7
% A[[0]]=5300669335196817784515847976119964735253896748115559532524204397157530617484743172375277893147106021380437163040
% B[[0]]=8109408378931860446754585973946411595189831014346957065075317376692362481360135651904596543180961827485879524202
% m[[0]]=122108656298781931801396836140388905046089571585121670668659565964780581985524813504996029149785583163900402878372427679606434821323074383265397392553046138018536845618558448625873184408822794327444724870041660410933779886768
% Factor [P]=5119^1
% Factor [P]=43^1
% Factor [P]=7^2
% Factor [P]=2^4
% End of depth 0 at 216.590000 s

% N_1=707582045529392461095347183058796890798297920416730547362077558641474471331276311407138654541290698346025734171082923151852746246610420353821788193214627473733918024037856586948432158069500204155368513607522435024431
% Pmax[718]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.220000
% next D is D_1 = 0 at 216.810000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 217.050000s
%T% Ecpp sieve(3): 0.190000
% 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(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 217.770000s
%T% Ecpp sieve(7): 0.130000
% Extra square factor: 3
% 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 218.220000s
%T% Ecpp sieve(19): 0.130000
% 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 218.670000s
%T% Ecpp sieve(67): 0.120000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[1]]=67
% A[[1]]=-358310586466070080664630093210770260108791117631839203407571872093892850275714898205314046878913810356703981
% B[[1]]=-200817051430976607423799692425724877847945035019450787485426961866857678006197772124988073266568859379014983
% m[[1]]=707582045529392461095347183058796890798297920416730547362077558641474471331276311407138654541290698346025734529393509617922826911240513564592048302005745105573121431609728680841282433784398409469415392521332791728413
% Factor [P]=1609^1
% Factor [P]=29^1
% Factor [P]=17^1
% End of depth 1 at 219.140000 s

% N_2=892018457950640806083613324969456657718056419981330355697071062798979966052108400650926084563996256284093826346216212327366003995326130229164862836713044280048864880999913872955097195143946146573363815002745449
% Pmax[698]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.160000
% next D is D_1 = 0 at 219.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 219.510000s
%T% Ecpp sieve(4): 0.150000
%T% Ecpp sieve(4): 0.150000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 220.170000s
%T% Ecpp sieve(8): 0.140000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 220.520000s
%T% Ecpp sieve(11): 0.090000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[2]]=11
% A[[2]]=560825437304021962574191321510802558413174971335654777973549654929415864777002682203137355317777052951589
% B[[2]]=543853979456327275730928783684887091357075029717974086748521379557988672554468536467035858857328349135775
% m[[2]]=892018457950640806083613324969456657718056419981330355697071062798979966052108400650926084563996256284093265520778908305403429804004619426606449661741708625270891331344984457090320192461743009218046037949793861
% Factor [P]=82811^1
% Factor [P]=103^1
% Factor [P]=67^1
% Factor [P]=47^1
% Factor [P]=31^1
% Factor [P]=3^2
% End of depth 2 at 220.830000 s

% N_3=119034190636965202439064431739323715802313400421884880458133368172475265772343112868155456548323958192485019214991736003422326616870838761582520125064669737059970672065347091001886422457547785919227
% Pmax[655]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 220.980000s
% 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 221.160000s
%T% Ecpp sieve(7): 0.090000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 221.430000s
%T% Ecpp sieve(8): 0.150000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 221.750000s
%T% Ecpp sieve(11): 0.080000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[3]]=11
% A[[3]]=425026567901452009476678835325334604510289490155196527528544804683028460374326687611098466506828027
% B[[3]]=163898299709904144330434232537868450072065222740393508998344058356987336708471917141680729437476517
% m[[3]]=119034190636965202439064431739323715802313400421884880458133368172475265772343112868155456548323957767458451313539726526743491291536234251293029969868142208515165989036886716675198811359081279091201
% Factor [P]=1061^1
% Factor [P]=3^2
% End of depth 3 at 222.060000 s

% N_4=12465618456065054187775100192619511551190009469251741591594236901505421067372825727108121955003032544502927145621502411429834672901480181306213212888065997331151533043971799840318233465188111749
% Pmax[642]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 222.210000s
% 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 222.380000s
%T% Ecpp sieve(3): 0.130000
% 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(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 222.900000s
%T% Ecpp sieve(4): 0.140000
%T% Ecpp sieve(4): 0.150000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 223.490000s
%T% Ecpp sieve(11): 0.080000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 223.750000s
%T% Ecpp sieve(19): 0.090000
% 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 224.060000s
%T% Ecpp sieve(163): 0.090000
% 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 224.370000s
%T% Ecpp sieve(15): 0.080000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 224.630000s
%T% Ecpp sieve(20): 0.080000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 224.890000s
%T% Ecpp sieve(51): 0.080000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 225.140000s
%T% Ecpp sieve(115): 0.080000
% Extra square factor: 3
% Factorization completed using trial division only
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 225.500000s
%T% Ecpp sieve(123): 0.080000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 225.740000s
%T% Ecpp sieve(187): 0.090000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-132)) where (h, g)=(-4, 4)
% next D is D_31 = 132 at 226.050000s
%T% Ecpp sieve(132): 0.080000
% Cofactor after sieve is a probable prime
% Number of D tried was 13
% D[[4]]=132
% A[[4]]=-5716536958171726860351947849335176892476699777092111078692163904295543368806843622535777131543692
% B[[4]]=-360803806232410926239190814403543534972713466221621621752752450220081914828115555948419891177249
% m[[4]]=12465618456065054187775100192619511551190009469251741591594236901505421067372825727108121955003038261039885317348362763377684008078372658005990304999144689495055828587340606683940769242319655442
% Factor [P]=2^1
% End of depth 4 at 226.400000 s

% N_5=6232809228032527093887550096309755775595004734625870795797118450752710533686412863554060977501519130519942658674181381688842004039186329002995152499572344747527914293670303341970384621159827721
% Pmax[641]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.140000
% next D is D_1 = 0 at 226.540000s
% 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 226.710000s
%T% Ecpp sieve(4): 0.150000
%T% Ecpp sieve(4): 0.140000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 227.290000s
%T% Ecpp sieve(7): 0.090000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 227.550000s
%T% Ecpp sieve(8): 0.140000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 227.860000s
%T% Ecpp sieve(19): 0.090000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 228.060000s
%T% Ecpp sieve(43): 0.090000
% Extra square factor: 7
% 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 228.380000s
%T% Ecpp sieve(163): 0.080000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 228.620000s
%T% Ecpp sieve(20): 0.090000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 228.880000s
%T% Ecpp sieve(35): 0.090000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 229.140000s
%T% Ecpp sieve(40): 0.090000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 229.400000s
%T% Ecpp sieve(115): 0.080000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 229.660000s
%T% Ecpp sieve(427): 0.080000
% Extra square factor: 23
% Factorization completed using trial division only
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-280)) where (h, g)=(-4, 4)
% next D is D_35 = 280 at 229.920000s
%T% Ecpp sieve(280): 0.080000
% Testing if N is a norm in Q(sqrt(-340)) where (h, g)=(-4, 4)
% next D is D_37 = 340 at 230.170000s
%T% Ecpp sieve(340): 0.080000
% Extra square factor: 7
% Factorization completed using trial division only
% Extra square factor: 23
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-532)) where (h, g)=(-4, 4)
% next D is D_43 = 532 at 230.540000s
%T% Ecpp sieve(532): 0.080000
% Extra square factor: 5
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 15
% D[[5]]=532
% A[[5]]=3101455347585293110450655492253398611359256694159259221853611684556534871306132925192939793104122
% B[[5]]=169653625675989692605300504163066882680321441384206755051532058242391816645049989715478371561600
% m[[5]]=6232809228032527093887550096309755775595004734625870795797118450752710533686412863554060977501516029064595073381070931033349750640574969746300993240350491135843357758798997209045191681366723600
% Factor [P]=5^2
% Factor [P]=15443^1
% Factor [P]=7^1
% Factor [P]=2^4
% End of depth 5 at 230.870000 s

% N_6=144143190813048146961812335138198438857989397291095151659029945392565992305492383593908959618817495422442786685161814669460730026562542662563274003948864745373385948298327425487395853909
% Pmax[616]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 230.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 231.100000s
%T% Ecpp sieve(3): 0.070000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 231.520000s
%T% Ecpp sieve(4): 0.090000
%T% Ecpp sieve(4): 0.080000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 231.940000s
%T% Ecpp sieve(11): 0.050000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 232.140000s
%T% Ecpp sieve(43): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[6]]=43
% A[[6]]=-681073570910649072178839826978523739928827793978637872217284040375151075752149959119553790977
% B[[6]]=-51197645807797546780516700119070273102662487621035432794487968864719750891668324598055674507
% m[[6]]=144143190813048146961812335138198438857989397291095151659029945392565992305492383593908959619498568993353435757340654496439253766491370456541911876166148785748537024050477384606949644887
% Factor [P]=125131^1
% Factor [P]=23^1
% Factor [P]=13^1
% Factor [P]=11^1
% End of depth 6 at 232.410000 s

% N_7=350239676245377293879838399137450838375719484754304400897934842406328109899396143923950210655362262728358912167353337318031605927134596950403060295555526973432145997101398050093
% Pmax[587]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 232.490000s
% 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 232.620000s
%T% Ecpp sieve(4): 0.080000
%T% Ecpp sieve(4): 0.080000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 233.000000s
%T% Ecpp sieve(7): 0.050000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 233.180000s
%T% Ecpp sieve(19): 0.050000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 233.360000s
%T% Ecpp sieve(43): 0.050000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 233.550000s
%T% Ecpp sieve(67): 0.040000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 233.730000s
%T% Ecpp sieve(52): 0.040000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 233.910000s
%T% Ecpp sieve(91): 0.050000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 234.090000s
%T% Ecpp sieve(148): 0.050000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 234.280000s
%T% Ecpp sieve(427): 0.050000
% Testing if N is a norm in Q(sqrt(-532)) where (h, g)=(-4, 4)
% next D is D_43 = 532 at 234.470000s
%T% Ecpp sieve(532): 0.050000
% Testing if N is a norm in Q(sqrt(-68)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-259)) where (h, g)=(4, 2)
% next D is D_76 = 259 at 234.690000s
%T% Ecpp sieve(259): 0.050000
% Testing if N is a norm in Q(sqrt(-292)) where (h, g)=(4, 2)
% next D is D_78 = 292 at 234.860000s
%T% Ecpp sieve(292): 0.050000
% Testing if N is a norm in Q(sqrt(-323)) where (h, g)=(4, 2)
% next D is D_79 = 323 at 235.040000s
%T% Ecpp sieve(323): 0.050000
% Testing if N is a norm in Q(sqrt(-388)) where (h, g)=(4, 2)
% next D is D_82 = 388 at 235.210000s
%T% Ecpp sieve(388): 0.040000
% Testing if N is a norm in Q(sqrt(-763)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1003)) where (h, g)=(4, 2)
% next D is D_89 = 1003 at 235.430000s
%T% Ecpp sieve(1003): 0.040000
% Testing if N is a norm in Q(sqrt(-1387)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1204)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-3172)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-5083)) where (h, g)=(8, 4)
% next D is D_150 = 5083 at 235.750000s
%T% Ecpp sieve(5083): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 17
% D[[7]]=5083
% A[[7]]=36862491960626286573895486736845151945838312671792685347991741327427507985985984161495105
% B[[7]]=91024932574763953456868882440806565331875047593230308978646264590683305215461866836797
% m[[7]]=350239676245377293879838399137450838375719484754304400897934842406328109899396143923950173792870302102072338271866600472879660088821925157717712303814199545924160011117236554989
% Factor [P]=30271^1
% Factor [P]=193^1
% End of depth 7 at 235.950000 s

% N_8=59948906492076377051967075164956497185394096258667926141101350341864862178390292993011518538643117637355053011092817416843950080785252863077747303386044774795857046633363
% Pmax[564]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 235.990000s
% 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]=33751^1
% Factor [P]=47^2
% Factor [P]=7^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 8 at 236.120000 s

% N_9=19144746249967879528285425232442327611549976926173803843321213501706135917123447724685215985486475057759428666221166017008573730947276944364174164544246740701379
% Pmax[533]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 236.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 236.250000s
%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 236.510000s
%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(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 236.650000s
%T% Ecpp sieve(8): 0.040000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 236.790000s
%T% Ecpp sieve(19): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[9]]=19
% A[[9]]=186585379778139284732321465032288168851674650927381672337905304408380743111908371
% B[[9]]=46884449814028536976702919938377881633252828158568068914082360543242907712999175
% m[[9]]=19144746249967879528285425232442327611549976926173803843321213501706135917123447538099836207347190325437963633932997165333922803565604606458869756163503628793009
% Factor [P]=79633^1
% Factor [P]=131^1
% Factor [P]=61^1
% Factor [P]=23^1
% Factor [P]=7^1
% End of depth 9 at 236.930000 s

% N_10=186865673556732025295615503389813537963892394792679655823446960380849552093957914291116855330646504768034354463380187871619927261361601301573874310023
% Pmax[496]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 236.960000s
% 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]=7873^1
% Factor [P]=2^3
% End of depth 10 at 237.090000 s

% N_11=2966875294626127672037588965289812300963616073807310679274846951302704688396385023039452167703647033659887502593995107830876528346272089762064561
% Pmax[480]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 237.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 237.200000s
%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(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 237.440000s
%T% Ecpp sieve(4): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[11]]=4
% A[[11]]=-542494180792093683448722792509485456226779017146730756858775319917964688
% B[[11]]=-1700970402616637672939839497300211912317859390169682366278062984902442265
% m[[11]]=2966875294626127672037588965289812300963616073807310679274846951302704688938879203831545851152369826169372958820774124977607285205047409680029250
% Factor [P]=137^1
% Factor [P]=5^3
% Factor [P]=2^1
% End of depth 11 at 237.600000 s

% N_12=86624096193463581665331064679994519736163972957877684066418889089130063910624210330848054048244374486697020695497054743871745553432041158541
% Pmax[465]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 237.630000s
% 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 237.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(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 237.930000s
%T% Ecpp sieve(4): 0.040000
%T% Ecpp sieve(4): 0.040000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 238.130000s
%T% Ecpp sieve(19): 0.030000
% 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 238.250000s
%T% Ecpp sieve(163): 0.030000
% No factor found, sieve only: no PRP test
% 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 238.350000s
%T% Ecpp sieve(15): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[12]]=15
% A[[12]]=-18353742988839114804570714251321187695881383732021011434083936729061202
% B[[12]]=-801519518310621619994011762457456481520038425204835100364206826847068
% m[[12]]=86624096193463581665331064679994519736163972957877684066418889089130082264367199169962858618958625807884716576880786764883179637368770219744
% Factor [P]=2^5
% End of depth 12 at 238.490000 s

% N_13=2707003006045736927041595771249828741755124154933677627075590284035315070761474974061339331842457056496397393027524586402599363667774069367
% Pmax[460]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 238.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 238.600000s
%T% Ecpp sieve(7): 0.020000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 238.690000s
%T% Ecpp sieve(91): 0.030000
% Testing if N is a norm in Q(sqrt(-56)) where (h, g)=(4, 2)
% next D is D_69 = 56 at 238.790000s
%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(-259)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-568)) where (h, g)=(4, 2)
% next D is D_83 = 568 at 238.940000s
%T% Ecpp sieve(568): 0.020000
% Testing if N is a norm in Q(sqrt(-763)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1411)) where (h, g)=(4, 2)
% next D is D_94 = 1411 at 239.060000s
%T% Ecpp sieve(1411): 0.020000
% Testing if N is a norm in Q(sqrt(-952)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2392)) where (h, g)=(8, 4)
% next D is D_136 = 2392 at 239.170000s
%T% Ecpp sieve(2392): 0.020000
% Testing if N is a norm in Q(sqrt(-2968)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-5083)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-6307)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-23)) where (h, g)=(3, 1)
% next D is D_228 = 23 at 239.340000s
%T% Ecpp sieve(23): 0.020000
% 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(-283)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-331)) where (h, g)=(3, 1)
% next D is D_237 = 331 at 239.550000s
%T% Ecpp sieve(331): 0.020000
% Testing if N is a norm in Q(sqrt(-379)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-643)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% next D is D_242 = 883 at 239.690000s
%T% Ecpp sieve(883): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-707)) where (h, g)=(6, 2)
% next D is D_259 = 707 at 239.780000s
%T% Ecpp sieve(707): 0.030000
% Testing if N is a norm in Q(sqrt(-856)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1048)) where (h, g)=(6, 2)
% next D is D_265 = 1048 at 239.900000s
%T% Ecpp sieve(1048): 0.020000
% Testing if N is a norm in Q(sqrt(-1219)) where (h, g)=(6, 2)
% next D is D_272 = 1219 at 239.990000s
%T% Ecpp sieve(1219): 0.030000
% Testing if N is a norm in Q(sqrt(-1267)) where (h, g)=(6, 2)
% next D is D_273 = 1267 at 240.080000s
%T% Ecpp sieve(1267): 0.020000
% Testing if N is a norm in Q(sqrt(-1603)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2227)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2443)) where (h, g)=(6, 2)
% next D is D_286 = 2443 at 240.210000s
%T% Ecpp sieve(2443): 0.020000
% Testing if N is a norm in Q(sqrt(-3763)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-728)) where (h, g)=(12, 4)
% next D is D_301 = 728 at 240.330000s
%T% Ecpp sieve(728): 0.020000
% Testing if N is a norm in Q(sqrt(-1547)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4888)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-8827)) where (h, g)=(12, 4)
% next D is D_403 = 8827 at 240.470000s
%T% Ecpp sieve(8827): 0.030000
% Testing if N is a norm in Q(sqrt(-12376)) where (h, g)=(24, 8)
% Testing if N is a norm in Q(sqrt(-299)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-371)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-376)) where (h, g)=(8, 2)
% next D is D_571 = 376 at 240.650000s
%T% Ecpp sieve(376): 0.020000
% Testing if N is a norm in Q(sqrt(-1939)) where (h, g)=(8, 2)
% next D is D_597 = 1939 at 240.740000s
%T% Ecpp sieve(1939): 0.020000
% Testing if N is a norm in Q(sqrt(-2323)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2587)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3403)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3448)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4267)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4387)) where (h, g)=(8, 2)
% next D is D_618 = 4387 at 240.960000s
%T% Ecpp sieve(4387): 0.020000
% Testing if N is a norm in Q(sqrt(-4747)) where (h, g)=(8, 2)
% next D is D_619 = 4747 at 241.050000s
%T% Ecpp sieve(4747): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-2072)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-2296)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-4984)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6328)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-7672)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-10387)) where (h, g)=(16, 4)
% next D is D_740 = 10387 at 241.240000s
%T% Ecpp sieve(10387): 0.030000
% Testing if N is a norm in Q(sqrt(-12259)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-13363)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-17227)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-27307)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-63427)) where (h, g)=(32, 8)
% next D is D_950 = 63427 at 241.440000s
% D too large for using tabjac
%T% Ecpp sieve(63427): 0.060000
% Testing if N is a norm in Q(sqrt(-47)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-131)) where (h, g)=(5, 1)
% next D is D_1050 = 131 at 241.590000s
%T% Ecpp sieve(131): 0.020000
% Testing if N is a norm in Q(sqrt(-227)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-571)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-619)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-683)) where (h, g)=(5, 1)
% next D is D_1058 = 683 at 241.780000s
%T% Ecpp sieve(683): 0.020000
% Testing if N is a norm in Q(sqrt(-691)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-947)) where (h, g)=(5, 1)
% next D is D_1062 = 947 at 241.890000s
%T% Ecpp sieve(947): 0.030000
% Testing if N is a norm in Q(sqrt(-1123)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1723)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1747)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2203)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2683)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-119)) where (h, g)=(10, 2)
% next D is D_1071 = 119 at 242.110000s
%T% Ecpp sieve(119): 0.020000
% Testing if N is a norm in Q(sqrt(-611)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-664)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-851)) where (h, g)=(10, 2)
% next D is D_1088 = 851 at 242.250000s
%T% Ecpp sieve(851): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 28
% D[[13]]=851
% A[[13]]=-2673129076555336706187513788477939544343374085734278800454002840817877
% B[[13]]=-65780971931269876322294859046505968781618172860433610548997528555367
% m[[13]]=2707003006045736927041595771249828741755124154933677627075590284035317743890551529398045519356245534435941736401610320681399817670614887245
% Factor [P]=17401^1
% Factor [P]=281^1
% Factor [P]=271^1
% Factor [P]=5^1
% Factor [P]=3^4
% End of depth 13 at 242.360000 s

% N_14=5044102428504550527432324216510275295170188934169628952024799031818639615840583771796940907747366568229138643763618303794296679
% Pmax[421]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 242.390000s
% 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 242.440000s
%T% Ecpp sieve(3): 0.030000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 242.600000s
%T% Ecpp sieve(11): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[14]]=11
% A[[14]]=-4076021873622565191314208633664922698320174517147425734729913895
% B[[14]]=-569086620644999022647199464374189807246110005858302823951398641
% m[[14]]=5044102428504550527432324216510275295170188934169628952024799035894661489463148963111149541412289266549313160911044038524210575
% Factor [P]=89^1
% Factor [P]=5^2
% Factor [P]=3^6
% End of depth 14 at 242.700000 s

% N_15=3109756279036729105551593974513509529859397317655171129930055970712326560603658367233026335236688254835352821880700999383
% Pmax[401]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 242.720000s
% 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 242.770000s
%T% Ecpp sieve(3): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[15]]=3
% A[[15]]=-495602472586195238766930416753240052467282104336125606320540
% B[[15]]=2016052521249828122397781758574270175617390180698767875387762
% m[[15]]=3109756279036729105551593974513509529859397317655171129930056466314799146798897134163443088476740722117457158006307319924
% Factor [P]=139^1
% Factor [P]=73^1
% Factor [P]=31^1
% Factor [P]=19^2
% Factor [P]=7^2
% Factor [P]=2^2
% End of depth 15 at 242.930000 s

% N_16=139721656518035804611234454479179941126961125084485327836168967966288681452129043762481123734503433155723513097
% Pmax[366]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 242.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 242.970000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[16]]=3
% A[[16]]=342428442802519455527626237630996093891381805523088634
% B[[16]]=-13647580601626832672191631290912572790767984234463240512
% m[[16]]=139721656518035804611234454479179941126961125084485327835826539523486161996601417524850127640612051350200424464
% Factor [P]=3^2
% Factor [P]=2^4
% End of depth 16 at 243.090000 s

% N_17=970289281375248643133572600549860702270563368642259221082128746690876124976398732811459219726472578820836281
% Pmax[359]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 243.110000s
% 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]=15061^1
% Factor [P]=53^1
% Factor [P]=5^1
% Factor [P]=3^1
% Factor [P]=2^3
% End of depth 17 at 243.150000 s

% N_18=10129553665985251623832187266018200014600617537342472071460011745639808228261659741072460669654856193
% Pmax[333]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 243.170000s
% 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]=2^9
% End of depth 18 at 243.210000 s

% N_19=19784284503877444577797240753941796903516831127622015764570335440702750445823554181782149745419641
% Pmax[324]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 243.230000s
% 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 243.250000s
%T% Ecpp sieve(4): 0.030000
%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 243.340000s
%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 243.390000s
%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 243.440000s
%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 243.480000s
%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 243.520000s
%T% Ecpp sieve(163): 0.020000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 243.570000s
%T% Ecpp sieve(20): 0.010000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 243.610000s
%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 243.650000s
%T% Ecpp sieve(40): 0.010000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 243.690000s
%T% Ecpp sieve(115): 0.020000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 243.740000s
%T% Ecpp sieve(235): 0.010000
% Testing if N is a norm in Q(sqrt(-280)) where (h, g)=(-4, 4)
% next D is D_35 = 280 at 243.780000s
%T% Ecpp sieve(280): 0.010000
% Testing if N is a norm in Q(sqrt(-532)) where (h, g)=(-4, 4)
% next D is D_43 = 532 at 243.820000s
%T% Ecpp sieve(532): 0.010000
% Testing if N is a norm in Q(sqrt(-760)) where (h, g)=(-4, 4)
% next D is D_49 = 760 at 243.860000s
%T% Ecpp sieve(760): 0.010000
% Testing if N is a norm in Q(sqrt(-56)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-184)) 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 243.920000s
%T% Ecpp sieve(292): 0.020000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-763)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-772)) where (h, g)=(4, 2)
% next D is D_87 = 772 at 243.990000s
%T% Ecpp sieve(772): 0.010000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1387)) where (h, g)=(4, 2)
% next D is D_93 = 1387 at 244.050000s
%T% Ecpp sieve(1387): 0.010000
% Testing if N is a norm in Q(sqrt(-1555)) where (h, g)=(4, 2)
% next D is D_96 = 1555 at 244.090000s
%T% Ecpp sieve(1555): 0.010000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-1060)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1288)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1780)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2632)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2968)) where (h, g)=(8, 4)
% next D is D_143 = 2968 at 244.170000s
%T% Ecpp sieve(2968): 0.010000
% Testing if N is a norm in Q(sqrt(-3220)) where (h, g)=(16, 8)
% Testing if N is a norm in Q(sqrt(-6580)) 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(-211)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-307)) where (h, g)=(3, 1)
% next D is D_236 = 307 at 244.250000s
%T% Ecpp sieve(307): 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(-547)) where (h, g)=(3, 1)
% next D is D_240 = 547 at 244.300000s
%T% Ecpp sieve(547): 0.020000
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% next D is D_242 = 883 at 244.340000s
%T% Ecpp sieve(883): 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(-152)) where (h, g)=(6, 2)
% next D is D_247 = 152 at 244.390000s
%T% Ecpp sieve(152): 0.010000
% Testing if N is a norm in Q(sqrt(-212)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-424)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-436)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-628)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-835)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1048)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1099)) where (h, g)=(6, 2)
% next D is D_267 = 1099 at 244.500000s
%T% Ecpp sieve(1099): 0.010000
% Testing if N is a norm in Q(sqrt(-1108)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1192)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1219)) where (h, g)=(6, 2)
% next D is D_272 = 1219 at 244.560000s
%T% Ecpp sieve(1219): 0.010000
% Testing if N is a norm in Q(sqrt(-1603)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1915)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2443)) 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 244.640000s
%T% Ecpp sieve(3235): 0.010000
% Testing if N is a norm in Q(sqrt(-3427)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2260)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-2555)) where (h, g)=(12, 4)
% next D is D_337 = 2555 at 244.700000s
%T% Ecpp sieve(2555): 0.020000
% Testing if N is a norm in Q(sqrt(-2680)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-2740)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-2920)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-3115)) where (h, g)=(12, 4)
% next D is D_349 = 3115 at 244.780000s
%T% Ecpp sieve(3115): 0.010000
% Testing if N is a norm in Q(sqrt(-3955)) where (h, g)=(12, 4)
% next D is D_363 = 3955 at 244.820000s
%T% Ecpp sieve(3955): 0.020000
% Testing if N is a norm in Q(sqrt(-4360)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4795)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-5035)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-5140)) where (h, g)=(12, 4)
% next D is D_380 = 5140 at 244.900000s
%T% Ecpp sieve(5140): 0.010000
% Testing if N is a norm in Q(sqrt(-8155)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-8395)) where (h, g)=(12, 4)
% next D is D_401 = 8395 at 244.950000s
%T% Ecpp sieve(8395): 0.020000
% Testing if N is a norm in Q(sqrt(-2660)) where (h, g)=(24, 8)
% next D is D_414 = 2660 at 245.000000s
%T% Ecpp sieve(2660): 0.010000
% Testing if N is a norm in Q(sqrt(-5320)) where (h, g)=(24, 8)
% Testing if N is a norm in Q(sqrt(-8740)) where (h, g)=(24, 8)
% Testing if N is a norm in Q(sqrt(-18340)) where (h, g)=(24, 8)
% next D is D_492 = 18340 at 245.060000s
%T% Ecpp sieve(18340): 0.020000
% Testing if N is a norm in Q(sqrt(-95)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-371)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-376)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-452)) where (h, g)=(8, 2)
% next D is D_573 = 452 at 245.150000s
%T% Ecpp sieve(452): 0.010000
% Testing if N is a norm in Q(sqrt(-548)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-712)) where (h, g)=(8, 2)
% next D is D_578 = 712 at 245.200000s
%T% Ecpp sieve(712): 0.010000
% Testing if N is a norm in Q(sqrt(-904)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-995)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1043)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1348)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1795)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1864)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1939)) where (h, g)=(8, 2)
% next D is D_597 = 1939 at 245.310000s
%T% Ecpp sieve(1939): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 37
% D[[19]]=1939
% A[[19]]=842942092805339562025470650434137899023840488875
% B[[19]]=201114207652502846132054604774238618207497949501
% m[[19]]=19784284503877444577797240753941796903516831127621172822477530101140724975173120043883125904930767
% Factor [P]=191^1
% End of depth 19 at 245.350000 s

% N_20=103582641381557301454435815465663858133595974490163208494646754456234162173681256774257203690737
% Pmax[316]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 245.370000s
% 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 245.400000s
%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 245.490000s
%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 245.530000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[20]]=8
% A[[20]]=-104341278659887136578422355164789745719988831890
% B[[20]]=-224567212403616755989943355909102522163515732316
% m[[20]]=103582641381557301454435815465663858133595974490267549773306641592812584528846046519977192522628
% Factor [P]=97^1
% Factor [P]=11^2
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 20 at 245.590000 s

% N_21=735442343170864938900029930033681648729061759750273705470638732163333791491622266621064387
% Pmax[299]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 245.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 245.630000s
%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 245.700000s
%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 245.750000s
%T% Ecpp sieve(11): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[21]]=11
% A[[21]]=1626800526151070581633516679496563808711111413
% B[[21]]=163842890598962538358856048759423124989979717
% m[[21]]=735442343170864938900029930033681648729061758123473179319568150529817111995058457909952975
% Factor [P]=5393^1
% Factor [P]=103^1
% Factor [P]=5^2
% Factor [P]=3^3
% End of depth 21 at 245.790000 s

% N_22=1961449869581001432397464183987704568967101688275239472851540677051476658803739043
% Pmax[271]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 245.810000s
% 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 245.820000s
%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 245.860000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[22]]=8
% A[[22]]=-84447534839834524847631784446141302021262
% B[[22]]=-9449955937720952155424912385147670580021
% m[[22]]=1961449869581001432397464183987704568967186135810079307376388308835922800105760306
% Factor [P]=1049^1
% Factor [P]=457^1
% Factor [P]=73^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 22 at 245.900000 s

% N_23=9341388066308212193400279407689827971702391380312011704148227651868409659
% Pmax[243]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 245.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 245.920000s
%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 245.970000s
%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 246.000000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[23]]=8
% A[[23]]=1097143707946214986495392934061272678
% B[[23]]=2126082899058350431702567397245473213
% m[[23]]=9341388066308212193400279407689827970605247672365796717652834717807136982
% Factor [P]=11^1
% Factor [P]=2^1
% End of depth 23 at 246.040000 s

% N_24=424608548468555099700012700349537635027511257834808941711492487173051681
% Pmax[238]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 246.050000s
% 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 246.060000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[24]]=3
% A[[24]]=-810786830678992407848419116876124309
% B[[24]]=589083726101175789512286514872892741
% m[[24]]=424608548468555099700012700349537635838298088513801349559911604049175991
% Factor [P]=3691^1
% Factor [P]=151^1
% Factor [P]=3^1
% End of depth 24 at 246.110000 s

% N_25=253948987824064082671119177397402808357479585217309420719638189217
% Pmax[218]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 246.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 246.140000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[25]]=3
% A[[25]]=969133193402150065209556431659170
% B[[25]]=159767335775503172780536609906784
% m[[25]]=253948987824064082671119177397401839224286183067244211163206530048
% Factor [P]=103^1
% Factor [P]=13^1
% Factor [P]=2^10
% End of depth 25 at 246.170000 s

% N_26=185210648560072875827867678623711899639631796603140907366743
% Pmax[197]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 246.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 246.190000s
%T% Ecpp sieve(3): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 246.230000s
%T% Ecpp sieve(7): 0.010000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 246.250000s
%T% Ecpp sieve(43): 0.010000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 246.270000s
%T% Ecpp sieve(67): 0.010000
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 246.290000s
%T% Ecpp sieve(24): 0.010000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 246.310000s
%T% Ecpp sieve(51): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 246.330000s
%T% Ecpp sieve(91): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 246.370000s
%T% Ecpp sieve(123): 0.010000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 246.390000s
%T% Ecpp sieve(403): 0.020000
% Extra square factor: 21
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-312)) where (h, g)=(-4, 4)
% next D is D_36 = 312 at 246.430000s
%T% Ecpp sieve(312): 0.010000
% 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 246.460000s
%T% Ecpp sieve(408): 0.010000
% Testing if N is a norm in Q(sqrt(-483)) where (h, g)=(-4, 4)
% next D is D_41 = 483 at 246.480000s
%T% Ecpp sieve(483): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 13
% D[[26]]=483
% A[[26]]=857547358986057967595244166915
% B[[26]]=3360691457593801668115771447
% m[[26]]=185210648560072875827867678622854352280645738635545663199829
% Factor [P]=103^1
% Factor [P]=11^2
% Factor [P]=7^2
% End of depth 26 at 246.510000 s

% N_27=303282448390211148801051403784351643772744038493607467
% Pmax[178]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 246.520000s
% 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 246.520000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[27]]=3
% A[[27]]=1100985379923435385556660701
% B[[27]]=17897735012129676863291183
% m[[27]]=303282448390211148801051402683366263849308652936946767
% Factor [P]=37^1
% End of depth 27 at 246.550000 s

% N_28=8196822929465166183812200072523412536467801430728291
% Pmax[173]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 246.560000s
% 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 246.560000s
%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[[28]]=3
% A[[28]]=151684143505133918620622989
% B[[28]]=-57094110399627632075590959
% m[[28]]=8196822929465166183812199920839269031333882810105303
% Factor [P]=8209^1
% Factor [P]=1579^1
% Factor [P]=283^1
% Factor [P]=31^1
% Factor [P]=7^1
% End of depth 28 at 246.600000 s

% N_29=10297386134783756893651737592615257303943
% Pmax[133]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 246.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 246.610000s
%T% Ecpp sieve(3): 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(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 246.630000s
%T% Ecpp sieve(7): 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 246.660000s
%T% Ecpp sieve(43): 0.010000
% Extra square factor: 7
% 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 246.680000s
%T% Ecpp sieve(67): 0.010000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[29]]=67
% A[[29]]=164872340178202826897
% B[[29]]=14458719407848518867
% m[[29]]=10297386134783756893486865252437054477047
% Factor [P]=3^2
% Factor [P]=103^1
% End of depth 29 at 246.710000 s

% N_30=11108291407533718331701041264764891561
% Pmax[124]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 246.710000s
% 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 246.710000s
%T% Ecpp sieve(4): 0.000000
%T% Ecpp sieve(4): 0.000000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 246.720000s
%T% Ecpp sieve(8): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[30]]=8
% A[[30]]=1719798490755413406
% B[[30]]=2276934858019940026
% m[[30]]=11108291407533718329981242774009478156
% Factor [P]=2939^1
% Factor [P]=19^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 30 at 246.730000 s

% N_31=16577263133321571261828588871393
% Pmax[104]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 246.740000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[31]]=1
% Factor [P]=31^1
% Factor [P]=29^1
% Factor [P]=2^1
% End of depth 31 at 246.740000 s

% N_32=9219834890612664772985867003
% Pmax[93]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 246.740000s
% 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]=2^1
% End of depth 32 at 246.740000 s

% N_33=4609917445306332386492933501
% Pmax[92]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 246.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 246.750000s
%T% Ecpp sieve(4): 0.000000
%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 246.760000s
%T% Ecpp sieve(7): 0.000000
% 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 246.770000s
%T% Ecpp sieve(11): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[33]]=11
% A[[33]]=-122629629228705
% B[[33]]=-17585230932533
% m[[33]]=4609917445306455016122162207
% Factor [P]=3^1
% End of depth 33 at 246.770000 s

% N_34=1536639148435485005374054069
% Pmax[91]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 246.780000s
% 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]=5^1
% Factor [P]=2^1
% End of depth 34 at 246.780000 s

% N_35=153663914843548500537405407
% Pmax[87]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 246.780000s
% 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 246.780000s
%T% Ecpp sieve(7): 0.010000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 246.790000s
%T% Ecpp sieve(11): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[35]]=11
% A[[35]]=2785345298607
% B[[35]]=7427819397017
% m[[35]]=153663914843545715192106801
% Factor [P]=53^1
% Factor [P]=3^2
% End of depth 35 at 246.790000 s

% N_36=322146571999047620947813
% Pmax[79]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 246.790000s
% 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]=3^2
% Factor [P]=2^2
% End of depth 36 at 246.790000 s

% N_37=8948515888862433915217
% Pmax[73]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 246.790000s
% 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 246.790000s
%T% Ecpp sieve(3): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[37]]=3
% A[[37]]=183111431134
% B[[37]]=27472818952
% m[[37]]=8948515888679322484084
% Factor [P]=4051^1
% Factor [P]=223^1
% Factor [P]=61^1
% Factor [P]=2^2
% End of depth 37 at 246.800000 s

% N_38=40597013022757
% Pmax[46]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 246.800000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[38]]=1
% Factor [P]=563^1
% Factor [P]=17^1
% Factor [P]=2^1
% End of depth 38 at 246.800000 s

% N_39=2120834449
% Pmax[31]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 246.800000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[39]]=-1
% Factor [P]=2693^1
% Factor [P]=1823^1
% Factor [P]=3^3
% Factor [P]=2^4
% Cofactor is 1
% End of depth 39 at 246.800000 s

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

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


% Time for building is 31.820000 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): 1.000000
% N_0 is prime
% Time for proof[0] is 1.000000 s

% Starting proving job for step 1
% D=67 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(67)=-1
% Entering AEcModProveLarge
%T% ProveStep(67): 0.910000
% N_1 is prime
% Time for proof[1] is 0.910000 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.820000
% N_2 is prime
% Time for proof[2] is 0.820000 s

% Starting proving job for step 3
% 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.710000
% N_3 is prime
% Time for proof[3] is 0.710000 s

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

% Starting proving job for step 5
% D=532 h=-4 g=4 invcode=4 (f^4) g0=4
%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.220000
% Suggested twist(532)=1
% Entering AEcModProveLarge
%T% ProveStep(532): 0.900000
% N_5 is prime
% Time for proof[5] is 0.900000 s

% Starting proving job for step 6
% 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.610000
% N_6 is prime
% Time for proof[6] is 0.610000 s

% Starting proving job for step 7
% D=5083 h=8 g=4 invcode=11 (Stark's) g0=4
%T% one root in FindG2G3s: 0.060000s
% Using Stark's theorem
% E found
%T% find E: 0.170000
% Suggested twist(5083)=1
% Entering AEcModProveLarge
%T% ProveStep(5083): 0.710000
% N_7 is prime
% Time for proof[7] is 0.710000 s

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

% Starting proving job for step 9
% 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.400000
% N_9 is prime
% Time for proof[9] is 0.400000 s

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

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

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

% Starting proving job for step 13
% D=851 h=10 g=2 invcode=11 (Stark's) g0=2
%T% Factor of degree 1 found: 1.220000
%T% one root in FindG2G3s: 1.220000s
% Using Stark's theorem
% E found
%T% find E: 1.250000
% Suggested twist(851)=-1
% Entering AEcModProveLarge
%T% ProveStep(851): 1.530000
% N_13 is prime
% Time for proof[13] is 1.530000 s

% Starting proving job for step 14
% 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.230000
% N_14 is prime
% Time for proof[14] is 0.230000 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.160000
% N_15 is prime
% Time for proof[15] is 0.160000 s

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

% Starting proving job for step 17
%T% ProveStep(-1): 0.020000
% N_17 is prime
% Time for proof[17] is 0.020000 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=1939 h=8 g=2 invcode=11 (Stark's) g0=2
%T% Factor of degree 1 found: 0.250000
%T% one root in FindG2G3s: 0.300000s
% Using Stark's theorem
% E found
%T% find E: 0.310000
% Suggested twist(1939)=-1
% Entering AEcModProveLarge
%T% ProveStep(1939): 0.430000
% N_19 is prime
% Time for proof[19] is 0.430000 s

% Starting proving job for step 20
% 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_20 is prime
% Time for proof[20] is 0.110000 s

% Starting proving job for step 21
% 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.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=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.060000
% N_23 is prime
% Time for proof[23] is 0.060000 s

% Starting proving job for step 24
% 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.050000
% N_24 is prime
% Time for proof[24] is 0.050000 s

% Starting proving job for step 25
% 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.040000
% N_25 is prime
% Time for proof[25] is 0.040000 s

% Starting proving job for step 26
% Entering FindEForD0mod3
% D=483 h=-4 g=4 invcode=10 (w3) g0=4
%T% one root in GetInvariant: 0.000000s
% u has been computed
%T% FindW: 0.010000
% E found
%T% find E: 0.010000
% Suggested twist(483)=1
% Entering AEcModProveLarge
%T% ProveStep(483): 0.050000
% N_26 is prime
% Time for proof[26] is 0.050000 s

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

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

% Starting proving job for step 29
% D=67 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(67)=-1
% Entering AEcModProveLarge
%T% ProveStep(67): 0.010000
% N_29 is prime
% Time for proof[29] is 0.010000 s

% Starting proving job for step 30
% 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_30 is prime
% Time for proof[30] is 0.020000 s

% Starting proving job for step 31
%T% ProveStep(1): 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=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.000000
% N_33 is prime
% Time for proof[33] is 0.000000 s

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

% Starting proving job for step 35
% 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.010000
% N_35 is prime
% Time for proof[35] is 0.010000 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
% 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_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
% Using complete factorization theorem
%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
% Using complete factorization theorem
%T% ProveStep(-1): 0.000000
% N_41 is prime
% Time for proof[41] is 0.000000 s
% Time for proving  is 10.930000 s
% Total time is        42.750000 s
This number is prime
%T% PrintCertif: 0.050000
% Time for this number is 43.140000s

Working on 23712299675121126881347040911753304277762780366595263185132732150341829662519491789559401510434669471646829010324123636033651305541444159328082861921695608343437227201500281627504635240227369599068729750188943200313359616461612685570515563738290037377414483594329441244166100893
% Performing a quick factorization
% This number might be prime
% Entering ECPP: delay mode
% Starting phase 1: building the sequence of primes
% N_0=23712299675121126881347040911753304277762780366595263185132732150341829662519491789559401510434669471646829010324123636033651305541444159328082861921695608343437227201500281627504635240227369599068729750188943200313359616461612685570515563738290037377414483594329441244166100893
% Pmax[922]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.520000
% next D is D_1 = 0 at 258.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 259.350000s
%T% Ecpp sieve(4): 0.380000
%T% Ecpp sieve(4): 0.390000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 260.890000s
%T% Ecpp sieve(67): 0.210000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 261.550000s
%T% Ecpp sieve(148): 0.210000
% Testing if N is a norm in Q(sqrt(-68)) where (h, g)=(4, 2)
% next D is D_70 = 68 at 262.230000s
%T% Ecpp sieve(68): 0.220000
% Testing if N is a norm in Q(sqrt(-772)) where (h, g)=(4, 2)
% next D is D_87 = 772 at 262.920000s
%T% Ecpp sieve(772): 0.210000
% Testing if N is a norm in Q(sqrt(-1411)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-31)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-83)) where (h, g)=(3, 1)
% next D is D_231 = 83 at 263.910000s
%T% Ecpp sieve(83): 0.210000
% 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)
% next D is D_234 = 211 at 264.910000s
%T% Ecpp sieve(211): 0.200000
% Testing if N is a norm in Q(sqrt(-331)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-212)) where (h, g)=(6, 2)
% next D is D_248 = 212 at 266.050000s
%T% Ecpp sieve(212): 0.200000
% Testing if N is a norm in Q(sqrt(-436)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-628)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1108)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1147)) where (h, g)=(6, 2)
% next D is D_269 = 1147 at 267.200000s
%T% Ecpp sieve(1147): 0.200000
% Testing if N is a norm in Q(sqrt(-2227)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2923)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-3763)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-548)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1252)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1348)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4867)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-8308)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-10132)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-47)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-79)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-131)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-179)) where (h, g)=(5, 1)
% next D is D_1051 = 179 at 269.820000s
%T% Ecpp sieve(179): 0.220000
% Testing if N is a norm in Q(sqrt(-443)) where (h, g)=(5, 1)
% next D is D_1054 = 443 at 270.480000s
%T% Ecpp sieve(443): 0.210000
% Testing if N is a norm in Q(sqrt(-523)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-619)) where (h, g)=(5, 1)
% next D is D_1057 = 619 at 271.320000s
%T% Ecpp sieve(619): 0.200000
% Testing if N is a norm in Q(sqrt(-683)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-691)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-947)) where (h, g)=(5, 1)
% next D is D_1062 = 947 at 272.310000s
%T% Ecpp sieve(947): 0.210000
% Testing if N is a norm in Q(sqrt(-1123)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1867)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2203)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2683)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-724)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1492)) where (h, g)=(10, 2)
% next D is D_1095 = 1492 at 273.800000s
%T% Ecpp sieve(1492): 0.190000
% Testing if N is a norm in Q(sqrt(-1643)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1819)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-2363)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-2452)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-2836)) where (h, g)=(10, 2)
% next D is D_1112 = 2836 at 275.100000s
%T% Ecpp sieve(2836): 0.200000
% Testing if N is a norm in Q(sqrt(-3028)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-3508)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-4372)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-4852)) where (h, g)=(10, 2)
% next D is D_1133 = 4852 at 276.250000s
%T% Ecpp sieve(4852): 0.190000
% Testing if N is a norm in Q(sqrt(-5611)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-7123)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-7363)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-932)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-1732)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-2468)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-2491)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-2627)) where (h, g)=(12, 2)
% next D is D_1606 = 2627 at 278.020000s
%T% Ecpp sieve(2627): 0.200000
% Testing if N is a norm in Q(sqrt(-3043)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-4132)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-5188)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-8068)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-8131)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-8347)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-3604)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-5828)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-13348)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-16132)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-21172)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-24628)) where (h, g)=(24, 4)
% next D is D_1841 = 24628 at 280.460000s
%T% Ecpp sieve(24628): 0.200000
% Cofactor after sieve is a probable prime
% Number of D tried was 19
% D[[0]]=24628
% A[[0]]=-8147755906499425088699009804562441359862512055856457853777746982240093818319824562826919906668250165536547663094822224581169182327140954458
% B[[0]]=-33996001678428462920271328170711084371042163352043992109947289023789653760396620004677902519193985384763458857181892884739755970655306206
% m[[0]]=23712299675121126881347040911753304277762780366595263185132732150341829662519491789559401510434669471646829010324123636033651305541444159336230617828195033432136237006062722987367147296083827452846476732429037018633184179288532592238765729274837700472236708175498623571307055352
% Factor [P]=61^1
% Factor [P]=2^3
% End of depth 0 at 281.390000 s

% N_1=48590778022789194428989837933920705487218812226629637674452319980208667341228466781884019488595634163210715185090417286954203494961975736344734872598760314410115239766521973334768744459188171009931304779567698808674557744443714328358126494415651025557862106917005376170711179
% Pmax[913]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.430000
% next D is D_1 = 0 at 281.820000s
% 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 282.270000s
%T% Ecpp sieve(3): 0.340000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[1]]=3
% A[[1]]=-100041412230479551920033342746236627240946977909233980586990939835855636563431706569366235764349322510898809979592345678271002123702978773
% B[[1]]=247894351105525082475569740727417886224892662946927741121799920232101253485365992254382786874538393106556992860607128177516208348815904777
% m[[1]]=48590778022789194428989837933920705487218812226629637674452319980208667341228466781884019488595634163210715185090417286954203494961975736444776284829239866330148582512758600575715722368422151596922244615423335372106264313809950092707449005314461005150207785188007499873689953
% Factor [P]=13^1
% End of depth 1 at 283.930000 s

% N_2=3737752155599168802229987533378515806709139402048433667265563075400666718556035906298770729891971858708516552699262868227246422689382748957290483448403066640780660193289123121208901720647857815147864970417179644008174177985380776362111461947266231165400598860615961528745381
% Pmax[909]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.430000
% next D is D_1 = 0 at 284.360000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 284.820000s
%T% Ecpp sieve(3): 0.340000
% Extra square factor: 5
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[2]]=3
% A[[2]]=-55537420728074311956420870054073463436973339777131580287474474597972816015389227798027385037463862957537024939960300164632524612014175606
% B[[2]]=62893040211853693284959801628680329858973140873817700279446480838032812993620393815819741244516131893653851540179136598628556012231090564
% m[[2]]=3737752155599168802229987533378515806709139402048433667265563075400666718556035906298770729891971858708516552699262868227246422689382749012827904176477378597201530247362586558182241497779438102622339568389995659397401976012765813825974419484291171125700763493140573542920988
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 2 at 286.590000 s

% N_3=133491148414256028651070983334946993096754978644586916688055824121452382805572710939241811781856137811018448310687959579544515096049383893315282292017049235614340365977235234220794339206408503665083556013928416407050070571884493350927657838724684683060741553326449055104321
% Pmax[904]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.420000
% next D is D_1 = 0 at 287.020000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 287.450000s
%T% Ecpp sieve(3): 0.330000
% Extra square factor: 5
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[3]]=3
% A[[3]]=-16655936581283308558463705541300296670063790053825392938418279125141518537778832872771291032888132516737381404297818236394581824884433919
% B[[3]]=9247420726114076945299219217476006637781870163998461468205640342578258891168312188609690042325599875383294027176263672446794837469331329
% m[[3]]=133491148414256028651070983334946993096754978644586916688055824121452382805572710939241811781856137811018448310687959579544515096049383909971218873300357794078045907277531904284584393031801442083362681155446954185882943343175526239060174576106088980878977947908273939538241
% Factor [P]=9103^1
% Factor [P]=1861^1
% Factor [P]=7^1
% End of depth 3 at 288.870000 s

% N_4=1125702196256162320281815786588558890172888025526537985410251119167242740917763392751400466657320367366689729862451401580313371713773151969401696439447468339786754822084057348679375585571992093010339000882811042893294573299212200249036801578324700712471509711758661
% Pmax[878]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.370000
% next D is D_1 = 0 at 289.240000s
% 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 289.660000s
%T% Ecpp sieve(3): 0.290000
% 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 291.030000s
%T% Ecpp sieve(4): 0.330000
%T% Ecpp sieve(4): 0.330000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 292.360000s
%T% Ecpp sieve(7): 0.200000
% 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 293.080000s
%T% Ecpp sieve(15): 0.190000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 293.650000s
%T% Ecpp sieve(20): 0.190000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 294.250000s
%T% Ecpp sieve(35): 0.190000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 294.840000s
%T% Ecpp sieve(51): 0.190000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 295.430000s
%T% Ecpp sieve(52): 0.190000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 296.140000s
%T% Ecpp sieve(91): 0.180000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 296.590000s
%T% Ecpp sieve(115): 0.190000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 297.160000s
%T% Ecpp sieve(403): 0.180000
% Extra square factor: 15
% 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 297.850000s
%T% Ecpp sieve(427): 0.170000
% Testing if N is a norm in Q(sqrt(-84)) where (h, g)=(-4, 4)
% next D is D_29 = 84 at 298.420000s
%T% Ecpp sieve(84): 0.180000
% Testing if N is a norm in Q(sqrt(-195)) where (h, g)=(-4, 4)
% next D is D_33 = 195 at 299.020000s
%T% Ecpp sieve(195): 0.170000
% Testing if N is a norm in Q(sqrt(-340)) where (h, g)=(-4, 4)
% next D is D_37 = 340 at 299.590000s
%T% Ecpp sieve(340): 0.180000
% Cofactor after sieve is a probable prime
% Number of D tried was 16
% D[[4]]=340
% A[[4]]=1803919724243268179393409683345486127793577056276746811556719186855580715471261804373762368348456227501359294683308940262404518394328
% B[[4]]=60601941667368375883519018864521039073767804821759025940328784951199074638349320726896730662240029401936775655340839348725017807247
% m[[4]]=1125702196256162320281815786588558890172888025526537985410251119167242740917763392751400466657320367366689729862451401580313371713771348049677453171268074930103409335956263771623098838760435373823483420167339781088920810930863744021535442283641391772209105193364334
% Factor [P]=461^1
% Factor [P]=2^1
% End of depth 4 at 300.300000 s

% N_5=1220935136937269327854463976777178839666906752197980461399404684563170000995404981292191395506855062219837017204394144881034025719925540184031944871223508600979836589974255717595551885857305177682736898229218851506421703829570221281491802910673960707385146630547
% Pmax[868]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.370000
% next D is D_1 = 0 at 300.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 301.070000s
%T% Ecpp sieve(3): 0.290000
% Extra square factor: 17
% Factorization completed using trial division only
% 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 302.240000s
%T% Ecpp sieve(8): 0.310000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 302.960000s
%T% Ecpp sieve(11): 0.190000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[5]]=11
% A[[5]]=-65495496158408180463426066007410871879145722748051915733626698841487151345904300243449578139841033581791459075593091158742449098597
% B[[5]]=-7348967340647976969564799913551689224716103838764324167215815487885160002554850603957824033675681965234787205909003650416336490667
% m[[5]]=1220935136937269327854463976777178839666906752197980461399404684563170000995404981292191395506855062219837017204394144881034025719991035680190353051686934666987247461853401440343603801590931876524224049575123151749871281969411254863283261986267051866127595729145
% Factor [P]=53887^1
% Factor [P]=23^1
% Factor [P]=5^1
% Factor [P]=3^2
% End of depth 5 at 303.740000 s

% N_6=21891132839120928897722259503263249113741355742688613494196070602979808633281632395939497216027116005945829516828319932702867948486424502735870940015682031830739158348865503763396884670559620270405247724507836209227437411197671829882755406061602909902581
% Pmax[842]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.350000
% next D is D_1 = 0 at 304.090000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 304.450000s
%T% Ecpp sieve(3): 0.300000
% Extra square factor: 29
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[6]]=3
% A[[6]]=9231811876988394536527441790830277311115373034845781175084575234173852842495126745128510466995471157390697924533410509067878871
% B[[6]]=882832718087960945000114397041870956571163589240419543284466754632477711780446321315528435691191675780010223084940314257235169
% m[[6]]=21891132839120928897722259503263249113741355742688613494196070602979808633281632395939497216027116005945829516828319932702867939254612625747476403488240241000461847233492468917615709585984386096552405229381091080716970415726514439184830872651093842023711
% Factor [P]=29^2
% Factor [P]=1567^1
% Factor [P]=7^1
% Factor [P]=3^1
% End of depth 6 at 305.280000 s

% N_7=791013598013272112906316478723512817415409764226500225428873963979553253048763569379576334807097738672598618982264251309427167018651765079437699140674153734244164091795628595718395577389064858802794226722723867060547581295802364772846521732980053
% Pmax[817]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.300000
% next D is D_1 = 0 at 305.580000s
% 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 305.910000s
%T% Ecpp sieve(3): 0.240000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 306.890000s
%T% Ecpp sieve(4): 0.280000
%T% Ecpp sieve(4): 0.270000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 307.990000s
%T% Ecpp sieve(11): 0.160000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 308.360000s
%T% Ecpp sieve(43): 0.160000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 308.850000s
%T% Ecpp sieve(163): 0.150000
% Extra square factor: 3
% Factorization completed using trial division only
% 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 309.330000s
%T% Ecpp sieve(52): 0.150000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 309.820000s
%T% Ecpp sieve(148): 0.140000
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 310.290000s
%T% Ecpp sieve(267): 0.140000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 310.770000s
%T% Ecpp sieve(403): 0.150000
% Testing if N is a norm in Q(sqrt(-132)) where (h, g)=(-4, 4)
% next D is D_31 = 132 at 311.260000s
%T% Ecpp sieve(132): 0.140000
% Testing if N is a norm in Q(sqrt(-372)) where (h, g)=(-4, 4)
% next D is D_38 = 372 at 311.720000s
%T% Ecpp sieve(372): 0.140000
% Testing if N is a norm in Q(sqrt(-39)) where (h, g)=(4, 2)
% next D is D_67 = 39 at 312.180000s
%T% Ecpp sieve(39): 0.160000
% Testing if N is a norm in Q(sqrt(-219)) 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 312.910000s
%T% Ecpp sieve(292): 0.140000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-388)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-723)) where (h, g)=(4, 2)
% next D is D_85 = 723 at 313.590000s
%T% Ecpp sieve(723): 0.140000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-1027)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-564)) where (h, g)=(8, 4)
% next D is D_103 = 564 at 314.070000s
%T% Ecpp sieve(564): 0.150000
% Testing if N is a norm in Q(sqrt(-852)) where (h, g)=(8, 4)
% next D is D_108 = 852 at 314.550000s
%T% Ecpp sieve(852): 0.150000
% Extra square factor: 13
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1131)) where (h, g)=(8, 4)
% next D is D_116 = 1131 at 315.130000s
%T% Ecpp sieve(1131): 0.140000
% Testing if N is a norm in Q(sqrt(-1443)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2067)) where (h, g)=(8, 4)
% next D is D_132 = 2067 at 315.710000s
%T% Ecpp sieve(2067): 0.140000
% Testing if N is a norm in Q(sqrt(-1716)) where (h, g)=(16, 8)
% next D is D_155 = 1716 at 316.170000s
%T% Ecpp sieve(1716): 0.140000
% Testing if N is a norm in Q(sqrt(-3828)) where (h, g)=(16, 8)
% Testing if N is a norm in Q(sqrt(-6708)) where (h, g)=(16, 8)
% Testing if N is a norm in Q(sqrt(-31)) where (h, g)=(3, 1)
% next D is D_229 = 31 at 316.880000s
%T% Ecpp sieve(31): 0.150000
% Testing if N is a norm in Q(sqrt(-83)) where (h, g)=(3, 1)
% next D is D_231 = 83 at 317.350000s
%T% Ecpp sieve(83): 0.150000
% Extra square factor: 13
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-107)) where (h, g)=(3, 1)
% next D is D_232 = 107 at 317.920000s
%T% Ecpp sieve(107): 0.150000
% No factor found, sieve only: no PRP test
% 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(-331)) where (h, g)=(3, 1)
% next D is D_237 = 331 at 318.520000s
%T% Ecpp sieve(331): 0.150000
% Testing if N is a norm in Q(sqrt(-499)) 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 319.110000s
%T% Ecpp sieve(547): 0.140000
% Cofactor after sieve is a probable prime
% Number of D tried was 25
% D[[7]]=547
% A[[7]]=-1303850655491940416412020548452416173372401089807211528672155868609953437092318474953849931848537225169305168060704990658667
% B[[7]]=-51734589510161124067719182034298787110394214881606322739590904748812163407630734513509230994715521822276615741473826597453
% m[[7]]=791013598013272112906316478723512817415409764226500225428873963979553253048763569379576334807097738672598618982264251309428470869307257019854111161222606150417536492885435807247067733257674812239886545197677716992396118520971669940907226723638721
% Factor [P]=887^1
% Factor [P]=127^1
% Factor [P]=19^1
% End of depth 7 at 319.730000 s

% N_8=369575359144577223292246142640326574448255790448533533097859146075795404098134152792057085940024107800428353830442231276110316988030008919113030256171875354988334277682020120835080056896655149245554330240358952420161236052260921297176570691
% Pmax[796]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.290000
% next D is D_1 = 0 at 320.030000s
% 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 320.340000s
%T% Ecpp sieve(3): 0.240000
% 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 321.380000s
%T% Ecpp sieve(8): 0.270000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 321.930000s
%T% Ecpp sieve(19): 0.160000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 322.400000s
%T% Ecpp sieve(43): 0.150000
% Extra square factor: 15
% 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 322.950000s
%T% Ecpp sieve(163): 0.150000
% Extra square factor: 5
% 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 323.500000s
%T% Ecpp sieve(15): 0.150000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 323.960000s
%T% Ecpp sieve(40): 0.140000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 324.510000s
%T% Ecpp sieve(115): 0.140000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 325.040000s
%T% Ecpp sieve(123): 0.150000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 325.590000s
%T% Ecpp sieve(232): 0.150000
% Extra square factor: 3
% 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 326.140000s
%T% Ecpp sieve(235): 0.140000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-435)) where (h, g)=(-4, 4)
% next D is D_40 = 435 at 326.690000s
%T% Ecpp sieve(435): 0.150000
% Testing if N is a norm in Q(sqrt(-795)) where (h, g)=(-4, 4)
% next D is D_50 = 795 at 327.140000s
%T% Ecpp sieve(795): 0.140000
% Testing if N is a norm in Q(sqrt(-155)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-291)) where (h, g)=(4, 2)
% next D is D_77 = 291 at 327.690000s
%T% Ecpp sieve(291): 0.150000
% Cofactor after sieve is a probable prime
% Number of D tried was 15
% D[[8]]=291
% A[[8]]=1215847405291929686416371788273103185097816012895620054139808436483962232119870127266611929966636871627220810410967146483
% B[[8]]=238290180826297052793304217905721646092206002040309675863798388220974068867464677846329130134757361874998718733884385
% m[[8]]=369575359144577223292246142640326574448255790448533533097859146075795404098134152792057085940024107800428353830442231274894469582738079232696658467898772169890518264786400066695271620412692917125684202973747022453524364425040110886209424209
% Factor [P]=887^1
% End of depth 8 at 328.220000 s

% N_9=416657676600425279923614591477256566458011037709733408227575136500333037314694648018102689898561564600257445130149076972823528278171453475419006164485650698861914616444644945541456167319834179397614659496896304908144717502863710131014007
% Pmax[787]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.290000
% next D is D_1 = 0 at 328.510000s
% 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 328.810000s
%T% Ecpp sieve(11): 0.160000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 329.270000s
%T% Ecpp sieve(19): 0.160000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 329.710000s
%T% Ecpp sieve(88): 0.150000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[9]]=88
% A[[9]]=12321003863764433946402128611686221149976403050177853568505171538489957404948155558415248166160502102123566506451943406
% B[[9]]=4148964233000047273955944008657369513829912505348427462086110045573011576261519484356347817727511944544228309939919803
% m[[9]]=416657676600425279923614591477256566458011037709733408227575136500333037314694648018102689898561564600257445130149076960502524414407019529016877552799429548885511566266791377036284628829876774449459101081648138747642615379297203679070602
% Factor [P]=521^1
% Factor [P]=97^1
% Factor [P]=19^1
% Factor [P]=2^1
% End of depth 9 at 330.210000 s

% N_10=216963327859017978450189486742520366244435310923697076674190320432415352438335772757480808692829310364713214356833438846005753165948773087053923781116820895625983029769117247621744896042751779805655210971871645239414277699245473967
% Pmax[766]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.230000
% next D is D_1 = 0 at 330.440000s
% 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 330.710000s
%T% Ecpp sieve(3): 0.200000
% Extra square factor: 11
% Factorization completed using trial division only
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 331.520000s
%T% Ecpp sieve(11): 0.130000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 331.910000s
%T% Ecpp sieve(19): 0.130000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 332.390000s
%T% Ecpp sieve(24): 0.130000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 332.800000s
%T% Ecpp sieve(51): 0.120000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 333.200000s
%T% Ecpp sieve(88): 0.120000
% Cofactor after sieve is a probable prime
% Number of D tried was 7
% D[[10]]=88
% A[[10]]=-7620899570815479580462724062577106515800111603905562447076496075242692815241227438535392763168937770841736370748586
% B[[10]]=-3033478353698815622696196443221309542657366124005081547554390931156864295761850944343137065972244342262251942179287
% m[[10]]=216963327859017978450189486742520366244435310923697076674190320432415352438335772757480808692829310364713214356833446466905323981428353549777986358223336695737586935331564324117820138735567021033093746364634814177185119435616222554
% Factor [P]=107^1
% Factor [P]=13^1
% Factor [P]=11^1
% Factor [P]=2^1
% End of depth 10 at 333.740000 s

% N_11=7089841443664400315345058713238362402602291056914485219076868192680718660163903429758865717692611932707444427058148044797899613797410415978628402007167397416429871751243850863271032570928926901284025435090347499417852409503177
% Pmax[751]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.230000
% next D is D_1 = 0 at 333.980000s
% 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 334.240000s
%T% Ecpp sieve(3): 0.190000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 335.030000s
%T% Ecpp sieve(4): 0.210000
%T% Ecpp sieve(4): 0.230000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 335.880000s
%T% Ecpp sieve(7): 0.130000
% Extra square factor: 3
% 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 336.350000s
%T% Ecpp sieve(8): 0.210000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 336.820000s
%T% Ecpp sieve(11): 0.130000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 337.220000s
%T% Ecpp sieve(19): 0.130000
% 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 337.700000s
%T% Ecpp sieve(43): 0.130000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 338.090000s
%T% Ecpp sieve(67): 0.120000
% 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 338.550000s
%T% Ecpp sieve(163): 0.120000
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 338.940000s
%T% Ecpp sieve(24): 0.130000
% Cofactor after sieve is a probable prime
% Number of D tried was 11
% D[[11]]=24
% A[[11]]=-87857663958958801696668723124869951428094187457958676856312955714899584895817907975353578956211212728606142100018
% B[[11]]=-29326038386227884258913009180869330326693250108094494313154299558020290613081543076235055800573482390210700620246
% m[[11]]=7089841443664400315345058713238362402602291056914485219076868192680718660163903429758865717692611932707444427058235902461858572599107084701753271958595491603887830428100163818985932155824744809259379014046558712146458551603196
% Factor [P]=221813^1
% Factor [P]=11^1
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 11 at 339.500000 s

% N_12=103776450100684440979403715479629213858717938681859213500901868150794603752217388300799089476572256177229263538683308562973142238497068589332872471063514475599983723684472544455018769990949214932763637365512208279140399
% Pmax[725]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.220000
% next D is D_1 = 0 at 339.720000s
% 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 339.960000s
%T% Ecpp sieve(3): 0.190000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[12]]=3
% A[[12]]=19964774014169338446709788743414844638544853106829655786439207037144812824600430831754839134258694720279805673
% B[[12]]=2346174117287297163507518370924298462403383575644054460370743693973981728980382827533263324858961484857528917
% m[[12]]=103776450100684440979403715479629213858717938681859213500901868150794603752217388300799089476572256177229263518718534548803803791787279845918027832518661368770327937245265507310205945390518383177924503106817487999334727
% Factor [P]=11617^1
% Factor [P]=457^1
% End of depth 12 at 340.440000 s

% N_13=19547382947740783752815982816932857181633183143819301544405678042345812106308661493559124092940127579804904402101148932834944749496047131922983131474051057516125623872594755650335487999745032072691421461835148783
% Pmax[702]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.160000
% next D is D_1 = 0 at 340.600000s
% 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 340.810000s
%T% Ecpp sieve(3): 0.130000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[13]]=3
% A[[13]]=-5578625464617358917633366711472889480884709662032848762535532737149678196055587816022498108309135882533703
% B[[13]]=3960996074915411617063492350032238733447545497136316011201983899005227471337057239896828595323903520334629
% m[[13]]=19547382947740783752815982816932857181633183143819301544405678042345812106308661493559124092940127579804909980726613550193862382862758604812464016183713090364888159405331905328531543587561054570799730597717682487
% Factor [P]=43^1
% Factor [P]=37^1
% Factor [P]=13^1
% Factor [P]=3^1
% End of depth 13 at 341.410000 s

% N_14=315031393700797494767296536881059439823900194101747031288266983228509921292988791012895036067303704810793243738442417286239300921251891324799175106507970964316720002019885982506269941297378758252344608256663
% Pmax[686]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 341.560000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 341.770000s
%T% Ecpp sieve(3): 0.130000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 342.380000s
%T% Ecpp sieve(19): 0.090000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 342.680000s
%T% Ecpp sieve(43): 0.080000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[14]]=43
% A[[14]]=32961005449376358411534812045650658784461625262870302050544462036598950198503342232166503829152363766753
% B[[14]]=2009846080936339369201573805458576959681955643680347674698270632427740223872911025816518665538412831351
% m[[14]]=315031393700797494767296536881059439823900194101747031288266983228509921292988791012895036067303704810760282732993040927827766109206240666014713481245100662266175539983287032307766599065212254423192244489911
% Factor [P]=547^1
% End of depth 14 at 343.020000 s

% N_15=575925765449355566302187453164642485966910775323120715335040188717568411870180605142404087874412623054406366970736820709008713179536088968948287899899635580011289835435625287582754294451941964210589112413
% Pmax[677]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 343.170000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 343.380000s
%T% Ecpp sieve(3): 0.130000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 343.960000s
%T% Ecpp sieve(4): 0.150000
%T% Ecpp sieve(4): 0.150000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 344.590000s
%T% Ecpp sieve(11): 0.080000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 344.880000s
%T% Ecpp sieve(19): 0.090000
% 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 345.230000s
%T% Ecpp sieve(43): 0.080000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 345.520000s
%T% Ecpp sieve(51): 0.080000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 345.740000s
%T% Ecpp sieve(123): 0.080000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 346.020000s
%T% Ecpp sieve(187): 0.080000
% 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 346.360000s
%T% Ecpp sieve(267): 0.080000
% Testing if N is a norm in Q(sqrt(-132)) where (h, g)=(-4, 4)
% next D is D_31 = 132 at 346.630000s
%T% Ecpp sieve(132): 0.080000
% Testing if N is a norm in Q(sqrt(-228)) where (h, g)=(-4, 4)
% next D is D_34 = 228 at 346.910000s
%T% Ecpp sieve(228): 0.080000
% Testing if N is a norm in Q(sqrt(-627)) where (h, g)=(-4, 4)
% next D is D_46 = 627 at 347.200000s
%T% Ecpp sieve(627): 0.080000
% Testing if N is a norm in Q(sqrt(-1012)) where (h, g)=(-4, 4)
% next D is D_51 = 1012 at 347.480000s
%T% Ecpp sieve(1012): 0.070000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-68)) 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 347.890000s
%T% Ecpp sieve(323): 0.080000
% Testing if N is a norm in Q(sqrt(-723)) where (h, g)=(4, 2)
% next D is D_85 = 723 at 348.170000s
%T% Ecpp sieve(723): 0.070000
% Testing if N is a norm in Q(sqrt(-276)) where (h, g)=(8, 4)
% next D is D_99 = 276 at 348.440000s
%T% Ecpp sieve(276): 0.080000
% Testing if N is a norm in Q(sqrt(-564)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2451)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2788)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-3243)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-4323)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2244)) where (h, g)=(16, 8)
% next D is D_158 = 2244 at 349.080000s
%T% Ecpp sieve(2244): 0.070000
% Testing if N is a norm in Q(sqrt(-5412)) where (h, g)=(16, 8)
% Testing if N is a norm in Q(sqrt(-8052)) where (h, g)=(16, 8)
% next D is D_200 = 8052 at 349.410000s
%T% Ecpp sieve(8052): 0.080000
% Testing if N is a norm in Q(sqrt(-23)) 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(-283)) where (h, g)=(3, 1)
% next D is D_235 = 283 at 349.910000s
%T% Ecpp sieve(283): 0.080000
% Testing if N is a norm in Q(sqrt(-643)) where (h, g)=(3, 1)
% next D is D_241 = 643 at 350.190000s
%T% Ecpp sieve(643): 0.080000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% next D is D_243 = 907 at 350.530000s
%T% Ecpp sieve(907): 0.080000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-244)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-451)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-771)) where (h, g)=(6, 2)
% next D is D_260 = 771 at 351.020000s
%T% Ecpp sieve(771): 0.080000
% Testing if N is a norm in Q(sqrt(-843)) where (h, g)=(6, 2)
% next D is D_263 = 843 at 351.300000s
%T% Ecpp sieve(843): 0.080000
% Testing if N is a norm in Q(sqrt(-1059)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1108)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1203)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1347)) where (h, g)=(6, 2)
% next D is D_275 = 1347 at 351.800000s
%T% Ecpp sieve(1347): 0.070000
% Cofactor after sieve is a probable prime
% Number of D tried was 25
% D[[15]]=1347
% A[[15]]=85701925644332952233308093773922270940188894510976229593073242812677237720127447709828722234512294263
% B[[15]]=41289157623962472049357284370385830842891603793839855426627370462210595698477964902388444397646165167
% m[[15]]=575925765449355566302187453164642485966910775323120715335040188717568411870180605142404087874412623054320665045092487756775405085762166698008099005388659350418216592622948049862626846742113241976076818151
% Factor [P]=107563^1
% Factor [P]=937^1
% Factor [P]=3^2
% End of depth 15 at 352.110000 s

% N_16=634923645864893027446944002605359689455275830373186048634305211452387435766679539024255012225804284915721377542107054140195473678656268837712605120253462957949120527956864538071865582407273185669
% Pmax[648]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 352.260000s
% 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 352.430000s
%T% Ecpp sieve(3): 0.130000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 352.950000s
%T% Ecpp sieve(4): 0.150000
%T% Ecpp sieve(4): 0.140000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 353.540000s
%T% Ecpp sieve(7): 0.090000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 353.800000s
%T% Ecpp sieve(163): 0.080000
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 354.050000s
%T% Ecpp sieve(15): 0.090000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 354.310000s
%T% Ecpp sieve(20): 0.090000
% Extra square factor: 31
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 354.640000s
%T% Ecpp sieve(35): 0.080000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 354.900000s
%T% Ecpp sieve(51): 0.090000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 355.170000s
%T% Ecpp sieve(52): 0.080000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 355.420000s
%T% Ecpp sieve(91): 0.090000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 355.680000s
%T% Ecpp sieve(235): 0.090000
% No factor found, sieve only: no PRP test
% Extra square factor: 7
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 355.950000s
%T% Ecpp sieve(403): 0.080000
% Extra square factor: 3
% Factorization completed using trial division only
% Extra square factor: 7
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-84)) where (h, g)=(-4, 4)
% next D is D_29 = 84 at 356.320000s
%T% Ecpp sieve(84): 0.080000
% Testing if N is a norm in Q(sqrt(-195)) where (h, g)=(-4, 4)
% next D is D_33 = 195 at 356.580000s
%T% Ecpp sieve(195): 0.080000
% Testing if N is a norm in Q(sqrt(-340)) where (h, g)=(-4, 4)
% next D is D_37 = 340 at 356.830000s
%T% Ecpp sieve(340): 0.080000
% Cofactor after sieve is a probable prime
% Number of D tried was 16
% D[[16]]=340
% A[[16]]=34530990012252456574536027568320333045681238206486792612283486498049579674310433946607323191907776
% B[[16]]=1990643786075021922414418033330017587788103486026905841049781188026205207989604864847856346632985
% m[[16]]=634923645864893027446944002605359689455275830373186048634305211452387435766679539024255012225804250384731365289650479604167905358323223156474398633460850674462622478377190227637918975084081277894
% Factor [P]=2^1
% End of depth 16 at 357.140000 s

% N_17=317461822932446513723472001302679844727637915186593024317152605726193717883339769512127506112902125192365682644825239802083952679161611578237199316730425337231311239188595113818959487542040638947
% Pmax[647]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.140000
% next D is D_1 = 0 at 357.290000s
% 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 357.470000s
%T% Ecpp sieve(3): 0.120000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 357.990000s
%T% Ecpp sieve(8): 0.150000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 358.310000s
%T% Ecpp sieve(11): 0.090000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 358.570000s
%T% Ecpp sieve(19): 0.090000
% 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 358.890000s
%T% Ecpp sieve(43): 0.090000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 359.100000s
%T% Ecpp sieve(51): 0.080000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 359.350000s
%T% Ecpp sieve(187): 0.080000
% No factor found, sieve only: no PRP test
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[17]]=187
% A[[17]]=-30740946154237599989571274387897959198070201302216521853857417294637147059496863416376516790570435
% B[[17]]=-1317998647423394010810396950123644319623277056028645666674881337130299410132722504355696856630693
% m[[17]]=317461822932446513723472001302679844727637915186593024317152605726193717883339769512127506112902155933311836882425229373358340577120809648438501533252279194648605876335654610682375864058831209383
% Factor [P]=58193^1
% End of depth 17 at 359.650000 s

% N_18=5455326636063555989955355477508976074916878579667537750539628576051994533420510534121415051860226417839118740783689264574061151291750032623141985002530874755530834917183417433065417903507831
% Pmax[631]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 359.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 359.890000s
%T% Ecpp sieve(3): 0.070000
% 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 360.370000s
%T% Ecpp sieve(7): 0.050000
% Extra square factor: 531
% 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 360.620000s
%T% Ecpp sieve(11): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[18]]=11
% A[[18]]=81037527789029960641643945562993292590688466451854505438794428890102737298133490425300481982605
% B[[18]]=37239062621363825646328265774621719416247051215518847352229617542558210882724922048502049912203
% m[[18]]=5455326636063555989955355477508976074916878579667537750539628576051994533420510534121415051860145380311329710823047620628498157999159344156690130497092080326640732179885283942640117421525227
% Factor [P]=829^1
% Factor [P]=103^1
% Factor [P]=23^1
% Factor [P]=3^7
% End of depth 18 at 360.850000 s

% N_19=1270142314376301675741787324820717818537498379391962280926116538554080093014845513101392782409768905364307152209709382845518880272077014139106670619776921972586526104171305814812021
% Pmax[599]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.070000
% next D is D_1 = 0 at 360.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 361.060000s
%T% Ecpp sieve(4): 0.090000
%T% Ecpp sieve(4): 0.090000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 361.470000s
%T% Ecpp sieve(11): 0.050000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 361.670000s
%T% Ecpp sieve(19): 0.050000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 361.860000s
%T% Ecpp sieve(163): 0.050000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 362.050000s
%T% Ecpp sieve(20): 0.050000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 362.240000s
%T% Ecpp sieve(52): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 7
% D[[19]]=52
% A[[19]]=-896723639405989255208138863846890474189945973318229970592901906439243637935381780398235496
% B[[19]]=-286774367619847005993079552715976022747435799245448847579385508720421667974928481369771947
% m[[19]]=1270142314376301675741787324820717818537498379391962280926116538554080093014845513101392783306492544770296407417848246692409354462022987457336641212678828411830164039553086213047518
% Factor [P]=2^1
% End of depth 19 at 362.510000 s

% N_20=635071157188150837870893662410358909268749189695981140463058269277040046507422756550696391653246272385148203708924123346204677231011493728668320606339414205915082019776543106523759
% Pmax[598]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 362.590000s
% 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 362.730000s
%T% Ecpp sieve(11): 0.050000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 362.930000s
%T% Ecpp sieve(43): 0.040000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 363.060000s
%T% Ecpp sieve(67): 0.050000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 363.240000s
%T% Ecpp sieve(88): 0.050000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 363.430000s
%T% Ecpp sieve(115): 0.050000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 363.620000s
%T% Ecpp sieve(187): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 7
% D[[20]]=187
% A[[20]]=-1561785990478859086878740812980914494320015668943923612492945624482120765427793362649699167
% B[[20]]=-23252755422552162802662229921434125887964841703536829312610277547169936247612783699889759
% m[[20]]=635071157188150837870893662410358909268749189695981140463058269277040046507422756550696393215032262864007290587664936327119171551027162672591933099285038688035847447569905756222927
% Factor [P]=277^1
% Factor [P]=7^1
% End of depth 20 at 363.890000 s

% N_21=327525093959850870485246860448869989308277044711697339073263676780319776434978213796130166691610243870039861056041741272366772331628242739861749922271809534830246233919497553493
% Pmax[587]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 363.970000s
% 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 364.100000s
%T% Ecpp sieve(4): 0.080000
%T% Ecpp sieve(4): 0.090000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 364.490000s
%T% Ecpp sieve(7): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[21]]=7
% A[[21]]=18611014114668880732695098216811978664372264013073161425727660561869607221794877156640470
% B[[21]]=11733532712839965362550461881642808913983214515614639263916537628752658119250721584596036
% m[[21]]=327525093959850870485246860448869989308277044711697339073263676780319776434978213796130148080596129201159128360943524460388107959364229666700324194611247665223024439042340913024
% Factor [P]=10733^1
% Factor [P]=2^7
% End of depth 21 at 364.700000 s

% N_22=238403968746979868225658352488288157222669748608043926349564192196613086126736913750327660661479293709499272367452835632794381201204979434556627482567816303415156846177051
% Pmax[566]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 364.740000s
% 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 364.850000s
%T% Ecpp sieve(7): 0.030000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 365.000000s
%T% Ecpp sieve(8): 0.040000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 365.150000s
%T% Ecpp sieve(19): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[22]]=19
% A[[22]]=-301382634338685481471757942946079202361312907654205313652888819415316556781306837815
% B[[22]]=-7084174518250775542661605580836688580754732508251716361440819512605550232477337997221
% m[[22]]=238403968746979868225658352488288157222669748608043926349564192196613086126736913750327962044113632394980744125395781711996742514112633639870280371387231619971938153014867
% Factor [P]=11^1
% Factor [P]=7^2
% End of depth 22 at 365.370000 s

% N_23=442307919753209403016063733744504929912188772927725280796965106116165280383556426252927573365702471975845536410752841766227722660691342560056178796636793358018438131753
% Pmax[557]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 365.410000s
% 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 365.520000s
%T% Ecpp sieve(4): 0.050000
%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 365.800000s
%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 365.950000s
%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 366.090000s
%T% Ecpp sieve(19): 0.030000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 366.240000s
%T% Ecpp sieve(43): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 366.340000s
%T% Ecpp sieve(163): 0.020000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 366.480000s
%T% Ecpp sieve(52): 0.020000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 366.620000s
%T% Ecpp sieve(88): 0.030000
% Testing if N is a norm in Q(sqrt(-1012)) where (h, g)=(-4, 4)
% next D is D_51 = 1012 at 366.760000s
%T% Ecpp sieve(1012): 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(-292)) where (h, g)=(4, 2)
% next D is D_78 = 292 at 366.940000s
%T% Ecpp sieve(292): 0.020000
% Testing if N is a norm in Q(sqrt(-568)) where (h, g)=(4, 2)
% next D is D_83 = 568 at 367.070000s
%T% Ecpp sieve(568): 0.030000
% Testing if N is a norm in Q(sqrt(-1027)) 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)
% next D is D_93 = 1387 at 367.290000s
%T% Ecpp sieve(1387): 0.030000
% Testing if N is a norm in Q(sqrt(-1672)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2392)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-23)) where (h, g)=(3, 1)
% next D is D_228 = 23 at 367.520000s
%T% Ecpp sieve(23): 0.030000
% 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)
% next D is D_233 = 139 at 367.790000s
%T% Ecpp sieve(139): 0.020000
% Testing if N is a norm in Q(sqrt(-283)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-331)) 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)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-104)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-152)) where (h, g)=(6, 2)
% next D is D_247 = 152 at 368.210000s
%T% Ecpp sieve(152): 0.030000
% Testing if N is a norm in Q(sqrt(-212)) where (h, g)=(6, 2)
% next D is D_248 = 212 at 368.360000s
%T% Ecpp sieve(212): 0.020000
% Testing if N is a norm in Q(sqrt(-247)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-424)) where (h, g)=(6, 2)
% next D is D_253 = 424 at 368.540000s
%T% Ecpp sieve(424): 0.020000
% Testing if N is a norm in Q(sqrt(-472)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-628)) where (h, g)=(6, 2)
% next D is D_258 = 628 at 368.710000s
%T% Ecpp sieve(628): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 19
% D[[23]]=628
% A[[23]]=-124071493511508641920333830084393979740556389889594465799174899558233348708471606602
% B[[23]]=-52846339313510000331520393050548975019721827100690961261931796981091283133303093244
% m[[23]]=442307919753209403016063733744504929912188772927725280796965106116165280383556426253051644859213980617765870240837235745968279050580937025855353696195026706726909738356
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 23 at 368.920000 s

% N_24=15796711419757478679145133348018033211149599033133045742748753789863045727984158080466130173543356450634495365744186990927438537520747750923405489149822382383103919227
% Pmax[553]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 368.960000s
% 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 369.070000s
%T% Ecpp sieve(7): 0.030000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 369.210000s
%T% Ecpp sieve(8): 0.040000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 369.370000s
%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 369.500000s
%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 369.640000s
%T% Ecpp sieve(67): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 369.740000s
%T% Ecpp sieve(163): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-763)) where (h, g)=(4, 2)
% next D is D_86 = 763 at 369.840000s
%T% Ecpp sieve(763): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-1288)) where (h, g)=(8, 4)
% next D is D_119 = 1288 at 369.940000s
%T% Ecpp sieve(1288): 0.020000
% Testing if N is a norm in Q(sqrt(-4123)) where (h, g)=(8, 4)
% next D is D_148 = 4123 at 370.080000s
%T% Ecpp sieve(4123): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 10
% D[[24]]=4123
% A[[24]]=-187920879731540523912490070393911858263896253919906878663161866276858633725396919760
% B[[24]]=-2600051709403601833276884341120134024831014558833966629738698686493558895370694814
% m[[24]]=15796711419757478679145133348018033211149599033133045742748753789863045727984158080654051053274896974546985436138098849191334791440654629586567355426681016108500838988
% Factor [P]=2^2
% End of depth 24 at 370.290000 s

% N_25=3949177854939369669786283337004508302787399758283261435687188447465761431996039520163512763318724243636746359034524712297833697860163657396641838856670254027125209747
% Pmax[551]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 370.330000s
% 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]=12211^1
% Factor [P]=139^1
% Factor [P]=7^1
% Factor [P]=2^1
% End of depth 25 at 370.450000 s

% N_26=166192961114591963094716267104900375943084683484768523944183076867316717366606992522769294046230629908047390047813977654548230015687827227225912799996357892191
% Pmax[526]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 370.490000s
% 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 370.590000s
%T% Ecpp sieve(7): 0.030000
% Extra square factor: 5
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[26]]=7
% A[[26]]=25169109096301597727847073951503508417313340557730316013121741640345149213577592
% B[[26]]=2114162845357675000611721171371113080642944909740098385815380259453391110506730
% m[[26]]=166192961114591963094716267104900375943084683484768523944183076867316717366606967353660197744632902060973438544305560341207672285371814105484272454847144314600
% Factor [P]=5^2
% Factor [P]=7^2
% Factor [P]=2^3
% End of depth 26 at 370.760000 s

% N_27=16958465419856322764766966031112283259498437090282502443283987435440481363939486464659203851493153271527901892276077585837517580139981031171864536208892277
% Pmax[513]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 370.800000s
% 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 370.890000s
%T% Ecpp sieve(4): 0.040000
%T% Ecpp sieve(4): 0.050000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 371.130000s
%T% Ecpp sieve(7): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[27]]=7
% A[[27]]=37035604209992402584160806256806131617188307819820097544335999372040755142966
% B[[27]]=97440256934497402601638554010266505349843876669537194281918292499280501157444
% m[[27]]=16958465419856322764766966031112283259498437090282502443283987435440481363939449429054993859090569110721645086144460397529697760042436695172492495453749312
% Factor [P]=557^1
% Factor [P]=37^1
% Factor [P]=2^6
% End of depth 27 at 371.270000 s

% N_28=12857296432881510175141144365865855981836240454930569201626100425967175569486821162064354362088900109419462587753272536823791911333061932266009764737
% Pmax[493]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 371.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 371.380000s
%T% Ecpp sieve(4): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[28]]=4
% A[[28]]=36346665903704979116156081910510524490433431582259919705518934839629161872
% B[[28]]=111924199359667624354525027419441989009275584957101925171452514106740235871
% m[[28]]=12857296432881510175141144365865855981836240454930569201626100425967175569450474496160649382972744027508952063262839105241531991627542997426380602866
% Factor [P]=1733^1
% Factor [P]=17^1
% Factor [P]=2^1
% End of depth 28 at 371.520000 s

% N_29=218208757898263979076425517902750347609318089252411140178984087878333654143621643803004809459501443051983165256828334157726010516064339252340053
% Pmax[477]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 371.560000s
% 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 371.640000s
%T% Ecpp sieve(3): 0.030000
% 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 371.820000s
%T% Ecpp sieve(4): 0.040000
%T% Ecpp sieve(4): 0.040000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 372.030000s
%T% Ecpp sieve(51): 0.020000
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 372.130000s
%T% Ecpp sieve(123): 0.020000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 372.230000s
%T% Ecpp sieve(148): 0.020000
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 372.330000s
%T% Ecpp sieve(267): 0.030000
% Testing if N is a norm in Q(sqrt(-372)) where (h, g)=(-4, 4)
% next D is D_38 = 372 at 372.430000s
%T% Ecpp sieve(372): 0.020000
% Testing if N is a norm in Q(sqrt(-68)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-772)) where (h, g)=(4, 2)
% next D is D_87 = 772 at 372.540000s
%T% Ecpp sieve(772): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 9
% D[[29]]=772
% A[[29]]=-677564635897419172085753257746342038041716212513134855530403267243947762
% B[[29]]=-23150252513038104577633062131232586646961188139142887298847489100053062
% m[[29]]=218208757898263979076425517902750347609318089252411140178984087878333654821186279700423981545254700798325203298544546670860866046467606496287816
% Factor [P]=25847^1
% Factor [P]=21313^1
% Factor [P]=719^1
% Factor [P]=593^1
% Factor [P]=2^3
% End of depth 29 at 372.660000 s

% N_30=116129853637481853696163227792951595518149612598041064121498729569345059654424120639983733352647563148145206380656023917990691521
% Pmax[426]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 372.680000s
% 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 372.740000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[30]]=4
% A[[30]]=-17914432735738171413335255064480606130217401910923458729733265650
% B[[30]]=-5991504700545598134466302912305083433695175152178899652250653164
% m[[30]]=116129853637481853696163227792951595518149612598041064121498729587259492390162292053318988417128169278362608291579482647723957172
% Factor [P]=11^2
% Factor [P]=2^2
% End of depth 30 at 372.920000 s

% N_31=239937714127028623339180222712709908095350439252150958928716383444751017335046057961402868630430101814798777461941079850669333
% Pmax[417]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 372.950000s
% 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 373.010000s
%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 373.160000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[31]]=4
% A[[31]]=814292397079007791515238866567300278646245541405611760442421166
% B[[31]]=272341122752072642475741041468412883349780688735404529647756962
% m[[31]]=239937714127028623339180222712709908095350439252150958928716382630458620256038266446164002063129823168553236056329319408248168
% Factor [P]=7253^1
% Factor [P]=2^3
% End of depth 31 at 373.320000 s

% N_32=4135146045205925536660351280723664485305226100443798409773824324942413833173139846376740694594130414458728044538972139257
% Pmax[401]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 373.350000s
% 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 373.400000s
%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 373.540000s
%T% Ecpp sieve(7): 0.020000
% Extra square factor: 31
% 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 373.630000s
%T% Ecpp sieve(8): 0.030000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 373.710000s
%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 373.780000s
%T% Ecpp sieve(67): 0.020000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 373.850000s
%T% Ecpp sieve(232): 0.010000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 373.920000s
%T% Ecpp sieve(427): 0.010000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-56)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-68)) where (h, g)=(4, 2)
% next D is D_70 = 68 at 373.980000s
%T% Ecpp sieve(68): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 9
% D[[32]]=68
% A[[32]]=-1427802378635224540850085077051328600620456022524232827086824
% B[[32]]=-461805353514992623071391922194685368674598302088982596514533
% m[[32]]=4135146045205925536660351280723664485305226100443798409773825752744792468397680696461817745922731034914750568771799226082
% Factor [P]=35393^1
% Factor [P]=20521^1
% Factor [P]=1249^1
% Factor [P]=227^1
% Factor [P]=23^1
% Factor [P]=11^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 32 at 374.060000 s

% N_33=13228630591701298980370036144262626193734045562061560556254347675771643638340900064046535432588526608021
% Pmax[343]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 374.080000s
% 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 374.110000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[33]]=4
% A[[33]]=7160545414690334165905945938610453393388823559996580
% B[[33]]=640529415983845786676537816864103208015785464942089
% m[[33]]=13228630591701298980370036144262626193734045562061553395708932985437477732394961453593142043764966611442
% Factor [P]=2^1
% End of depth 33 at 374.230000 s

% N_34=6614315295850649490185018072131313096867022781030776697854466492718738866197480726796571021882483305721
% Pmax[342]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 374.240000s
% 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 374.270000s
%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 374.380000s
%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 374.430000s
%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 374.480000s
%T% Ecpp sieve(19): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[34]]=19
% A[[34]]=-5069636485621779629795730361511875427769880330422853
% B[[34]]=-199479201798748319597203760274534979527616501594285
% m[[34]]=6614315295850649490185018072131313096867022781030781767490952114498368661927842238671998791762813728575
% Factor [P]=5^2
% End of depth 34 at 374.550000 s

% N_35=264572611834025979607400722885252523874680911241231270699638084579934746477113689546879951670512549143
% Pmax[337]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 374.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 374.600000s
%T% Ecpp sieve(3): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 374.680000s
%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(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 374.740000s
%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 374.790000s
%T% Ecpp sieve(67): 0.010000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 374.830000s
%T% Ecpp sieve(24): 0.010000
% Extra square factor: 19
% 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 374.890000s
%T% Ecpp sieve(51): 0.010000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 374.930000s
%T% Ecpp sieve(91): 0.010000
% Extra square factor: 27
% Factorization completed using trial division only
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 374.980000s
%T% Ecpp sieve(267): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 9
% D[[35]]=267
% A[[35]]=1019436031868768134914129332934229374346245240872692
% B[[35]]=8444714292961743073407632311540253344751972408618
% m[[35]]=264572611834025979607400722885252523874680911241230251263606215811799832347780755317505605425271676452
% Factor [P]=3359^1
% Factor [P]=83^1
% Factor [P]=2^2
% End of depth 35 at 375.030000 s

% N_36=237244851840251132192420222317001728744104950233709698511467318346144176899124412491441447922029
% Pmax[317]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 375.050000s
% 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 375.070000s
%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 375.150000s
%T% Ecpp sieve(4): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[36]]=4
% A[[36]]=81238793543737851713297417005495867690831277254
% B[[36]]=485381207347524546162469746363038661075885971130
% m[[36]]=237244851840251132192420222317001728744104950233628459717923580494430879482118916623750616644776
% Factor [P]=13^1
% Factor [P]=2^3
% End of depth 36 at 375.210000 s

% N_37=2281200498463953194157886753048093545616393752246427497287726735523373841174220352151448236969
% Pmax[311]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 375.230000s
% 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 375.250000s
%T% Ecpp sieve(4): 0.030000
%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 375.340000s
%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 375.390000s
%T% Ecpp sieve(11): 0.010000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 375.430000s
%T% Ecpp sieve(20): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[37]]=20
% A[[37]]=-62799086382829105799449761245947931301221717484
% B[[37]]=-16095149491908704780838713210129124404435384609
% m[[37]]=2281200498463953194157886753048093545616393752309226583670555841322823602420168283452669954454
% Factor [P]=647^1
% Factor [P]=163^1
% Factor [P]=7^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 37 at 375.480000 s

% N_38=171672616994197147291030984676656483530915870977146489243865206871992219377581412661889
% Pmax[287]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 375.500000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[38]]=-1
% Factor [P]=13^1
% Factor [P]=11^1
% Factor [P]=7^1
% Factor [P]=2^7
% End of depth 38 at 375.520000 s

% N_39=1339852467799365847363815752034344433152128113895061885332364564123315897989365421
% Pmax[270]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 375.540000s
% 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 375.550000s
%T% Ecpp sieve(3): 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(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 375.620000s
%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 375.700000s
%T% Ecpp sieve(7): 0.010000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 375.730000s
%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 375.760000s
%T% Ecpp sieve(43): 0.020000
% Extra square factor: 7
% 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 375.810000s
%T% Ecpp sieve(163): 0.010000
% No factor found, sieve only: no PRP test
% 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 375.850000s
%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 375.880000s
%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 375.920000s
%T% Ecpp sieve(35): 0.010000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 375.950000s
%T% Ecpp sieve(148): 0.010000
% Testing if N is a norm in Q(sqrt(-84)) where (h, g)=(-4, 4)
% next D is D_29 = 84 at 375.980000s
%T% Ecpp sieve(84): 0.010000
% Testing if N is a norm in Q(sqrt(-132)) where (h, g)=(-4, 4)
% next D is D_31 = 132 at 376.010000s
%T% Ecpp sieve(132): 0.020000
% Testing if N is a norm in Q(sqrt(-435)) where (h, g)=(-4, 4)
% next D is D_40 = 435 at 376.040000s
%T% Ecpp sieve(435): 0.020000
% Testing if N is a norm in Q(sqrt(-555)) where (h, g)=(-4, 4)
% next D is D_44 = 555 at 376.070000s
%T% Ecpp sieve(555): 0.020000
% Testing if N is a norm in Q(sqrt(-795)) where (h, g)=(-4, 4)
% next D is D_50 = 795 at 376.100000s
%T% Ecpp sieve(795): 0.020000
% Testing if N is a norm in Q(sqrt(-420)) where (h, g)=(-8, 8)
% next D is D_53 = 420 at 376.140000s
%T% Ecpp sieve(420): 0.010000
% Testing if N is a norm in Q(sqrt(-660)) where (h, g)=(-8, 8)
% next D is D_54 = 660 at 376.170000s
%T% Ecpp sieve(660): 0.010000
% Testing if N is a norm in Q(sqrt(-1155)) where (h, g)=(-8, 8)
% next D is D_57 = 1155 at 376.200000s
%T% Ecpp sieve(1155): 0.010000
% Testing if N is a norm in Q(sqrt(-1540)) where (h, g)=(-8, 8)
% next D is D_61 = 1540 at 376.230000s
%T% Ecpp sieve(1540): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 20
% D[[39]]=1540
% A[[39]]=49018992823524169135357136342146136411322
% B[[39]]=1385581647700575768422448858013788453590
% m[[39]]=1339852467799365847363815752034344433152079094902238361163229206986973751852954100
% Factor [P]=83^1
% Factor [P]=23^1
% Factor [P]=5^2
% Factor [P]=2^2
% End of depth 39 at 376.260000 s

% N_40=7018609050808621515787405720452301902315762676282023892945150377092581204049
% Pmax[252]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 376.280000s
% 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 376.290000s
%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 376.360000s
%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 376.400000s
%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 376.430000s
%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 376.460000s
%T% Ecpp sieve(67): 0.010000
% 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 376.480000s
%T% Ecpp sieve(20): 0.010000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 376.510000s
%T% Ecpp sieve(40): 0.010000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 376.540000s
%T% Ecpp sieve(148): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 9
% D[[40]]=148
% A[[40]]=-126038383709246689122054190677461134364
% B[[40]]=-9075048222340490856937818624586887395
% m[[40]]=7018609050808621515787405720452301902441801059991270582067204567770042338414
% Factor [P]=41957^1
% Factor [P]=167^1
% Factor [P]=41^1
% Factor [P]=2^1
% End of depth 40 at 376.570000 s

% N_41=12215642119846989743373659219356315442180805096472364612569981118933
% Pmax[223]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 376.580000s
% 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 376.600000s
%T% Ecpp sieve(4): 0.020000
%T% Ecpp sieve(4): 0.020000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 376.660000s
%T% Ecpp sieve(19): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[41]]=19
% A[[41]]=-6989342331945625167293022674984506
% B[[41]]=-24775036524323164334590420908772
% m[[41]]=12215642119846989743373659219356322431523137042097531905592656103440
% Factor [P]=23^1
% Factor [P]=5^1
% Factor [P]=2^4
% End of depth 41 at 376.690000 s

% N_42=6638935934699450947485684358345827408436487522879093426952530491
% Pmax[213]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 376.710000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[42]]=-1
% Factor [P]=20173^1
% Factor [P]=467^1
% Factor [P]=7^1
% Factor [P]=5^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 42 at 376.720000 s

% N_43=3355767115672766426172597729318072178478879989952463059
% Pmax[182]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 376.730000s
% 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 376.740000s
%T% Ecpp sieve(8): 0.010000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 376.760000s
%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 376.780000s
%T% Ecpp sieve(67): 0.010000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 376.790000s
%T% Ecpp sieve(40): 0.010000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 376.810000s
%T% Ecpp sieve(403): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[43]]=403
% A[[43]]=-1792802365815262373533140113
% B[[43]]=-159161326616637310522235267
% m[[43]]=3355767115672766426172597731110874544294142363485603173
% Factor [P]=17137^1
% Factor [P]=3359^1
% End of depth 43 at 376.830000 s

% N_44=58297108338723493212190815283978902700605391531
% Pmax[156]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 376.840000s
% 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 376.850000s
%T% Ecpp sieve(3): 0.010000
% 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 376.880000s
%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 376.900000s
%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 376.920000s
%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 376.940000s
%T% Ecpp sieve(43): 0.010000
% 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 376.970000s
%T% Ecpp sieve(15): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 7
% D[[44]]=15
% A[[44]]=84225493489012890891908
% B[[44]]=122772010817185369302362
% m[[44]]=58297108338723493212190731058485413687714499624
% Factor [P]=61^1
% Factor [P]=3^1
% Factor [P]=2^3
% End of depth 44 at 376.990000 s

% N_45=39820429193117140172261428318637577655542691
% Pmax[145]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 377.000000s
% 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 377.000000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[45]]=3
% A[[45]]=12504203383198599082931
% B[[45]]=987693360659617770001
% m[[45]]=39820429193117140172248924115254379056459761
% Factor [P]=37^1
% Factor [P]=3^1
% End of depth 45 at 377.020000 s

% N_46=358742605343397659209449766804093505013151
% Pmax[139]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 377.030000s
% 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 377.040000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[46]]=3
% A[[46]]=-1196177257338510964196
% B[[46]]=-37105212570510694086
% m[[46]]=358742605343397659210645944061432015977348
% Factor [P]=2^2
% End of depth 46 at 377.060000 s

% N_47=89685651335849414802661486015358003994337
% Pmax[137]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 377.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 377.070000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[47]]=3
% A[[47]]=-598088628669255482099
% B[[47]]=-18552606285255347043
% m[[47]]=89685651335849414803259574644027259476437
% Factor [P]=1279^1
% Factor [P]=31^1
% End of depth 47 at 377.090000 s

% N_48=2261990247820863446827399799339889013
% Pmax[121]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 377.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 377.100000s
%T% Ecpp sieve(3): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[48]]=3
% A[[48]]=2996216949475617967
% B[[48]]=153454643633958889
% m[[48]]=2261990247820863443831182849864271047
% Factor [P]=13^1
% End of depth 48 at 377.110000 s

% N_49=173999249832374111063937142297251619
% Pmax[118]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 377.110000s
% 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 377.110000s
%T% Ecpp sieve(3): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[49]]=3
% A[[49]]=788967489054901888
% B[[49]]=156553825188974238
% m[[49]]=173999249832374110274969653242349732
% Factor [P]=409^1
% Factor [P]=67^1
% Factor [P]=2^2
% End of depth 49 at 377.120000 s

% N_50=1587410592201347573942357162011
% Pmax[101]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 377.120000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[50]]=1
% Factor [P]=647^1
% Factor [P]=223^1
% Factor [P]=71^1
% Factor [P]=31^1
% Factor [P]=23^1
% Factor [P]=2^2
% End of depth 50 at 377.120000 s

% N_51=54334072792151726881
% Pmax[66]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 377.130000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[51]]=1
% Factor [P]=2999^1
% Factor [P]=11^1
% Factor [P]=7^1
% Factor [P]=2^1
% End of depth 51 at 377.130000 s

% N_52=117645433309267
% Pmax[47]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 377.130000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[52]]=-1
% Factor [P]=19^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 52 at 377.130000 s

% N_53=1031977485169
% Pmax[40]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 377.130000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[53]]=-1
% Factor [P]=7^1
% Factor [P]=3^1
% Factor [P]=2^4
% End of depth 53 at 377.130000 s

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

% N_55=1535680781
% Pmax[31]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 377.130000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[55]]=-1
% Factor [P]=5^1
% Factor [P]=2^2
% End of depth 55 at 377.130000 s

% N_56=76784039
% Pmax[27]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 377.130000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[56]]=-1
% Factor [P]=4271^1
% Factor [P]=101^1
% Factor [P]=89^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 56 at 377.130000 s

% N_57=4271
% Pmax[13]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 377.130000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[57]]=-1
% Factor [P]=61^1
% Factor [P]=7^1
% Factor [P]=5^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 57 at 377.130000 s


% Time for building is 118.760000 s

% Starting phase 2: proving
% Starting proving job for step 0
% D=24628 h=24 g=4 invcode=4 (f^4) g0=4
%T% Factor of degree 2 found: 23.130000
%T% one root in GetInvariant: 23.320000s
% u has been computed
%T% FindJ: 23.710000
% E found
%T% find E: 23.710000
% Entering AEcModProveLarge
%T% ProveStep(24628): 25.490000
% N_0 is prime
% Time for proof[0] is 25.490000 s

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

% Starting proving job for step 2
% 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): 1.550000
% N_2 is prime
% Time for proof[2] is 1.550000 s

% Starting proving job for step 3
% E found
%T% find E: 0.000000
% Suggested twist(3)=1
% Entering AEcModProveLarge
%T% ProveStep(3): 1.560000
% N_3 is prime
% Time for proof[3] is 1.560000 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.340000
% E found
%T% find E: 0.340000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(340): 3.500000
% N_4 is prime
% Time for proof[4] is 3.500000 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): 1.540000
% N_5 is prime
% Time for proof[5] is 1.540000 s

% Starting proving job for step 6
% 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): 1.260000
% N_6 is prime
% Time for proof[6] is 1.260000 s

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

% Starting proving job for step 8
% Entering FindEForD0mod3
% D=291 h=4 g=2 invcode=10 (w3) g0=2
%T% one root in GetInvariant: 0.130000s
% u has been computed
%T% FindW: 0.250000
% E found
%T% find E: 0.260000
% Suggested twist(291)=1
% Entering AEcModProveLarge
%T% ProveStep(291): 1.450000
% N_8 is prime
% Time for proof[8] is 1.450000 s

% Starting proving job for step 9
% 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.120000
% E found
%T% find E: 0.120000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(88): 2.440000
% N_9 is prime
% Time for proof[9] is 2.440000 s

% Starting proving job for step 10
% 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.120000
% E found
%T% find E: 0.120000
% Entering AEcModProveLarge
%T% ProveStep(88): 1.180000
% N_10 is prime
% Time for proof[10] is 1.180000 s

% Starting proving job for step 11
% 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.110000
% E found
%T% find E: 0.120000
% Suggested twist(24)=-1
% Entering AEcModProveLarge
%T% ProveStep(24): 1.140000
% N_11 is prime
% Time for proof[11] is 1.140000 s

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

% Starting proving job for step 13
% 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.750000
% N_13 is prime
% Time for proof[13] is 0.750000 s

% Starting proving job for step 14
% 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.810000
% N_14 is prime
% Time for proof[14] is 0.810000 s

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

% Starting proving job for step 16
% 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.150000
% E found
%T% find E: 0.150000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(340): 1.560000
% N_16 is prime
% Time for proof[16] is 1.560000 s

% Starting proving job for step 17
% 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.070000
% Suggested twist(187)=1
% Entering AEcModProveLarge
%T% ProveStep(187): 0.770000
% N_17 is prime
% Time for proof[17] is 0.770000 s

% Starting proving job for step 18
% 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.640000
% N_18 is prime
% Time for proof[18] is 0.640000 s

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

% Starting proving job for step 20
% 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.060000
% Suggested twist(187)=1
% Entering AEcModProveLarge
%T% ProveStep(187): 0.610000
% N_20 is prime
% Time for proof[20] is 0.610000 s

% Starting proving job for step 21
% 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.530000
% N_21 is prime
% Time for proof[21] is 0.530000 s

% Starting proving job for step 22
% 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.470000
% N_22 is prime
% Time for proof[22] is 0.470000 s

% Starting proving job for step 23
% D=628 h=6 g=2 invcode=4 (f^4) g0=2
%T% Factor of degree 1 found: 0.980000
%T% one root in GetInvariant: 0.980000s
% u has been computed
% Using the 8 | D theorem (even if D=4 mod 8)
% E found
%T% find E: 1.090000
% Suggested twist(628)=1
% Entering AEcModProveLarge
%T% ProveStep(628): 1.550000
% N_23 is prime
% Time for proof[23] is 1.550000 s

% Starting proving job for step 24
% D=4123 h=8 g=4 invcode=11 (Stark's) g0=4
%T% one root in FindG2G3s: 0.050000s
% Using Stark's theorem
% E found
%T% find E: 0.150000
% Suggested twist(4123)=1
% Entering AEcModProveLarge
%T% ProveStep(4123): 0.610000
% N_24 is prime
% Time for proof[24] is 0.610000 s

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

% Starting proving job for step 26
% 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.400000
% N_26 is prime
% Time for proof[26] is 0.400000 s

% Starting proving job for step 27
% 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.370000
% N_27 is prime
% Time for proof[27] is 0.370000 s

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

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

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

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

% Starting proving job for step 32
% D=68 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(68): 0.440000
% N_32 is prime
% Time for proof[32] is 0.440000 s

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

% Starting proving job for step 34
% 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.130000
% N_34 is prime
% Time for proof[34] is 0.130000 s

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

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

% Starting proving job for step 37
% 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.010000
% E found
%T% find E: 0.010000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(20): 0.210000
% N_37 is prime
% Time for proof[37] is 0.210000 s

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

% Starting proving job for step 39
% D=1540 h=-8 g=8 invcode=5 (f^2/sqrt(2)) g0=8
%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(1540): 0.100000
% N_39 is prime
% Time for proof[39] is 0.100000 s

% Starting proving job for step 40
% D=148 h=-2 g=2 invcode=4 (f^4) 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(148): 0.130000
% N_40 is prime
% Time for proof[40] is 0.130000 s

% Starting proving job for step 41
% 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.040000
% N_41 is prime
% Time for proof[41] is 0.040000 s

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

% Starting proving job for step 43
% D=403 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(403)=-1
% Entering AEcModProveLarge
%T% ProveStep(403): 0.030000
% N_43 is prime
% Time for proof[43] is 0.030000 s

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

% Starting proving job for step 45
% 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_45 is prime
% Time for proof[45] is 0.020000 s

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

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

% Starting proving job for step 48
% 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_48 is prime
% Time for proof[48] is 0.010000 s

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

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

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

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

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

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

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

% Starting proving job for step 56
% Using complete factorization theorem
%T% ProveStep(-1): 0.000000
% N_56 is prime
% Time for proof[56] is 0.000000 s

% Starting proving job for step 57
% Using complete factorization theorem
%T% ProveStep(-1): 0.000000
% N_57 is prime
% Time for proof[57] is 0.000000 s
% Time for proving  is 59.720000 s
% Total time is        178.480000 s
This number is prime
%T% PrintCertif: 0.120000
% Time for this number is 179.180000s

Working on 263723766767855795475664510170209772672815267256538507452973165662346045883361251390071227151532386990234932721934396250513820533564121079223345036561298214577116855199460009751418428272494698846386075746969016438432501878437674567040474230417247624448497389212920373850291794001042716377590343689007801543
% Performing a quick factorization
% This number might be prime
% Entering ECPP: delay mode
% Starting phase 1: building the sequence of primes
% N_0=263723766767855795475664510170209772672815267256538507452973165662346045883361251390071227151532386990234932721934396250513820533564121079223345036561298214577116855199460009751418428272494698846386075746969016438432501878437674567040474230417247624448497389212920373850291794001042716377590343689007801543
% Pmax[1015]=1000000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.700000
% next D is D_1 = 0 at 438.460000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=3034351
% Time for rho is 3.000000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.740000
% P-1: entering Step 2 up to b2=10000 at 442.410000
% Time for P-1.II is 0.510000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.730000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.750000
% P-1: entering Step 2 up to b2=10000 at 446.600000
% Time for P-1.II is 0.500000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 447.310000s
%T% Ecpp sieve(11): 0.290000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.670000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 451.180000
% Time for P-1.II is 0.480000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.660000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 455.230000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 455.930000s
%T% Ecpp sieve(19): 0.280000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.800000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.750000
% P-1: entering Step 2 up to b2=10000 at 459.960000
% Time for P-1.II is 0.520000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=1310327
% Time for rho is 2.990000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 464.390000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 465.100000s
%T% Ecpp sieve(43): 0.280000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.810000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 469.160000
% Time for P-1.II is 0.520000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.650000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 473.240000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 473.940000s
%T% Ecpp sieve(67): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.790000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 477.970000
% Time for P-1.II is 0.520000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 482.040000
% Factor[P-1.II]=716156741
% Time for P-1.II is 0.660000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 482.910000s
%T% Ecpp sieve(88): 0.280000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[0]]=88
% A[[0]]=942363691155131546244902813392919549163963170752540639034802660116361379965233473847753744844180280764887072101087855211960100808735817556521124579716462
% B[[0]]=43542787298542629201133257793885401960898524343645060737315302341952606018808966280889370178431819971510873989963971493806561004295846285280698630417591
% m[[0]]=263723766767855795475664510170209772672815267256538507452973165662346045883361251390071227151532386990234932721934396250513820533564121079223345036561297272213425700067913764848605035352945534883215323206329981635772385517057709333566626476672403444167732502140819285995079833900233980560033822564428085082
% Factor [P]=50093^1
% Factor [P]=557^1
% Factor [P]=31^1
% Factor [P]=13^1
% Factor [P]=2^1
% End of depth 0 at 483.900000 s

% N_1=11726866777736867400078504042853782200941402185734112556399655833201732314519379793628721725824366088808587104069061206580217430670529058727043700363918763643311742881883897866856911810997234915153778404380920509497553110274087569323553233849036739656084175690159040039826915557630007537345916647
% Pmax[981]=1000000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.560000
% next D is D_1 = 0 at 484.460000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.740000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 488.120000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 488.970000s
%T% Ecpp sieve(11): 0.290000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=2881499
% Time for rho is 2.900000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.680000
% P-1: entering Step 2 up to b2=10000 at 493.030000
% Time for P-1.II is 0.450000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 497.030000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 497.710000s
%T% Ecpp sieve(19): 0.280000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 498.530000s
%T% Ecpp sieve(67): 0.280000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.730000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 502.440000
% Time for P-1.II is 0.490000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=1911467
% Time for rho is 2.800000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.670000
% P-1: entering Step 2 up to b2=10000 at 506.590000
% Time for P-1.II is 0.460000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 507.250000s
%T% Ecpp sieve(88): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=3195403
% Time for rho is 2.910000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.670000
% P-1: entering Step 2 up to b2=10000 at 511.290000
% Time for P-1.II is 0.470000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.630000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 515.290000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-1507)) where (h, g)=(4, 2)
% 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(-139)) where (h, g)=(3, 1)
% next D is D_233 = 139 at 516.550000s
%T% Ecpp sieve(139): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.700000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 520.410000
% Time for P-1.II is 0.480000
% 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(-331)) 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(-499)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-643)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% next D is D_242 = 883 at 522.410000s
%T% Ecpp sieve(883): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.710000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 526.280000
% Time for P-1.II is 0.480000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.560000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 530.210000
% Time for P-1.II is 0.470000
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% next D is D_243 = 907 at 530.870000s
%T% Ecpp sieve(907): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.700000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 534.720000
% Time for P-1.II is 0.480000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.660000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.730000
% P-1: entering Step 2 up to b2=10000 at 538.780000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-152)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-451)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-472)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-6232)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-376)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-583)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-979)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1528)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2419)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2827)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3403)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3883)) where (h, g)=(8, 2)
% next D is D_614 = 3883 at 541.570000s
%T% Ecpp sieve(3883): 0.250000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.740000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 545.470000
% Time for P-1.II is 0.490000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.580000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 549.430000
% Factor[P-1.II]=111097470889
% Time for P-1.II is 0.630000
% Testing if N is a norm in Q(sqrt(-4747)) where (h, g)=(8, 2)
% next D is D_619 = 4747 at 550.260000s
%T% Ecpp sieve(4747): 0.250000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.660000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.700000
% P-1: entering Step 2 up to b2=10000 at 554.050000
% Time for P-1.II is 0.470000
% Testing if N is a norm in Q(sqrt(-17347)) where (h, g)=(16, 4)
% next D is D_771 = 17347 at 554.890000s
%T% Ecpp sieve(17347): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=6260183
% Time for rho is 2.880000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.680000
% P-1: entering Step 2 up to b2=10000 at 558.900000
% Time for P-1.II is 0.450000
% Testing if N is a norm in Q(sqrt(-47)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-103)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-127)) where (h, g)=(5, 1)
% next D is D_1049 = 127 at 560.110000s
%T% Ecpp sieve(127): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.650000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.730000
% P-1: entering Step 2 up to b2=10000 at 564.120000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-227)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-523)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-571)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-619)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-787)) where (h, g)=(5, 1)
% next D is D_1061 = 787 at 565.760000s
%T% Ecpp sieve(787): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.720000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 569.650000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-947)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1051)) where (h, g)=(5, 1)
% next D is D_1063 = 1051 at 570.690000s
%T% Ecpp sieve(1051): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=1961039
% Time for rho is 2.810000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.680000
% P-1: entering Step 2 up to b2=10000 at 574.810000
% Time for P-1.II is 0.470000
% Testing if N is a norm in Q(sqrt(-1123)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1723)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1747)) where (h, g)=(5, 1)
% next D is D_1066 = 1747 at 575.850000s
%T% Ecpp sieve(1747): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.720000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 579.720000
% Time for P-1.II is 0.490000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.660000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.730000
% P-1: entering Step 2 up to b2=10000 at 583.780000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-2203)) where (h, g)=(5, 1)
% next D is D_1068 = 2203 at 584.460000s
%T% Ecpp sieve(2203): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.680000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 588.290000
% Time for P-1.II is 0.470000
% Testing if N is a norm in Q(sqrt(-2347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-664)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-779)) where (h, g)=(10, 2)
% next D is D_1085 = 779 at 589.510000s
%T% Ecpp sieve(779): 0.260000
% Testing if N is a norm in Q(sqrt(-1688)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-2776)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-3091)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-3928)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-5272)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-6259)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-6403)) where (h, g)=(10, 2)
% next D is D_1144 = 6403 at 591.440000s
%T% Ecpp sieve(6403): 0.250000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.620000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.730000
% P-1: entering Step 2 up to b2=10000 at 595.410000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-7387)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-8227)) where (h, g)=(10, 2)
% next D is D_1152 = 8227 at 596.280000s
%T% Ecpp sieve(8227): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=1591267
% Time for rho is 2.920000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.680000
% P-1: entering Step 2 up to b2=10000 at 600.330000
% Time for P-1.II is 0.460000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.580000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 604.270000
% Factor[P-1.II]=76677773
% Time for P-1.II is 0.650000
% Testing if N is a norm in Q(sqrt(-9307)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-10483)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-5368)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-12331)) where (h, g)=(20, 4)
% next D is D_1288 = 12331 at 605.690000s
%T% Ecpp sieve(12331): 0.250000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.730000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 609.560000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-13528)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-1336)) where (h, g)=(12, 2)
% next D is D_1595 = 1336 at 610.620000s
%T% Ecpp sieve(1336): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=4207277
% Time for rho is 3.370000
% Factorization completed using Rho
% Number of D tried was 21
% D[[1]]=1336
% A[[1]]=5673608974032212306540390889582622164593525924556659733922922363841726720369602531758847361721795094049937155515047337466790662592547602960722345878
% B[[1]]=104958033817430197724090989118781580261622978236479300547883730729065048939168758141961305032230279465711576676499758719168853501640312264339384583
% m[[1]]=11726866777736867400078504042853782200941402185734112556399655833201732314519379793628721725824366088808587104069061206580217430670529058727043700358245154669279530575343506977274289646403708990597118670457998145655826389904485037564705872127241645606147020175111702573036252965082404576623570770
% Factor [p]=4207277^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 1 at 614.440000 s

% N_2=278728183994941797273592968631582427326306354103476252131715022167585645407216586728868142644859515758258538814274914786457307913658384240615573929604472314736575000299326784931781046182690347951825341437181296730779228225393408552959690368075162286822261053291991532124845903064675907401
% Pmax[955]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.440000
% next D is D_1 = 0 at 614.880000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[2]]=-1
% Factor [P]=177319^1
% Factor [P]=101^1
% Factor [P]=7^2
% Factor [P]=5^2
% Factor [P]=2^3
% End of depth 2 at 615.470000 s

% N_3=1588101157736430909470754429128819229269495646994947652446229532692846146338560334563730366824719509089878023465917559602291456899071310934577678644021000254494256135763503980438168870654819253908037368096658091662856216423971754167502692602375838096445285533212580103296758827
% Pmax[918]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.430000
% next D is D_1 = 0 at 615.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 616.360000s
%T% Ecpp sieve(3): 0.340000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 617.770000s
%T% Ecpp sieve(8): 0.370000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 618.600000s
%T% Ecpp sieve(11): 0.220000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 619.280000s
%T% Ecpp sieve(19): 0.220000
% 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 620.100000s
%T% Ecpp sieve(43): 0.220000
% 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 620.900000s
%T% Ecpp sieve(67): 0.220000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 621.580000s
%T% Ecpp sieve(51): 0.220000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 622.260000s
%T% Ecpp sieve(187): 0.210000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 622.930000s
%T% Ecpp sieve(232): 0.200000
% 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 623.730000s
%T% Ecpp sieve(267): 0.200000
% Testing if N is a norm in Q(sqrt(-627)) where (h, g)=(-4, 4)
% next D is D_46 = 627 at 624.400000s
%T% Ecpp sieve(627): 0.210000
% Testing if N is a norm in Q(sqrt(-39)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-136)) where (h, g)=(4, 2)
% next D is D_71 = 136 at 625.230000s
%T% Ecpp sieve(136): 0.200000
% Testing if N is a norm in Q(sqrt(-291)) where (h, g)=(4, 2)
% next D is D_77 = 291 at 625.890000s
%T% Ecpp sieve(291): 0.210000
% Testing if N is a norm in Q(sqrt(-323)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-667)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1027)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1507)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-264)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-456)) where (h, g)=(8, 4)
% next D is D_101 = 456 at 627.370000s
%T% Ecpp sieve(456): 0.200000
% Testing if N is a norm in Q(sqrt(-552)) where (h, g)=(8, 4)
% next D is D_102 = 552 at 628.020000s
%T% Ecpp sieve(552): 0.190000
% Testing if N is a norm in Q(sqrt(-1032)) where (h, g)=(8, 4)
% next D is D_113 = 1032 at 628.690000s
%T% Ecpp sieve(1032): 0.190000
% Testing if N is a norm in Q(sqrt(-1131)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1672)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1768)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2067)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2451)) where (h, g)=(8, 4)
% next D is D_137 = 2451 at 629.990000s
%T% Ecpp sieve(2451): 0.190000
% Testing if N is a norm in Q(sqrt(-5083)) where (h, g)=(8, 4)
% next D is D_150 = 5083 at 630.650000s
%T% Ecpp sieve(5083): 0.200000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-3432)) where (h, g)=(16, 8)
% Testing if N is a norm in Q(sqrt(-4488)) where (h, g)=(16, 8)
% Testing if N is a norm in Q(sqrt(-9867)) where (h, g)=(16, 8)
% Testing if N is a norm in Q(sqrt(-23)) where (h, g)=(3, 1)
% next D is D_228 = 23 at 631.930000s
%T% Ecpp sieve(23): 0.220000
% 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)
% next D is D_234 = 211 at 632.770000s
%T% Ecpp sieve(211): 0.210000
% Testing if N is a norm in Q(sqrt(-499)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-643)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% next D is D_243 = 907 at 633.760000s
%T% Ecpp sieve(907): 0.210000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-87)) where (h, g)=(6, 2)
% next D is D_244 = 87 at 634.560000s
%T% Ecpp sieve(87): 0.200000
% Testing if N is a norm in Q(sqrt(-104)) where (h, g)=(6, 2)
% next D is D_245 = 104 at 635.200000s
%T% Ecpp sieve(104): 0.210000
% Testing if N is a norm in Q(sqrt(-247)) where (h, g)=(6, 2)
% next D is D_250 = 247 at 635.860000s
%T% Ecpp sieve(247): 0.210000
% Testing if N is a norm in Q(sqrt(-411)) where (h, g)=(6, 2)
% next D is D_252 = 411 at 636.520000s
%T% Ecpp sieve(411): 0.200000
% Testing if N is a norm in Q(sqrt(-424)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-843)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1192)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1203)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1219)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1347)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1563)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1843)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1963)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2563)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-3427)) where (h, g)=(6, 2)
% next D is D_292 = 3427 at 638.780000s
%T% Ecpp sieve(3427): 0.190000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1419)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-2472)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-3048)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4147)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4587)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4947)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-5811)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-6963)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-6987)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-7107)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-7912)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-9843)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-5928)) where (h, g)=(24, 8)
% Testing if N is a norm in Q(sqrt(-9384)) where (h, g)=(24, 8)
% Testing if N is a norm in Q(sqrt(-17043)) where (h, g)=(24, 8)
% Testing if N is a norm in Q(sqrt(-24123)) where (h, g)=(24, 8)
% next D is D_503 = 24123 at 641.960000s
%T% Ecpp sieve(24123): 0.220000
% Testing if N is a norm in Q(sqrt(-299)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-579)) where (h, g)=(8, 2)
% next D is D_575 = 579 at 642.790000s
%T% Ecpp sieve(579): 0.200000
% Testing if N is a norm in Q(sqrt(-583)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-712)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-979)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1339)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1651)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1731)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1864)) where (h, g)=(8, 2)
% next D is D_595 = 1864 at 644.420000s
%T% Ecpp sieve(1864): 0.190000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-2248)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2587)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3963)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4843)) where (h, g)=(8, 2)
% next D is D_620 = 4843 at 645.680000s
%T% Ecpp sieve(4843): 0.200000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-663)) where (h, g)=(16, 4)
% next D is D_627 = 663 at 646.470000s
%T% Ecpp sieve(663): 0.200000
% Testing if N is a norm in Q(sqrt(-1608)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-2211)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-3336)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-3784)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-3819)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-4008)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-5896)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-5907)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6123)) where (h, g)=(16, 4)
% next D is D_698 = 6123 at 648.400000s
%T% Ecpp sieve(6123): 0.190000
% Testing if N is a norm in Q(sqrt(-6312)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6952)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-7579)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-7923)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-8643)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-10203)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-10803)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-11523)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-12027)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-13192)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-13288)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-13827)) where (h, g)=(16, 4)
% next D is D_760 = 13827 at 650.820000s
%T% Ecpp sieve(13827): 0.200000
% Testing if N is a norm in Q(sqrt(-14547)) where (h, g)=(16, 4)
% next D is D_763 = 14547 at 651.480000s
%T% Ecpp sieve(14547): 0.200000
% Testing if N is a norm in Q(sqrt(-19987)) where (h, g)=(16, 4)
% next D is D_779 = 19987 at 652.140000s
%T% Ecpp sieve(19987): 0.210000
% Testing if N is a norm in Q(sqrt(-7176)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-7752)) where (h, g)=(32, 8)
% next D is D_794 = 7752 at 652.970000s
%T% Ecpp sieve(7752): 0.200000
% Testing if N is a norm in Q(sqrt(-16008)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-19227)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-21736)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-24168)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-25608)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-37587)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-40227)) where (h, g)=(32, 8)
% next D is D_931 = 40227 at 654.590000s
% D too large for using tabjac
%T% Ecpp sieve(40227): 0.420000
% Testing if N is a norm in Q(sqrt(-76323)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-99528)) where (h, g)=(64, 16)
% next D is D_1026 = 99528 at 655.640000s
% D too large for using tabjac
%T% Ecpp sieve(99528): 0.400000
% Testing if N is a norm in Q(sqrt(-79)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-103)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-127)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-179)) where (h, g)=(5, 1)
% next D is D_1051 = 179 at 656.990000s
%T% Ecpp sieve(179): 0.210000
% Cofactor after sieve is a probable prime
% Number of D tried was 40
% D[[3]]=179
% A[[3]]=-2377947167847002758533746210309043694467620822913202779377375407984687788498842147024558037415306297675615937245622757186905440615772641823
% B[[3]]=-62435302731946805948047946578435802475510599954132299377859721606960276702776737240106883194067893826325423002585800927934521587357919149
% m[[3]]=1588101157736430909470754429128819229269495646994947652446229532692846146338560334563730366824719509089878023465917559602291456899071310936955625811868003013028002346072547674905789693568022033285412776081345880161698363448529791582808990277991775342068042720118020719069400651
% Factor [P]=617^1
% Factor [P]=101^1
% Factor [P]=19^1
% End of depth 3 at 657.920000 s

% N_4=1341275598308842741628122451277398521202287157424262579735553728848887349602634690849527726087009719481697588193740796929022034959685167380156995102179605474748381024754204669086487081389484860754742750842970010009685929621747036656221196951403625894149051766830560486637
% Pmax[898]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.430000
% next D is D_1 = 0 at 658.350000s
% 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 658.790000s
%T% Ecpp sieve(3): 0.330000
% 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 659.990000s
%T% Ecpp sieve(4): 0.380000
%T% Ecpp sieve(4): 0.390000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[4]]=4
% A[[4]]=-2285625100547726059190080239624817007408015201293061707425855926600573575259828245156972866274129233904550806818437310141313707390312788
% B[[4]]=-187763343721270651930242863252330834764207409330516071322731639218351421133417248530685379537897961768931748535909700278551055549399549
% m[[4]]=1341275598308842741628122451277398521202287157424262579735553728848887349602634690849527726087009719481697588193740796929022034959685169665782095649905664664828620649571212077101688374451192286610669351416545269837931086594613310785455101502210444331459193080537950799426
% Factor [P]=55337^1
% Factor [P]=2^1
% End of depth 4 at 661.690000 s

% N_5=12119157149003765488083221454699374028247710911544378803834267568253495397316756337075805754621769516613636339101693233541952355202533292966569344651008047642884694233254532022893257444848765623458710730763731950032808849364921397848230853698343281452366346933678649
% Pmax[881]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.370000
% next D is D_1 = 0 at 662.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 662.480000s
%T% Ecpp sieve(3): 0.280000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 663.700000s
%T% Ecpp sieve(4): 0.340000
%T% Ecpp sieve(4): 0.330000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 665.030000s
%T% Ecpp sieve(8): 0.320000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 665.770000s
%T% Ecpp sieve(19): 0.190000
% 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 666.450000s
%T% Ecpp sieve(15): 0.190000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 667.050000s
%T% Ecpp sieve(20): 0.190000
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 667.640000s
%T% Ecpp sieve(24): 0.190000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 668.240000s
%T% Ecpp sieve(40): 0.180000
% 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 668.950000s
%T% Ecpp sieve(51): 0.190000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 669.540000s
%T% Ecpp sieve(148): 0.170000
% Extra square factor: 17
% Factorization completed using trial division only
% 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 670.350000s
%T% Ecpp sieve(267): 0.180000
% Testing if N is a norm in Q(sqrt(-120)) where (h, g)=(-4, 4)
% next D is D_30 = 120 at 670.950000s
%T% Ecpp sieve(120): 0.180000
% Cofactor after sieve is a probable prime
% Number of D tried was 13
% D[[5]]=120
% A[[5]]=4381394179607850657108817718251808360262616257782505070216141790359612508634994177501532868785791095387025081254566094103064108261314
% B[[5]]=493963676455680892553880456925243179308260115252006878898445004413224543359984743334091032619665884448166525216758822230652843451970
% m[[5]]=12119157149003765488083221454699374028247710911544378803834267568253495397316756337075805754621769516613636339101693233541952355202528911572389736800350938825166442424894269406635474939778549481668351118255096955855307316496135606752843828617088715358263282825417336
% Factor [P]=4583^1
% Factor [P]=2^3
% End of depth 5 at 671.660000 s

% N_6=330546507446098775040454436359900011680332503587834900824630906836501620044642055887950189685298099405783229846762307264399747850821757352508993475898727329946717281935802678557589868529853520665185225787014427118026055981238697543989849133130283530391208892249
% Pmax[866]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.360000
% next D is D_1 = 0 at 672.030000s
% 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 672.430000s
%T% Ecpp sieve(3): 0.290000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[6]]=3
% A[[6]]=-19385053607519015405274102616075760035822380613003146267872885037733652051849767529814902161006488481235302431199097113631235960823
% B[[6]]=17761435062310412936385217636387171315744514485501506472618820762149768088765918636524751333406403198365033943949562336435565855417
% m[[6]]=330546507446098775040454436359900011680332503587834900824630906836501620044642055887950189685298099405783229846762307264399747850841142406116512491304001432562793041971625059170593014797726405702918877838864194647840958142245186025225151564329380644022444853073
% Factor [P]=3^1
% End of depth 6 at 673.570000 s

% N_7=110182169148699591680151478786633337226777501195944966941543635612167206681547351962650063228432699801927743282254102421466582616947047468705504163768000477520931013990541686390197671599242135234306292612954731549280319380748395341741717188109793548007481617691
% Pmax[864]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.350000
% next D is D_1 = 0 at 673.930000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 674.330000s
%T% Ecpp sieve(3): 0.280000
% 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 675.610000s
%T% Ecpp sieve(8): 0.320000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 676.320000s
%T% Ecpp sieve(11): 0.190000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 676.900000s
%T% Ecpp sieve(19): 0.180000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 677.470000s
%T% Ecpp sieve(163): 0.180000
% Extra square factor: 15
% 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 678.160000s
%T% Ecpp sieve(15): 0.190000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 678.740000s
%T% Ecpp sieve(40): 0.180000
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 679.300000s
%T% Ecpp sieve(267): 0.180000
% Testing if N is a norm in Q(sqrt(-627)) where (h, g)=(-4, 4)
% next D is D_46 = 627 at 679.870000s
%T% Ecpp sieve(627): 0.170000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-795)) where (h, g)=(-4, 4)
% next D is D_50 = 795 at 680.300000s
%T% Ecpp sieve(795): 0.180000
% Testing if N is a norm in Q(sqrt(-1320)) where (h, g)=(-8, 8)
% next D is D_58 = 1320 at 680.860000s
%T% Ecpp sieve(1320): 0.160000
% Testing if N is a norm in Q(sqrt(-55)) where (h, g)=(4, 2)
% next D is D_68 = 55 at 681.410000s
%T% Ecpp sieve(55): 0.190000
% Cofactor after sieve is a probable prime
% Number of D tried was 13
% D[[7]]=55
% A[[7]]=12766891919330202721467782610476997181440221844297351109102297505669996735243977072947284437119616077064857329192699873025882970588
% B[[7]]=2247160419547460544715343627596548860390830810565848667079792685699718777703723779140794343046640879740352591918658506695582393442
% m[[7]]=110182169148699591680151478786633337226777501195944966941543635612167206681547351962650063228432699801927743282254102421466582616934280576786173961046532694910454016809101464545900320490139837728636295877710754476333034943628779264676859858917093674981598647104
% Factor [P]=7^1
% Factor [P]=2^6
% End of depth 7 at 682.070000 s

% N_8=245942341849775874286052408005877984881199779455234301208802758062873229199882482059486748277751562057874426969317192905059336198514019144611995448764581908282263430377458626218527501094062137787134589012747219813243381570599953715796562185082798381655354123
% Pmax[856]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.350000
% next D is D_1 = 0 at 682.430000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 682.810000s
%T% Ecpp sieve(3): 0.280000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 683.930000s
%T% Ecpp sieve(7): 0.200000
% Extra square factor: 13
% 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 684.620000s
%T% Ecpp sieve(8): 0.330000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 685.330000s
%T% Ecpp sieve(19): 0.190000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 685.770000s
%T% Ecpp sieve(43): 0.180000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 686.320000s
%T% Ecpp sieve(51): 0.190000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 686.890000s
%T% Ecpp sieve(91): 0.170000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 687.420000s
%T% Ecpp sieve(403): 0.180000
% Extra square factor: 3
% 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 688.090000s
%T% Ecpp sieve(427): 0.170000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-168)) where (h, g)=(-4, 4)
% next D is D_32 = 168 at 688.770000s
%T% Ecpp sieve(168): 0.170000
% Testing if N is a norm in Q(sqrt(-39)) where (h, g)=(4, 2)
% next D is D_67 = 39 at 689.320000s
%T% Ecpp sieve(39): 0.190000
% Extra square factor: 17
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-136)) 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 690.120000s
%T% Ecpp sieve(219): 0.180000
% Cofactor after sieve is a probable prime
% Number of D tried was 13
% D[[8]]=219
% A[[8]]=-355184658332523229824886025293305619634642639639767762172470747644930112175637804015711580697989472077531235568799160704737573841
% B[[8]]=-62578287986534328310152125306565655974716812832315947683670305318345322717866641728615000482808850176521083905776552775259591063
% m[[8]]=245942341849775874286052408005877984881199779455234301208802758062873229199882482059486748277751562057874426969317192905059336198869203802944518678589467933575569050012101265858295263266532885432064701188385023828954962268589425793327797753881959086392927965
% Factor [P]=5^1
% Factor [P]=3^1
% End of depth 8 at 690.900000 s

% N_9=16396156123318391619070160533725198992079985297015620080586850537524881946658832137299116551850104137191628464621146193670622413257946920196301245239297862238371270000806751057219684217768859028804313412559001588596997484572628386221853183592130605759528531
% Pmax[852]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.360000
% next D is D_1 = 0 at 691.260000s
% 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]=3^1
% Factor [P]=2^2
% End of depth 9 at 691.840000 s

% N_10=1366346343609865968255846711143766582673332108084635006715570878127073495554902678108259712654175344765969038718428849472551867771495576683025103769941488519864272500067229254768307018147404919067026117713250132383083123714385698851821098632677550479960711
% Pmax[848]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.350000
% next D is D_1 = 0 at 692.190000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 692.570000s
%T% Ecpp sieve(7): 0.190000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 693.140000s
%T% Ecpp sieve(43): 0.190000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 693.700000s
%T% Ecpp sieve(67): 0.180000
% Extra square factor: 35
% Factorization completed using trial division only
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 694.250000s
%T% Ecpp sieve(163): 0.170000
% Extra square factor: 23
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 694.910000s
%T% Ecpp sieve(35): 0.190000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[10]]=35
% A[[10]]=73462836426474886995928798675252589566288977402345761495533254791347027501289139092697351645638533513268705960564727254482461627
% B[[10]]=1399969781474466868905920829520518461492398811792687592191820337220947785094458665561636960725442471265211261356985341139164143
% m[[10]]=1366346343609865968255846711143766582673332108084635006715570878127073495554902678108259712654175344765969038718428849472551867698032740256550216774012689844611682933778251852422545522614150127719998616424111039685731478075852185583115138067950295997499085
% Factor [P]=11^2
% Factor [P]=5^1
% Factor [P]=3^2
% End of depth 10 at 695.560000 s

% N_11=250935967605117716851395171927229859076828669987995409865118618572465288439835202591048615730794370021298262390896023778246440348582688752350820344171292900755130015386272149205242520222984412804407459398367500401419922511634928481747500104306757758953
% Pmax[836]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.360000
% next D is D_1 = 0 at 695.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 696.270000s
%T% Ecpp sieve(4): 0.320000
%T% Ecpp sieve(4): 0.330000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 697.510000s
%T% Ecpp sieve(8): 0.320000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 698.180000s
%T% Ecpp sieve(19): 0.190000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 698.720000s
%T% Ecpp sieve(232): 0.170000
% Testing if N is a norm in Q(sqrt(-68)) where (h, g)=(4, 2)
% next D is D_70 = 68 at 699.250000s
%T% Ecpp sieve(68): 0.190000
% Testing if N is a norm in Q(sqrt(-136)) where (h, g)=(4, 2)
% next D is D_71 = 136 at 699.780000s
%T% Ecpp sieve(136): 0.170000
% Testing if N is a norm in Q(sqrt(-184)) where (h, g)=(4, 2)
% next D is D_73 = 184 at 700.320000s
%T% Ecpp sieve(184): 0.180000
% Testing if N is a norm in Q(sqrt(-292)) where (h, g)=(4, 2)
% next D is D_78 = 292 at 700.840000s
%T% Ecpp sieve(292): 0.180000
% Testing if N is a norm in Q(sqrt(-323)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-328)) where (h, g)=(4, 2)
% next D is D_80 = 328 at 701.500000s
%T% Ecpp sieve(328): 0.170000
% Testing if N is a norm in Q(sqrt(-667)) where (h, g)=(4, 2)
% next D is D_84 = 667 at 702.010000s
%T% Ecpp sieve(667): 0.170000
% Testing if N is a norm in Q(sqrt(-1387)) where (h, g)=(4, 2)
% next D is D_93 = 1387 at 702.540000s
%T% Ecpp sieve(1387): 0.170000
% Testing if N is a norm in Q(sqrt(-1411)) where (h, g)=(4, 2)
% next D is D_94 = 1411 at 703.060000s
%T% Ecpp sieve(1411): 0.170000
% Testing if N is a norm in Q(sqrt(-2788)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-23)) where (h, g)=(3, 1)
% next D is D_228 = 23 at 703.720000s
%T% Ecpp sieve(23): 0.180000
% Testing if N is a norm in Q(sqrt(-31)) where (h, g)=(3, 1)
% next D is D_229 = 31 at 704.260000s
%T% Ecpp sieve(31): 0.190000
% Cofactor after sieve is a probable prime
% Number of D tried was 15
% D[[11]]=31
% A[[11]]=-841238527904011824384186444387263168802062028046212796896852922729655155411720503455483577177498925997043284742155071162487194
% B[[11]]=-97726017533279758585129070350416362925281300928769308225316261419255371525806126617959775059603639757163877165057879336423536
% m[[11]]=250935967605117716851395171927229859076828669987995409865118618572465288439835202591048615730794370021298262390896023778246441189821216656362644728357737288018298817448300195418039417075907142459562871118870955884997100010560925525032242259377920246148
% Factor [P]=307^1
% Factor [P]=67^1
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 11 at 704.990000 s

% N_12=435704158833191621322300500627209217541009476792391132746780207685048388420569099461479160266827281729958158933513025458294453494199344117643480008677651681133013649959196911124992910753191596333530470817511365725462554625478225771501222816891439
% Pmax[816]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.290000
% next D is D_1 = 0 at 705.290000s
% 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 705.630000s
%T% Ecpp sieve(3): 0.240000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 706.630000s
%T% Ecpp sieve(43): 0.150000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 707.100000s
%T% Ecpp sieve(67): 0.160000
% 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 707.690000s
%T% Ecpp sieve(163): 0.140000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[12]]=163
% A[[12]]=-998807980363777178578992921847412661893358406515542018399820684740039314987285172835995166058798029065449300493604489718932
% B[[12]]=-67614898968661670815674374788890190979639895632802242483825959907543768669912341835544607922451292808288157997219133840342
% m[[12]]=435704158833191621322300500627209217541009476792391132746780207685048388420569099461479160266827281729958158933513025458295452302179707894822059001599499093794907008365712453143392731437931635648517755990347360891521352654543675071994827306610372
% Factor [P]=19777^1
% Factor [P]=2^2
% End of depth 12 at 708.350000 s

% N_13=5507712985199873860068520258724897830067875269155978317575721895194523795577806283327592155873328635914928438761099072891432627574704301648658277312022792812293409116217227753746684677124078925627215401607262993521784808799914990544506589809
% Pmax[800]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.290000
% next D is D_1 = 0 at 708.640000s
% 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 708.940000s
%T% Ecpp sieve(4): 0.280000
%T% Ecpp sieve(4): 0.270000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 709.990000s
%T% Ecpp sieve(7): 0.160000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 710.460000s
%T% Ecpp sieve(8): 0.280000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 711.040000s
%T% Ecpp sieve(19): 0.160000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 711.500000s
%T% Ecpp sieve(67): 0.160000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 711.970000s
%T% Ecpp sieve(163): 0.150000
% 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(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 712.230000s
%T% Ecpp sieve(20): 0.160000
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[13]]=20
% A[[13]]=3828696613903505725184553745831408343479424478855711760804957711371706009907449903111755179482758404007063120866720503644
% B[[13]]=607121659121272210718609859562117628790482748216752453142999890616033018573187055747544816075125553086538086041160209405
% m[[13]]=5507712985199873860068520258724897830067875269155978317575721895194523795577806283327592155873328635914928438761099072887603930960800795923473723566191384468813984637361515992941726965752372915719765498495507814039026404792851869677786086166
% Factor [P]=17327^1
% Factor [P]=43^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 13 at 712.760000 s

% N_14=1232049676737849621276763526459555622530207877644912814202622759567007219448655050465127946095091237700655480728222045552333730831167022101428322326671101307770769694777008413392041494086249966047470273909453457287172102864251354291301
% Pmax[778]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.290000
% next D is D_1 = 0 at 713.050000s
% 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]=33347^1
% Factor [P]=5^2
% Factor [P]=2^2
% End of depth 14 at 713.380000 s

% N_15=369463423017917540191550522223754947230697777204819868114859735378596941088750127587227620504120681830646079325942977045111623483721780700341356741737218132896743243703184218488032354960341249901781351818590415115954089682505579
% Pmax[756]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.230000
% next D is D_1 = 0 at 713.620000s
% 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 713.890000s
%T% Ecpp sieve(8): 0.210000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 714.380000s
%T% Ecpp sieve(67): 0.120000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 714.770000s
%T% Ecpp sieve(163): 0.120000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 715.150000s
%T% Ecpp sieve(40): 0.120000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 715.540000s
%T% Ecpp sieve(232): 0.120000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 715.920000s
%T% Ecpp sieve(235): 0.120000
% Testing if N is a norm in Q(sqrt(-136)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-155)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-328)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1003)) where (h, g)=(4, 2)
% next D is D_89 = 1003 at 716.590000s
%T% Ecpp sieve(1003): 0.120000
% Testing if N is a norm in Q(sqrt(-1411)) 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 717.070000s
%T% Ecpp sieve(1555): 0.110000
% Testing if N is a norm in Q(sqrt(-31)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-59)) where (h, g)=(3, 1)
% next D is D_230 = 59 at 717.550000s
%T% Ecpp sieve(59): 0.130000
% Testing if N is a norm in Q(sqrt(-83)) where (h, g)=(3, 1)
% next D is D_231 = 83 at 717.960000s
%T% Ecpp sieve(83): 0.120000
% Testing if N is a norm in Q(sqrt(-107)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-211)) where (h, g)=(3, 1)
% next D is D_234 = 211 at 718.450000s
%T% Ecpp sieve(211): 0.120000
% Testing if N is a norm in Q(sqrt(-331)) 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 718.930000s
%T% Ecpp sieve(547): 0.110000
% 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(-643)) where (h, g)=(3, 1)
% next D is D_241 = 643 at 719.130000s
%T% Ecpp sieve(643): 0.110000
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% next D is D_243 = 907 at 719.520000s
%T% Ecpp sieve(907): 0.120000
% Testing if N is a norm in Q(sqrt(-808)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-835)) where (h, g)=(6, 2)
% next D is D_262 = 835 at 720.010000s
%T% Ecpp sieve(835): 0.120000
% Testing if N is a norm in Q(sqrt(-1147)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1363)) where (h, g)=(6, 2)
% next D is D_276 = 1363 at 720.490000s
%T% Ecpp sieve(1363): 0.120000
% Testing if N is a norm in Q(sqrt(-1915)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2515)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-3235)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-680)) where (h, g)=(12, 4)
% next D is D_299 = 680 at 721.160000s
%T% Ecpp sieve(680): 0.110000
% 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)
% Testing if N is a norm in Q(sqrt(-2635)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-2920)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4360)) where (h, g)=(12, 4)
% next D is D_370 = 4360 at 721.910000s
%T% Ecpp sieve(4360): 0.110000
% Testing if N is a norm in Q(sqrt(-5032)) where (h, g)=(12, 4)
% next D is D_378 = 5032 at 722.300000s
%T% Ecpp sieve(5032): 0.110000
% Testing if N is a norm in Q(sqrt(-10795)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-10915)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-15283)) where (h, g)=(12, 4)
% next D is D_412 = 15283 at 722.880000s
%T% Ecpp sieve(15283): 0.120000
% Testing if N is a norm in Q(sqrt(-295)) where (h, g)=(8, 2)
% next D is D_568 = 295 at 723.270000s
%T% Ecpp sieve(295): 0.120000
% Testing if N is a norm in Q(sqrt(-904)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1795)) where (h, g)=(8, 2)
% next D is D_592 = 1795 at 723.750000s
%T% Ecpp sieve(1795): 0.110000
% Testing if N is a norm in Q(sqrt(-1864)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2248)) where (h, g)=(8, 2)
% next D is D_599 = 2248 at 724.220000s
%T% Ecpp sieve(2248): 0.110000
% Testing if N is a norm in Q(sqrt(-2395)) where (h, g)=(8, 2)
% next D is D_603 = 2395 at 724.610000s
%T% Ecpp sieve(2395): 0.110000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-2419)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3403)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3595)) where (h, g)=(8, 2)
% next D is D_612 = 3595 at 725.090000s
%T% Ecpp sieve(3595): 0.120000
% Testing if N is a norm in Q(sqrt(-4387)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4747)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4843)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4867)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-5587)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1640)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6355)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-9640)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-12835)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-17515)) where (h, g)=(16, 4)
% next D is D_773 = 17515 at 726.330000s
%T% Ecpp sieve(17515): 0.120000
% Testing if N is a norm in Q(sqrt(-19720)) where (h, g)=(32, 8)
% next D is D_860 = 19720 at 726.730000s
% D too large for using tabjac
%T% Ecpp sieve(19720): 0.240000
% Testing if N is a norm in Q(sqrt(-47)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-127)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-179)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-571)) where (h, g)=(5, 1)
% next D is D_1056 = 571 at 727.610000s
%T% Ecpp sieve(571): 0.120000
% Testing if N is a norm in Q(sqrt(-683)) where (h, g)=(5, 1)
% next D is D_1058 = 683 at 728.010000s
%T% Ecpp sieve(683): 0.110000
% Testing if N is a norm in Q(sqrt(-787)) where (h, g)=(5, 1)
% next D is D_1061 = 787 at 728.380000s
%T% Ecpp sieve(787): 0.120000
% Testing if N is a norm in Q(sqrt(-2203)) where (h, g)=(5, 1)
% next D is D_1068 = 2203 at 728.770000s
%T% Ecpp sieve(2203): 0.120000
% Testing if N is a norm in Q(sqrt(-2683)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-296)) where (h, g)=(10, 2)
% next D is D_1074 = 296 at 729.250000s
%T% Ecpp sieve(296): 0.120000
% Testing if N is a norm in Q(sqrt(-415)) where (h, g)=(10, 2)
% next D is D_1078 = 415 at 729.630000s
%T% Ecpp sieve(415): 0.120000
% Testing if N is a norm in Q(sqrt(-488)) where (h, g)=(10, 2)
% next D is D_1079 = 488 at 730.010000s
%T% Ecpp sieve(488): 0.110000
% Testing if N is a norm in Q(sqrt(-635)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-872)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1115)) where (h, g)=(10, 2)
% next D is D_1092 = 1115 at 730.550000s
%T% Ecpp sieve(1115): 0.120000
% Testing if N is a norm in Q(sqrt(-1576)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1819)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1891)) where (h, g)=(10, 2)
% next D is D_1104 = 1891 at 731.120000s
%T% Ecpp sieve(1891): 0.110000
% Testing if N is a norm in Q(sqrt(-2152)) where (h, g)=(10, 2)
% next D is D_1106 = 2152 at 731.510000s
%T% Ecpp sieve(2152): 0.110000
% Testing if N is a norm in Q(sqrt(-3635)) where (h, g)=(10, 2)
% next D is D_1121 = 3635 at 731.890000s
%T% Ecpp sieve(3635): 0.120000
% Cofactor after sieve is a probable prime
% Number of D tried was 39
% D[[15]]=3635
% A[[15]]=-960098512788002203911278116481673994167879985730888038432663699730985030059131620612922830609697486033951547554896
% B[[15]]=-12368310861488724444735992706022739249648470401669574851202030592009697755812906865099215361441649129620721933670
% m[[15]]=369463423017917540191550522223754947230697777204819868114859735378596941088750127587227620504120681830646079325943937143624411485925691978457838415731386012882474131741616882187763339990400381522394274649200112601988041230060476
% Factor [P]=83^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 15 at 732.440000 s

% N_16=370947211865379056417219399823047135773792949000823160757891300580920623583082457416895201309358114287797268399542105565887963339282823271544014473625889571167142702551824178903376847379920061769472163302409751608421728142631
% Pmax[747]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.230000
% next D is D_1 = 0 at 732.670000s
% 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 732.930000s
%T% Ecpp sieve(11): 0.130000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 733.320000s
%T% Ecpp sieve(43): 0.130000
% 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(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 733.540000s
%T% Ecpp sieve(67): 0.120000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 733.920000s
%T% Ecpp sieve(163): 0.120000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 734.220000s
%T% Ecpp sieve(88): 0.120000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 734.600000s
%T% Ecpp sieve(115): 0.120000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 734.980000s
%T% Ecpp sieve(187): 0.120000
% Extra square factor: 65
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-715)) where (h, g)=(-4, 4)
% next D is D_48 = 715 at 735.440000s
%T% Ecpp sieve(715): 0.110000
% Testing if N is a norm in Q(sqrt(-55)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-184)) where (h, g)=(4, 2)
% next D is D_73 = 184 at 735.910000s
%T% Ecpp sieve(184): 0.110000
% Testing if N is a norm in Q(sqrt(-955)) where (h, g)=(4, 2)
% next D is D_88 = 955 at 736.280000s
%T% Ecpp sieve(955): 0.110000
% Testing if N is a norm in Q(sqrt(-1243)) where (h, g)=(4, 2)
% next D is D_92 = 1243 at 736.650000s
%T% Ecpp sieve(1243): 0.110000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1411)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1507)) where (h, g)=(4, 2)
% next D is D_95 = 1507 at 737.180000s
%T% Ecpp sieve(1507): 0.120000
% 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(-2392)) where (h, g)=(8, 4)
% next D is D_136 = 2392 at 737.560000s
%T% Ecpp sieve(2392): 0.110000
% Testing if N is a norm in Q(sqrt(-3355)) where (h, g)=(8, 4)
% next D is D_146 = 3355 at 737.930000s
%T% Ecpp sieve(3355): 0.120000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-5083)) where (h, g)=(8, 4)
% next D is D_150 = 5083 at 738.220000s
%T% Ecpp sieve(5083): 0.120000
% Testing if N is a norm in Q(sqrt(-7480)) 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(-83)) 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(-331)) 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(-451)) where (h, g)=(6, 2)
% next D is D_255 = 451 at 739.150000s
%T% Ecpp sieve(451): 0.120000
% Testing if N is a norm in Q(sqrt(-835)) where (h, g)=(6, 2)
% next D is D_262 = 835 at 739.530000s
%T% Ecpp sieve(835): 0.120000
% Testing if N is a norm in Q(sqrt(-1219)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1915)) where (h, g)=(6, 2)
% next D is D_282 = 1915 at 740.010000s
%T% Ecpp sieve(1915): 0.110000
% Cofactor after sieve is a probable prime
% Number of D tried was 19
% D[[16]]=1915
% A[[16]]=37933064864678509173334832791111857557757693262579792984866877153069378030919734688295377950357093300965070464703
% B[[16]]=153073707793175256453075460581778969853274789557368411572454643962886503145540240494530274488577412152316333681
% m[[16]]=370947211865379056417219399823047135773792949000823160757891300580920623583082457416895201309358114287797268399504172501023284830109488438752902616068131877904562909566957301750307469349000327081176785352052658307456657677929
% Factor [P]=107^1
% End of depth 16 at 740.450000 s

% N_17=3466796372573636041282424297411655474521429429914235147270012154961874986757779975858833657096804806428011854200973574775918549814107368586475725383814316615930494481934180390189789433168227355898848461234136993527632314747
% Pmax[740]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.230000
% next D is D_1 = 0 at 740.690000s
% 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 740.930000s
%T% Ecpp sieve(3): 0.190000
% Extra square factor: 293
% 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 741.780000s
%T% Ecpp sieve(8): 0.210000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 742.250000s
%T% Ecpp sieve(11): 0.130000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 742.640000s
%T% Ecpp sieve(163): 0.110000
% Extra square factor: 177
% 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 743.090000s
%T% Ecpp sieve(51): 0.120000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 743.390000s
%T% Ecpp sieve(123): 0.120000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 743.680000s
%T% Ecpp sieve(187): 0.120000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 744.060000s
%T% Ecpp sieve(232): 0.110000
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 744.430000s
%T% Ecpp sieve(267): 0.120000
% Testing if N is a norm in Q(sqrt(-136)) where (h, g)=(4, 2)
% next D is D_71 = 136 at 744.800000s
%T% Ecpp sieve(136): 0.120000
% Extra square factor: 9
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-219)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-291)) where (h, g)=(4, 2)
% next D is D_77 = 291 at 745.340000s
%T% Ecpp sieve(291): 0.120000
% Testing if N is a norm in Q(sqrt(-328)) where (h, g)=(4, 2)
% next D is D_80 = 328 at 745.710000s
%T% Ecpp sieve(328): 0.110000
% Testing if N is a norm in Q(sqrt(-667)) where (h, g)=(4, 2)
% next D is D_84 = 667 at 746.080000s
%T% Ecpp sieve(667): 0.110000
% 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)
% next D is D_89 = 1003 at 746.530000s
%T% Ecpp sieve(1003): 0.120000
% Testing if N is a norm in Q(sqrt(-1507)) where (h, g)=(4, 2)
% next D is D_95 = 1507 at 746.900000s
%T% Ecpp sieve(1507): 0.110000
% Testing if N is a norm in Q(sqrt(-264)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-552)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1128)) where (h, g)=(8, 4)
% next D is D_115 = 1128 at 747.440000s
%T% Ecpp sieve(1128): 0.110000
% Testing if N is a norm in Q(sqrt(-1947)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2139)) where (h, g)=(8, 4)
% next D is D_133 = 2139 at 747.900000s
%T% Ecpp sieve(2139): 0.110000
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-3243)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-4488)) 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(-31)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-59)) where (h, g)=(3, 1)
% next D is D_230 = 59 at 748.710000s
%T% Ecpp sieve(59): 0.130000
% Testing if N is a norm in Q(sqrt(-139)) 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(-331)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-379)) where (h, g)=(3, 1)
% next D is D_238 = 379 at 749.360000s
%T% Ecpp sieve(379): 0.120000
% Extra square factor: 9
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-499)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-87)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-411)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-424)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-451)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-771)) where (h, g)=(6, 2)
% next D is D_260 = 771 at 750.360000s
%T% Ecpp sieve(771): 0.120000
% Testing if N is a norm in Q(sqrt(-808)) where (h, g)=(6, 2)
% next D is D_261 = 808 at 750.740000s
%T% Ecpp sieve(808): 0.110000
% Testing if N is a norm in Q(sqrt(-843)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1059)) where (h, g)=(6, 2)
% next D is D_266 = 1059 at 751.200000s
%T% Ecpp sieve(1059): 0.120000
% Testing if N is a norm in Q(sqrt(-1147)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1203)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1219)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1347)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1363)) where (h, g)=(6, 2)
% next D is D_276 = 1363 at 751.930000s
%T% Ecpp sieve(1363): 0.120000
% Testing if N is a norm in Q(sqrt(-2923)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-744)) where (h, g)=(12, 4)
% next D is D_302 = 744 at 752.400000s
%T% Ecpp sieve(744): 0.110000
% Testing if N is a norm in Q(sqrt(-2091)) where (h, g)=(12, 4)
% next D is D_326 = 2091 at 752.760000s
%T% Ecpp sieve(2091): 0.110000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-2728)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-3723)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4587)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4947)) where (h, g)=(12, 4)
% next D is D_377 = 4947 at 753.310000s
%T% Ecpp sieve(4947): 0.120000
% Testing if N is a norm in Q(sqrt(-5032)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-5307)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-6987)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-8787)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-11803)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-15283)) where (h, g)=(12, 4)
% next D is D_412 = 15283 at 754.140000s
%T% Ecpp sieve(15283): 0.130000
% Testing if N is a norm in Q(sqrt(-9384)) where (h, g)=(24, 8)
% next D is D_449 = 9384 at 754.510000s
%T% Ecpp sieve(9384): 0.120000
% Testing if N is a norm in Q(sqrt(-111)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-183)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-583)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-712)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-979)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1299)) where (h, g)=(8, 2)
% next D is D_586 = 1299 at 755.330000s
%T% Ecpp sieve(1299): 0.120000
% Testing if N is a norm in Q(sqrt(-2248)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2307)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2323)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2419)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2827)) where (h, g)=(8, 2)
% next D is D_607 = 2827 at 756.060000s
%T% Ecpp sieve(2827): 0.110000
% Testing if N is a norm in Q(sqrt(-3883)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4267)) where (h, g)=(8, 2)
% next D is D_617 = 4267 at 756.520000s
%T% Ecpp sieve(4267): 0.110000
% Testing if N is a norm in Q(sqrt(-4747)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4843)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4867)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1023)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-1416)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-3336)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-4008)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-5883)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6312)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6771)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6792)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6952)) where (h, g)=(16, 4)
% next D is D_710 = 6952 at 757.880000s
%T% Ecpp sieve(6952): 0.120000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-7347)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-7491)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-7843)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-8283)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-9483)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-11523)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-13192)) where (h, g)=(16, 4)
% next D is D_756 = 13192 at 758.890000s
% D too large for using tabjac
%T% Ecpp sieve(13192): 0.220000
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-13827)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-16027)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-17427)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-19947)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-19987)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-9768)) where (h, g)=(32, 8)
% next D is D_806 = 9768 at 759.900000s
%T% Ecpp sieve(9768): 0.120000
% Testing if N is a norm in Q(sqrt(-10824)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-16008)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-19272)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-22632)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-25608)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-28083)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-29667)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-33672)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-36363)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-40227)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-54723)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-57387)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-47)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-79)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-227)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-347)) where (h, g)=(5, 1)
% next D is D_1053 = 347 at 761.630000s
%T% Ecpp sieve(347): 0.120000
% Testing if N is a norm in Q(sqrt(-523)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-619)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-683)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-691)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-739)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-787)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-947)) where (h, g)=(5, 1)
% next D is D_1062 = 947 at 762.540000s
%T% Ecpp sieve(947): 0.120000
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1051)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1123)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1747)) where (h, g)=(5, 1)
% next D is D_1066 = 1747 at 763.180000s
%T% Ecpp sieve(1747): 0.110000
% Extra square factor: 33
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 38
% D[[17]]=1747
% A[[17]]=-3418630733564229997889974563307467829719835352224927941742589686733783944535819557821713226369092852232402035011
% B[[17]]=-35326179808539685379546149861445394405467486331470513112981257033671724752703204719675843280043790620638334969
% m[[17]]=3466796372573636041282424297411655474521429429914235147270012154961874986757779975858833657096804806428011854204392205509482779811997343149783193213534151968155422423676770076923573377704046913720561687603229845760034349759
% Factor [P]=3^2
% Factor [P]=11^2
% Factor [P]=16493^1
% Factor [P]=2939^1
% Factor [P]=1667^1
% Factor [P]=439^1
% Factor [P]=67^1
% End of depth 17 at 763.720000 s

% N_18=1339449319393123072603500074582629358000427827135551677091405219225085368004647966775827583544354128999753265825155146530994604235872333032620020556414732019844244450902597635473979831022902134414386162543
% Pmax[679]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 763.870000s
% 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 764.070000s
%T% Ecpp sieve(7): 0.090000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 764.360000s
%T% Ecpp sieve(19): 0.090000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 764.650000s
%T% Ecpp sieve(43): 0.080000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 764.930000s
%T% Ecpp sieve(427): 0.080000
% Testing if N is a norm in Q(sqrt(-56)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-184)) where (h, g)=(4, 2)
% next D is D_73 = 184 at 765.290000s
%T% Ecpp sieve(184): 0.080000
% 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)
% next D is D_76 = 259 at 765.650000s
%T% Ecpp sieve(259): 0.080000
% Testing if N is a norm in Q(sqrt(-667)) where (h, g)=(4, 2)
% next D is D_84 = 667 at 765.930000s
%T% Ecpp sieve(667): 0.070000
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[18]]=667
% A[[18]]=439361594248227214140428272796699581559976825795465874915899146495456593333493243748960096686110665313
% B[[18]]=87995831534365935627895972460703232431479084821475385323189266757265864835913333000108028736407493103
% m[[18]]=1339449319393123072603500074582629358000427827135551677091405219225085368004647966775827583544354128999313904230906919316854175963075633451060043730619266144928345304407141042140486587273942037728275497231
% Factor [P]=71^1
% Factor [P]=13^1
% End of depth 18 at 766.240000 s

% N_19=1451191028594932906395991413415633107259401762877087407466311180092183497296476670396346244360080313108682453121242599476548402993581401355427999708146550536217058834677292570033029888704162554418499997
% Pmax[669]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 766.390000s
% 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 766.580000s
%T% Ecpp sieve(3): 0.130000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 767.150000s
%T% Ecpp sieve(4): 0.150000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[19]]=4
% A[[19]]=13137806680380237054570205531204346008178682452523523608105527100968752377120952649133069213104370492
% B[[19]]=37523866238730944638616572116217858650949500375892938694116706025074904391740832459530911044352418309
% m[[19]]=1451191028594932906395991413415633107259401762877087407466311180092183497296476670396346244360080313095544646440862362421978197462377055347249317255623026928111531733708540192912077239571093341314129506
% Factor [P]=1409^1
% Factor [P]=97^1
% Factor [P]=29^1
% Factor [P]=2^1
% End of depth 19 at 767.530000 s

% N_20=183068601521695618612963109962141339025340595596926594167037908515616748622054184502847628048533702907738839828473343550939506183823237713784161548395405763127991091461010535959865599109464314309
% Pmax[646]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 767.680000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[20]]=-1
% Factor [P]=631^1
% Factor [P]=37^1
% Factor [P]=3^5
% Factor [P]=2^2
% End of depth 20 at 767.880000 s

% N_21=8067082821582615306491696396261613745517863152681057275229002048166177650711734119347716621734152840450013309156724233960122571233993181144877997754551776778010229434444593209156753121737
% Pmax[621]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 767.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 768.110000s
%T% Ecpp sieve(3): 0.080000
% 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 768.500000s
%T% Ecpp sieve(4): 0.080000
%T% Ecpp sieve(4): 0.080000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 768.920000s
%T% Ecpp sieve(8): 0.080000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 769.150000s
%T% Ecpp sieve(43): 0.050000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 769.350000s
%T% Ecpp sieve(163): 0.050000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 769.590000s
%T% Ecpp sieve(24): 0.050000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 769.800000s
%T% Ecpp sieve(148): 0.040000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 770.000000s
%T% Ecpp sieve(232): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 9
% D[[21]]=232
% A[[21]]=5124700811873600073588774022873710573468426188919999478408008217548444984835530166852953600610
% B[[21]]=160894226272724953802016580844131121324351395136328433101282133866667566160925069322466206258
% m[[21]]=8067082821582615306491696396261613745517863152681057275229002048166177650711734119347716621729028139638139709083135459937248860660524754955957998276143768560461784449609063042303799521128
% Factor [P]=2^3
% End of depth 21 at 770.240000 s

% N_22=1008385352697826913311462049532701718189732894085132159403625256020772206338966764918464577716128517454767463635391932492156107582565594369494749784517971070057723056201132880287974940141
% Pmax[618]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 770.320000s
% 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 770.480000s
%T% Ecpp sieve(4): 0.080000
%T% Ecpp sieve(4): 0.080000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 770.860000s
%T% Ecpp sieve(7): 0.060000
% 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 771.120000s
%T% Ecpp sieve(11): 0.050000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 771.320000s
%T% Ecpp sieve(43): 0.040000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 771.520000s
%T% Ecpp sieve(20): 0.050000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 771.720000s
%T% Ecpp sieve(35): 0.050000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 771.920000s
%T% Ecpp sieve(148): 0.040000
% Extra square factor: 7
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1435)) where (h, g)=(-4, 4)
% next D is D_52 = 1435 at 772.160000s
%T% Ecpp sieve(1435): 0.040000
% Testing if N is a norm in Q(sqrt(-1540)) where (h, g)=(-8, 8)
% next D is D_61 = 1540 at 772.360000s
%T% Ecpp sieve(1540): 0.040000
% Testing if N is a norm in Q(sqrt(-55)) where (h, g)=(4, 2)
% next D is D_68 = 55 at 772.570000s
%T% Ecpp sieve(55): 0.040000
% Testing if N is a norm in Q(sqrt(-155)) where (h, g)=(4, 2)
% next D is D_72 = 155 at 772.770000s
%T% Ecpp sieve(155): 0.050000
% Testing if N is a norm in Q(sqrt(-259)) where (h, g)=(4, 2)
% next D is D_76 = 259 at 772.970000s
%T% Ecpp sieve(259): 0.050000
% Testing if N is a norm in Q(sqrt(-388)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-763)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-955)) where (h, g)=(4, 2)
% next D is D_88 = 955 at 773.280000s
%T% Ecpp sieve(955): 0.050000
% Testing if N is a norm in Q(sqrt(-308)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-820)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-868)) where (h, g)=(8, 4)
% next D is D_109 = 868 at 773.600000s
%T% Ecpp sieve(868): 0.050000
% Testing if N is a norm in Q(sqrt(-1060)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1204)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1780)) where (h, g)=(8, 4)
% next D is D_127 = 1780 at 773.920000s
%T% Ecpp sieve(1780): 0.040000
% Testing if N is a norm in Q(sqrt(-2020)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2035)) where (h, g)=(8, 4)
% next D is D_131 = 2035 at 774.170000s
%T% Ecpp sieve(2035): 0.040000
% Testing if N is a norm in Q(sqrt(-6820)) where (h, g)=(16, 8)
% Testing if N is a norm in Q(sqrt(-16555)) where (h, g)=(16, 8)
% next D is D_212 = 16555 at 774.420000s
%T% Ecpp sieve(16555): 0.060000
% Testing if N is a norm in Q(sqrt(-31)) 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(-283)) where (h, g)=(3, 1)
% next D is D_235 = 283 at 774.750000s
%T% Ecpp sieve(283): 0.040000
% Testing if N is a norm in Q(sqrt(-307)) where (h, g)=(3, 1)
% next D is D_236 = 307 at 774.950000s
%T% Ecpp sieve(307): 0.040000
% Testing if N is a norm in Q(sqrt(-499)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-643)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-212)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-436)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-451)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-515)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-707)) where (h, g)=(6, 2)
% next D is D_259 = 707 at 775.480000s
%T% Ecpp sieve(707): 0.040000
% Testing if N is a norm in Q(sqrt(-1147)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1267)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1315)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1588)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1603)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1915)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2515)) where (h, g)=(6, 2)
% next D is D_287 = 2515 at 776.010000s
%T% Ecpp sieve(2515): 0.040000
% Testing if N is a norm in Q(sqrt(-2563)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1892)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-2387)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-3115)) where (h, g)=(12, 4)
% next D is D_349 = 3115 at 776.370000s
%T% Ecpp sieve(3115): 0.040000
% Testing if N is a norm in Q(sqrt(-3892)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-8155)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-12628)) where (h, g)=(24, 8)
% Testing if N is a norm in Q(sqrt(-164)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-371)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-583)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-979)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1043)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1252)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1795)) where (h, g)=(8, 2)
% next D is D_592 = 1795 at 777.070000s
%T% Ecpp sieve(1795): 0.040000
% Testing if N is a norm in Q(sqrt(-1828)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2611)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-5587)) where (h, g)=(8, 2)
% next D is D_622 = 5587 at 777.370000s
%T% Ecpp sieve(5587): 0.050000
% Testing if N is a norm in Q(sqrt(-740)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-2884)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-2980)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-4228)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-5860)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-5995)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6355)) where (h, g)=(16, 4)
% next D is D_703 = 6355 at 777.910000s
%T% Ecpp sieve(6355): 0.050000
% Testing if N is a norm in Q(sqrt(-7780)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-9955)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-11572)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-12595)) where (h, g)=(16, 4)
% next D is D_751 = 12595 at 778.280000s
%T% Ecpp sieve(12595): 0.050000
% Testing if N is a norm in Q(sqrt(-12772)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-13795)) where (h, g)=(16, 4)
% next D is D_759 = 13795 at 778.550000s
%T% Ecpp sieve(13795): 0.050000
% Testing if N is a norm in Q(sqrt(-14707)) where (h, g)=(16, 4)
% next D is D_764 = 14707 at 778.760000s
%T% Ecpp sieve(14707): 0.060000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-15715)) where (h, g)=(16, 4)
% next D is D_767 = 15715 at 779.010000s
%T% Ecpp sieve(15715): 0.060000
% Testing if N is a norm in Q(sqrt(-21715)) where (h, g)=(16, 4)
% next D is D_781 = 21715 at 779.220000s
%T% Ecpp sieve(21715): 0.070000
% Testing if N is a norm in Q(sqrt(-21835)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-4340)) where (h, g)=(32, 8)
% next D is D_786 = 4340 at 779.490000s
%T% Ecpp sieve(4340): 0.050000
% Testing if N is a norm in Q(sqrt(-9460)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-27412)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-30340)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-30580)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-53515)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-73315)) where (h, g)=(32, 8)
% next D is D_952 = 73315 at 779.970000s
% D too large for using tabjac
%T% Ecpp sieve(73315): 0.100000
% Testing if N is a norm in Q(sqrt(-56980)) where (h, g)=(64, 16)
% Testing if N is a norm in Q(sqrt(-103)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-179)) where (h, g)=(5, 1)
% next D is D_1051 = 179 at 780.340000s
%T% Ecpp sieve(179): 0.040000
% Testing if N is a norm in Q(sqrt(-227)) where (h, g)=(5, 1)
% next D is D_1052 = 227 at 780.530000s
%T% Ecpp sieve(227): 0.050000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-443)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-571)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-619)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1123)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1747)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1867)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2203)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2683)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-724)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-788)) where (h, g)=(10, 2)
% next D is D_1086 = 788 at 781.360000s
%T% Ecpp sieve(788): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 36
% D[[22]]=788
% A[[22]]=-1826958951769394834518776525554539651283371541821661318746342624875558983396560343951470766496
% B[[22]]=-29714427594781457636428137008173468964900322699208572736987929478202197201085219541326366461
% m[[22]]=1008385352697826913311462049532701718189732894085132159403625256020772206338966764918464577717955476406536858469910709017710647233848965911316411103264313694933282039597693224239445706638
% Factor [P]=1873^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 22 at 781.630000 s

% N_23=89729965536378974311395448436794956236851120669614892276528319631675761375597683299382859736426007866750031898016614078813903473380402732809789206554930921421363413382958998419598301
% Pmax[605]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.070000
% next D is D_1 = 0 at 781.710000s
% 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 781.860000s
%T% Ecpp sieve(4): 0.080000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[23]]=4
% A[[23]]=-12378512686118026329941008204270217274326074522417785799086478597938619119432562034909687530
% B[[23]]=-7170988178506693470029789230987755327720326140632034137440132680585445884943946951611638774
% m[[23]]=89729965536378974311395448436794956236851120669614892276528319631675761375597683299382859748804520552868058227957622283084120747706477255227575005641409519359982532815521033329285832
% Factor [P]=17^1
% Factor [P]=2^3
% End of depth 23 at 782.180000 s

% N_24=659779158355727752289672414976433501741552357864815384386237644350557068938218259554285733447092062888735722264394281493265593733135862170790992688539775877646930388349419362715337
% Pmax[598]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.070000
% next D is D_1 = 0 at 782.250000s
% 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 782.390000s
%T% Ecpp sieve(3): 0.070000
% 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 782.740000s
%T% Ecpp sieve(4): 0.080000
%T% Ecpp sieve(4): 0.080000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[24]]=4
% A[[24]]=1542919007376916065733584947165847328499298962586487262059899839311849572159213115944386328
% B[[24]]=254223115637594527282903438949021334222242925287257235126043316264989716846630760377847979
% m[[24]]=659779158355727752289672414976433501741552357864815384386237644350557068938218259554285731904173055511819656530809334327418265233836899584303730628639936565797358229136303418329010
% Factor [P]=15733^1
% Factor [P]=17^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 24 at 783.160000 s

% N_25=246682379246218234542483732198875163759034908964228573282174838331778116786454196893859565283975254527508555090577442814996678107775301664281420703818476924036535505788247041
% Pmax[576]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 783.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 783.320000s
%T% Ecpp sieve(3): 0.040000
% 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 783.670000s
%T% Ecpp sieve(4): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[25]]=4
% A[[25]]=64088065423681927603236123751500962638585300592910841485743110311993631847858748324290
% B[[25]]=495636519249520899132500881856849123377430238603895431085072774855379519808889723374504
% m[[25]]=246682379246218234542483732198875163759034908964228573282174838331778116786454196893859501195909830845580951854453691314034039522474708753439934960708164930404687647039922752
% Factor [P]=2281^1
% Factor [P]=1061^1
% Factor [P]=557^1
% Factor [P]=193^1
% Factor [P]=13^1
% Factor [P]=3^2
% Factor [P]=2^6
% End of depth 25 at 783.850000 s

% N_26=126624901182150567226590367397670312966522979668513150270779051156242940092455156656529016316542177489108116104366345812102463228606346158228153360273395099069
% Pmax[526]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 783.890000s
% 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 783.990000s
%T% Ecpp sieve(3): 0.030000
% 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 784.220000s
%T% Ecpp sieve(4): 0.040000
%T% Ecpp sieve(4): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[26]]=4
% A[[26]]=-19301934883920987658382873501063552695612064274860700472763992921512344495808876
% B[[26]]=-5786512647214130940445693980638534048211833376670295053168964791979015714113115
% m[[26]]=126624901182150567226590367397670312966522979668513150270779051156242940092455175958463900237529835871981617167919041424166738089306818922221074872617890907946
% Factor [P]=113^1
% Factor [P]=2^1
% End of depth 26 at 784.520000 s

% N_27=560287173372347642595532599104735898081960087028819248985748013965676726072810513090548231139512548106113350300526731965339549067729287266464933064680933221
% Pmax[518]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 784.560000s
% 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 784.660000s
%T% Ecpp sieve(4): 0.040000
%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 784.900000s
%T% Ecpp sieve(7): 0.030000
% Extra square factor: 5
% 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 785.040000s
%T% Ecpp sieve(43): 0.020000
% Extra square factor: 5
% 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 785.180000s
%T% Ecpp sieve(67): 0.030000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 785.310000s
%T% Ecpp sieve(163): 0.020000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 785.430000s
%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 785.550000s
%T% Ecpp sieve(35): 0.020000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 785.670000s
%T% Ecpp sieve(52): 0.020000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 785.790000s
%T% Ecpp sieve(91): 0.020000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 785.910000s
%T% Ecpp sieve(115): 0.020000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 786.030000s
%T% Ecpp sieve(235): 0.030000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 786.160000s
%T% Ecpp sieve(403): 0.020000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 786.280000s
%T% Ecpp sieve(427): 0.020000
% Testing if N is a norm in Q(sqrt(-155)) where (h, g)=(4, 2)
% next D is D_72 = 155 at 786.400000s
%T% Ecpp sieve(155): 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(-355)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-667)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-772)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1027)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-260)) where (h, g)=(8, 4)
% next D is D_97 = 260 at 786.690000s
%T% Ecpp sieve(260): 0.030000
% Testing if N is a norm in Q(sqrt(-580)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-868)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1204)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1780)) where (h, g)=(8, 4)
% next D is D_127 = 1780 at 786.920000s
%T% Ecpp sieve(1780): 0.020000
% Testing if N is a norm in Q(sqrt(-2020)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2212)) where (h, g)=(8, 4)
% next D is D_135 = 2212 at 787.070000s
%T% Ecpp sieve(2212): 0.020000
% Testing if N is a norm in Q(sqrt(-3172)) where (h, g)=(8, 4)
% next D is D_144 = 3172 at 787.190000s
%T% Ecpp sieve(3172): 0.020000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-3220)) where (h, g)=(16, 8)
% next D is D_165 = 3220 at 787.330000s
%T% Ecpp sieve(3220): 0.020000
% Testing if N is a norm in Q(sqrt(-6580)) where (h, g)=(16, 8)
% Testing if N is a norm in Q(sqrt(-7540)) where (h, g)=(16, 8)
% Testing if N is a norm in Q(sqrt(-13195)) where (h, g)=(16, 8)
% next D is D_210 = 13195 at 787.520000s
%T% Ecpp sieve(13195): 0.030000
% Testing if N is a norm in Q(sqrt(-23)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-31)) where (h, g)=(3, 1)
% next D is D_229 = 31 at 787.690000s
%T% Ecpp sieve(31): 0.020000
% Testing if N is a norm in Q(sqrt(-83)) where (h, g)=(3, 1)
% next D is D_231 = 83 at 787.810000s
%T% Ecpp sieve(83): 0.020000
% 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(-307)) 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(-499)) where (h, g)=(3, 1)
% next D is D_239 = 499 at 788.060000s
%T% Ecpp sieve(499): 0.030000
% 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 788.220000s
%T% Ecpp sieve(643): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-116)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-244)) where (h, g)=(6, 2)
% next D is D_249 = 244 at 788.380000s
%T% Ecpp sieve(244): 0.020000
% Testing if N is a norm in Q(sqrt(-628)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-707)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1099)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1267)) where (h, g)=(6, 2)
% next D is D_273 = 1267 at 788.600000s
%T% Ecpp sieve(1267): 0.020000
% Testing if N is a norm in Q(sqrt(-1315)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1363)) where (h, g)=(6, 2)
% next D is D_276 = 1363 at 788.750000s
%T% Ecpp sieve(1363): 0.030000
% Testing if N is a norm in Q(sqrt(-1588)) where (h, g)=(6, 2)
% next D is D_279 = 1588 at 788.870000s
%T% Ecpp sieve(1588): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 29
% D[[27]]=1588
% A[[27]]=-27304248946820280247632338859994881109982329112098153144398002599978105838194
% B[[27]]=-37561060041083095951693692462683840964344705656916481144756445929267757972514
% m[[27]]=560287173372347642595532599104735898081960087028819248985748013965676726072810540394797177959792795738452210295407841947668661165882431664467533042786771416
% Factor [P]=353^1
% Factor [P]=2^3
% End of depth 27 at 789.040000 s

% N_28=198401973573777493836944971354368235864716744698590385618182724492095157957794100706372938371031443250160131124436204655690035823612759087984253910335259
% Pmax[506]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 789.080000s
% 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 789.170000s
%T% Ecpp sieve(3): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[28]]=3
% A[[28]]=-27915842461515938211252146602697270619665505376925096020546969686939142655008
% B[[28]]=-2184310261763328283420047743611971554383124435841580117482719697586544767482
% m[[28]]=198401973573777493836944971354368235864716744698590385618182724492095157957822016548834454309242695396762828395055870161066960919633306057671193052990268
% Factor [P]=103^1
% Factor [P]=3^2
% Factor [P]=2^2
% End of depth 28 at 789.350000 s

% N_29=53506465365096411498636723666226600826514763942446166563695448892150797723252971021800014646505581282837871735451960669111909633126565819220925850321
% Pmax[495]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 789.390000s
% 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 789.470000s
%T% Ecpp sieve(3): 0.040000
% Extra square factor: 5
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[29]]=3
% A[[29]]=216418394715858738536914726341485400997007802606187553414853185945736226466
% B[[29]]=-236071274469524289918958963126526032310387288102981387867020735172511938376
% m[[29]]=53506465365096411498636723666226600826514763942446166563695448892150797723036552627084155907968666556496386334454952866505722079711712633275189623856
% Factor [P]=17599^1
% Factor [P]=5581^1
% Factor [P]=271^1
% Factor [P]=67^1
% Factor [P]=13^1
% Factor [P]=7^1
% Factor [P]=3^3
% Factor [P]=2^4
% End of depth 29 at 789.720000 s

% N_30=763197635041203283955819860894582085681282400571371029407488331954546427174728309337663600870987428798046129444451770966732343002461
% Pmax[439]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 789.750000s
% 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 789.800000s
%T% Ecpp sieve(3): 0.030000
% 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(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 789.970000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.030000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 790.130000s
%T% Ecpp sieve(43): 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 790.230000s
%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 790.300000s
%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 790.390000s
%T% Ecpp sieve(51): 0.020000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 790.470000s
%T% Ecpp sieve(52): 0.020000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 790.550000s
%T% Ecpp sieve(115): 0.010000
% Extra square factor: 9
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 790.640000s
%T% Ecpp sieve(123): 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(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 790.720000s
%T% Ecpp sieve(148): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 11
% D[[30]]=148
% A[[30]]=1695538241039989101168272275671673994296203483319372854388722374824
% B[[30]]=34674218685621897836485145687089211449240710056098830486778861629
% m[[30]]=763197635041203283955819860894582085681282400571371029407488331952850888933688320236495328595315754803749925961132398112343620627638
% Factor [P]=4357^1
% Factor [P]=43^1
% Factor [P]=2^1
% End of depth 30 at 790.810000 s

% N_31=2036812280268595534466909333002177959235025168190644910909171373392324804601225294331216082634508902551227177760279897391376669
% Pmax[420]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 790.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 790.890000s
%T% Ecpp sieve(4): 0.040000
%T% Ecpp sieve(4): 0.040000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 791.050000s
%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 791.130000s
%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 791.200000s
%T% Ecpp sieve(163): 0.020000
% 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 791.260000s
%T% Ecpp sieve(20): 0.020000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 791.330000s
%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 791.410000s
%T% Ecpp sieve(148): 0.020000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 791.480000s
%T% Ecpp sieve(403): 0.020000
% Testing if N is a norm in Q(sqrt(-155)) where (h, g)=(4, 2)
% next D is D_72 = 155 at 791.560000s
%T% Ecpp sieve(155): 0.020000
% Testing if N is a norm in Q(sqrt(-292)) where (h, g)=(4, 2)
% next D is D_78 = 292 at 791.630000s
%T% Ecpp sieve(292): 0.020000
% Testing if N is a norm in Q(sqrt(-388)) 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(-260)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-580)) where (h, g)=(8, 4)
% next D is D_104 = 580 at 791.770000s
%T% Ecpp sieve(580): 0.010000
% Testing if N is a norm in Q(sqrt(-820)) where (h, g)=(8, 4)
% next D is D_107 = 820 at 791.840000s
%T% Ecpp sieve(820): 0.020000
% Testing if N is a norm in Q(sqrt(-2755)) where (h, g)=(8, 4)
% next D is D_141 = 2755 at 791.910000s
%T% Ecpp sieve(2755): 0.010000
% Testing if N is a norm in Q(sqrt(-3172)) where (h, g)=(8, 4)
% next D is D_144 = 3172 at 791.980000s
%T% Ecpp sieve(3172): 0.010000
% Testing if N is a norm in Q(sqrt(-7540)) where (h, g)=(16, 8)
% next D is D_196 = 7540 at 792.050000s
%T% Ecpp sieve(7540): 0.020000
% Testing if N is a norm in Q(sqrt(-31)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-59)) where (h, g)=(3, 1)
% next D is D_230 = 59 at 792.150000s
%T% Ecpp sieve(59): 0.020000
% Testing if N is a norm in Q(sqrt(-331)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-643)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% next D is D_242 = 883 at 792.270000s
%T% Ecpp sieve(883): 0.010000
% Testing if N is a norm in Q(sqrt(-116)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-244)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-247)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-515)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-628)) where (h, g)=(6, 2)
% next D is D_258 = 628 at 792.420000s
%T% Ecpp sieve(628): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 19
% D[[31]]=628
% A[[31]]=-2492888277047354508120312611545840350622579861973033449586717626
% B[[31]]=-55476470585191133714922610551115883793744745990699150270271690
% m[[31]]=2036812280268595534466909333002177959235025168190644910909171375885213081648579802451528694180349253173807039733313346978094296
% Factor [P]=5807^1
% Factor [P]=439^1
% Factor [P]=7^1
% Factor [P]=2^3
% End of depth 31 at 792.520000 s

% N_32=14267458942976764737485306966522402095722312429791922966925776317161326005272454163903708276972838735184831124496175317
% Pmax[393]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 792.540000s
% 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 792.590000s
%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 792.720000s
%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 792.860000s
%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 792.920000s
%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(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 793.010000s
%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(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 793.090000s
%T% Ecpp sieve(123): 0.020000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 793.160000s
%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 793.220000s
%T% Ecpp sieve(84): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 9
% D[[32]]=84
% A[[32]]=163216405684837861814368911151851044244901649410565293914328
% B[[32]]=19033254322003510385170973097034908628913702794278684030951
% m[[32]]=14267458942976764737485306966522402095722312429791922966925613100755641167410639794992556425928593833535420559202260990
% Factor [P]=7853^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 32 at 793.290000 s

% N_33=181681636864596520278687214650737324534856900926931401590801134607865034603471791608207773155846094913223233913183
% Pmax[377]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 793.310000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[33]]=-1
% Factor [P]=3511^1
% Factor [P]=2^1
% End of depth 33 at 793.370000 s

% N_34=25873203768811808641225749736647297712169880507965166845742115438317435859224122986073451033301921804788270281
% Pmax[364]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 793.380000s
% 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]=11113^1
% Factor [P]=223^1
% Factor [P]=41^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 34 at 793.440000 s

% N_35=14146782277031393474891916157610582178372934015613696347406851060802238189793266691240992276036863411
% Pmax[333]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 793.450000s
% 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 793.480000s
%T% Ecpp sieve(7): 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[[35]]=7
% A[[35]]=-92810024801249083322258778742501686574199000939012
% B[[35]]=-82784943769570894419479126746772028662715767112950
% m[[35]]=14146782277031393474891916157610582178372934015613789157431652309885560448572009192927566475037802424
% Factor [P]=2^3
% End of depth 35 at 793.560000 s

% N_36=1768347784628924184361489519701322772296616751951723644678956538735695056071501149115945809379725303
% Pmax[330]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 793.580000s
% 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 793.610000s
%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 793.700000s
%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 793.750000s
%T% Ecpp sieve(11): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[36]]=11
% A[[36]]=-33543906854761931316147039791098568144601677776351
% B[[36]]=-23253929191809816602746514724188415078092174316999
% m[[36]]=1768347784628924184361489519701322772296616751951757188585811300667011203111292247684090411057501655
% Factor [P]=53639^1
% Factor [P]=37^1
% Factor [P]=5^1
% Factor [P]=3^4
% End of depth 36 at 793.800000 s

% N_37=2200038408038250327810599266344804846105408965397293474220582123373846080973859319132689257
% Pmax[301]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 793.820000s
% 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 793.850000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[37]]=3
% A[[37]]=2412350251281434244762812403606319645450565590
% B[[37]]=-996781470081816607230867110217992891812238824
% m[[37]]=2200038408038250327810599266344804846105408962984943222939147878611033677367539673682123668
% Factor [P]=709^1
% Factor [P]=97^1
% Factor [P]=2^2
% End of depth 37 at 793.910000 s

% N_38=7997464150314259694249920994957340984490312197319235829973782874860169242898883550529
% Pmax[283]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 793.930000s
% 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 793.950000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[38]]=3
% A[[38]]=5088089238636599557416052377124090010415479
% B[[38]]=1426090752246325009289455394554476404798935
% m[[38]]=7997464150314259694249920994957340984490307109229997193374225458807792118808873135051
% Factor [P]=10657^1
% Factor [P]=3517^1
% Factor [P]=283^1
% Factor [P]=97^1
% Factor [P]=3^1
% End of depth 38 at 793.990000 s

% N_39=2590988845921520201820570409323687321145599415566108241416990145686525943
% Pmax[241]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 794.000000s
% 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 794.020000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[39]]=3
% A[[39]]=3167200211242058511689631133110922775
% B[[39]]=333065661991916516663713146700103493
% m[[39]]=2590988845921520201820570409323687317978399204324049729727359012575603169
% Factor [P]=37^1
% Factor [P]=7^1
% Factor [P]=3^2
% End of depth 39 at 794.050000 s

% N_40=1111535326435658602239626945226807086219819478474495808548845565240499
% Pmax[230]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 794.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 794.080000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[40]]=3
% A[[40]]=38517402857710811852623361222810288
% B[[40]]=-31424783122239923124344020015794322
% m[[40]]=1111535326435658602239626945226807047702416620763683955925484342430212
% Factor [P]=67^1
% Factor [P]=7^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 40 at 794.120000 s

% N_41=197500946417139055124311823956433377345845170711386630406091745279
% Pmax[217]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 794.140000s
% 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 794.150000s
%T% Ecpp sieve(3): 0.020000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 794.190000s
%T% Ecpp sieve(43): 0.010000
% 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 794.230000s
%T% Ecpp sieve(163): 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(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 794.240000s
%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 794.270000s
%T% Ecpp sieve(24): 0.010000
% Extra square factor: 599
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[41]]=24
% A[[41]]=343256958316180933855096255757254
% B[[41]]=167354220920288294418960664382755
% m[[41]]=197500946417139055124311823956433034088886854530452775309835988026
% Factor [P]=599^2
% Factor [P]=7^1
% Factor [P]=2^1
% End of depth 41 at 794.310000 s

% N_42=39317645319737334528115231394966058401829357564788753835659
% Pmax[195]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 794.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 794.340000s
%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 794.370000s
%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 794.390000s
%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 794.410000s
%T% Ecpp sieve(67): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[42]]=67
% A[[42]]=393343149562509392584404029569
% B[[42]]=6171368617644415637777206475
% m[[42]]=39317645319737334528115231394572715252266848172204349806091
% Factor [P]=149^1
% End of depth 42 at 794.440000 s

% N_43=263876814226425063947082089896461176189710390417478857759
% Pmax[188]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 794.450000s
% 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 794.460000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[43]]=3
% A[[43]]=25623566124168014207625081356
% B[[43]]=-11531697128438202064643787290
% m[[43]]=263876814226425063947082089870837610065542376209853776404
% Factor [P]=44131^1
% Factor [P]=103^1
% Factor [P]=13^1
% Factor [P]=7^2
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 43 at 794.480000 s

% N_44=7594506541920693298129629766239591822160892887
% Pmax[153]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 794.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 794.500000s
%T% Ecpp sieve(3): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[44]]=3
% A[[44]]=163713932032792751751181
% B[[44]]=34524265022564871061673
% m[[44]]=7594506541920693298129466052307559029409141707
% Factor [P]=12511^1
% Factor [P]=3877^1
% End of depth 44 at 794.520000 s

% N_45=156571147839644590668480317198246178481
% Pmax[127]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 794.520000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[45]]=1
% Factor [P]=7^1
% Factor [P]=2^1
% End of depth 45 at 794.520000 s

% N_46=11183653417117470762034308371303298463
% Pmax[124]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 794.530000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[46]]=-1
% Factor [P]=257^1
% Factor [P]=251^1
% Factor [P]=41^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 46 at 794.530000 s

% N_47=704760812944953649199621013671
% Pmax[100]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 794.530000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[47]]=1
% Factor [P]=3541^1
% Factor [P]=1117^1
% Factor [P]=37^1
% Factor [P]=17^1
% Factor [P]=3^2
% Factor [P]=2^3
% End of depth 47 at 794.540000 s

% N_48=3934409011347785977
% Pmax[62]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 794.540000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[48]]=-1
% Factor [P]=1129^1
% Factor [P]=43^1
% Factor [P]=3^2
% Factor [P]=2^3
% End of depth 48 at 794.540000 s

% N_49=1125601367789
% Pmax[41]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 794.540000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[49]]=-1
% Factor [P]=277^1
% Factor [P]=19^1
% Factor [P]=17^1
% Factor [P]=2^2
% End of depth 49 at 794.540000 s

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

% N_51=112327
% Pmax[17]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 794.540000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[51]]=-1
% Factor [P]=193^1
% Factor [P]=97^1
% Factor [P]=3^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 51 at 794.540000 s

% N_52=193
% Pmax[8]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 794.550000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[52]]=-1
% Factor [P]=3^1
% Factor [P]=2^6
% Cofactor is 1
% End of depth 52 at 794.550000 s


% Time for building is 356.800000 s

% Starting phase 2: proving
% Starting proving job for step 0
% 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.250000
% E found
%T% find E: 0.250000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(88): 4.940000
% N_0 is prime
% Time for proof[0] is 4.940000 s

% Starting proving job for step 1
% D=1336 h=12 g=2 invcode=3 (f1^2/sqrt(2)) g0=2
%T% Factor of degree 3 found: 27.590000
%T% Factor of degree 1 found: 12.970000
%T% one root in GetInvariant: 40.560000s
% u has been computed
%T% FindJ: 40.790000
% E found
%T% find E: 40.790000
% Entering AEcModProveLarge
%T% ProveStep(1336): 42.920000
% N_1 is prime
% Time for proof[1] is 42.920000 s

% Starting proving job for step 2
%T% ProveStep(-1): 0.230000
% N_2 is prime
% Time for proof[2] is 0.230000 s

% Starting proving job for step 3
% D=179 h=5 g=1 invcode=11 (Stark's) g0=1
%T% Factor of degree 2 found: 8.390000
%T% one root in FindG2G3s: 8.580000s
% Using Stark's theorem
% E found
%T% find E: 8.580000
% Suggested twist(179)=1
% Entering AEcModProveLarge
%T% ProveStep(179): 10.360000
% N_3 is prime
% Time for proof[3] is 10.360000 s

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

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

% Starting proving job for step 6
% 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): 1.400000
% N_6 is prime
% Time for proof[6] is 1.400000 s

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

% Starting proving job for step 8
% Entering FindEForD0mod3
% D=219 h=4 g=2 invcode=10 (w3) g0=2
%T% one root in GetInvariant: 0.160000s
% u has been computed
%T% FindW: 0.310000
% E found
%T% find E: 0.310000
% Suggested twist(219)=1
% Entering AEcModProveLarge
%T% ProveStep(219): 1.760000
% N_8 is prime
% Time for proof[8] is 1.760000 s

% Starting proving job for step 9
%T% ProveStep(1): 0.750000
% N_9 is prime
% Time for proof[9] is 0.750000 s

% Starting proving job for step 10
% D=35 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.150000
% Suggested twist(35)=1
% Entering AEcModProveLarge
%T% ProveStep(35): 1.590000
% N_10 is prime
% Time for proof[10] is 1.590000 s

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

% Starting proving job for step 12
% D=163 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(163)=1
% Entering AEcModProveLarge
%T% ProveStep(163): 1.280000
% N_12 is prime
% Time for proof[12] is 1.280000 s

% Starting proving job for step 13
% 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.130000
% E found
%T% find E: 0.130000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(20): 2.520000
% N_13 is prime
% Time for proof[13] is 2.520000 s

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

% Starting proving job for step 15
% D=3635 h=10 g=2 invcode=11 (Stark's) g0=2
%T% Factor of degree 1 found: 4.810000
%T% one root in FindG2G3s: 4.810000s
% Using Stark's theorem
% E found
%T% find E: 4.940000
% Suggested twist(3635)=-1
% Entering AEcModProveLarge
%T% ProveStep(3635): 5.990000
% N_15 is prime
% Time for proof[15] is 5.990000 s

% Starting proving job for step 16
% D=1915 h=6 g=2 invcode=11 (Stark's) g0=2
%T% Factor of degree 1 found: 2.130000
%T% one root in FindG2G3s: 2.130000s
% Using Stark's theorem
% E found
%T% find E: 2.250000
% Suggested twist(1915)=1
% Entering AEcModProveLarge
%T% ProveStep(1915): 3.260000
% N_16 is prime
% Time for proof[16] is 3.260000 s

% Starting proving job for step 17
% D=1747 h=5 g=1 invcode=11 (Stark's) g0=1
%T% Factor of degree 1 found: 4.770000
%T% one root in FindG2G3s: 4.770000s
% Using Stark's theorem
% E found
%T% find E: 4.780000
% Suggested twist(1747)=-1
% Entering AEcModProveLarge
%T% ProveStep(1747): 5.800000
% N_17 is prime
% Time for proof[17] is 5.800000 s

% Starting proving job for step 18
% D=667 h=4 g=2 invcode=11 (Stark's) g0=2
%T% one root in FindG2G3s: 0.090000s
% Using Stark's theorem
% E found
%T% find E: 0.170000
% Suggested twist(667)=1
% Entering AEcModProveLarge
%T% ProveStep(667): 0.990000
% N_18 is prime
% Time for proof[18] is 0.990000 s

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

% Starting proving job for step 20
%T% ProveStep(-1): 0.080000
% N_20 is prime
% Time for proof[20] is 0.080000 s

% Starting proving job for step 21
% 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
% Using the 8 | D theorem
% E found
%T% find E: 0.140000
% Suggested twist(232)=1
% Entering AEcModProveLarge
%T% ProveStep(232): 0.760000
% N_21 is prime
% Time for proof[21] is 0.760000 s

% Starting proving job for step 22
% D=788 h=10 g=2 invcode=4 (f^4) g0=2
%T% Factor of degree 1 found: 2.810000
%T% one root in GetInvariant: 2.810000s
% u has been computed
%T% FindJ: 2.880000
% E found
%T% find E: 2.880000
% Entering AEcModProveLarge
%T% ProveStep(788): 3.490000
% N_22 is prime
% Time for proof[22] is 3.490000 s

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

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

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

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

% Starting proving job for step 27
% D=1588 h=6 g=2 invcode=4 (f^4) g0=2
%T% Factor of degree 1 found: 0.780000
%T% one root in GetInvariant: 0.780000s
% u has been computed
%T% FindJ: 0.830000
% E found
%T% find E: 0.830000
% Entering AEcModProveLarge
%T% ProveStep(1588): 1.210000
% N_27 is prime
% Time for proof[27] is 1.210000 s

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

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

% Starting proving job for step 30
% D=148 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
% Twisting
%T% ProveStep(148): 0.510000
% N_30 is prime
% Time for proof[30] is 0.510000 s

% Starting proving job for step 31
% D=628 h=6 g=2 invcode=4 (f^4) g0=2
%T% Factor of degree 1 found: 0.450000
%T% one root in GetInvariant: 0.450000s
% u has been computed
%T% FindJ: 0.470000
% E found
%T% find E: 0.470000
% Entering AEcModProveLarge
%T% ProveStep(628): 0.700000
% N_31 is prime
% Time for proof[31] is 0.700000 s

% Starting proving job for step 32
% Entering FindEForD0mod3
% D=84 h=-4 g=4 invcode=10 (w3) g0=4
%T% one root in GetInvariant: 0.000000s
% u has been computed
%T% FindW: 0.040000
% E found
%T% find E: 0.040000
% Suggested twist(84)=1
% Entering AEcModProveLarge
%T% ProveStep(84): 0.230000
% N_32 is prime
% Time for proof[32] is 0.230000 s

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

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

% Starting proving job for step 35
% 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.140000
% N_35 is prime
% Time for proof[35] is 0.140000 s

% Starting proving job for step 36
% 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_36 is prime
% Time for proof[36] is 0.130000 s

% Starting proving job for step 37
% 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.090000
% N_37 is prime
% Time for proof[37] is 0.090000 s

% Starting proving job for step 38
% 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.180000
% N_38 is prime
% Time for proof[38] is 0.180000 s

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

% Starting proving job for step 40
% 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_40 is prime
% Time for proof[40] is 0.050000 s

% Starting proving job for step 41
% 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.000000
% E found
%T% find E: 0.000000
% Suggested twist(24)=-1
% Entering AEcModProveLarge
%T% ProveStep(24): 0.050000
% N_41 is prime
% Time for proof[41] is 0.050000 s

% Starting proving job for step 42
% D=67 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(67)=-1
% Entering AEcModProveLarge
%T% ProveStep(67): 0.030000
% N_42 is prime
% Time for proof[42] is 0.030000 s

% Starting proving job for step 43
% 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_43 is prime
% Time for proof[43] is 0.020000 s

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

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

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

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

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

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

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

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

% Starting proving job for step 52
% Using complete factorization theorem
%T% ProveStep(-1): 0.000000
% N_52 is prime
% Time for proof[52] is 0.000000 s
% Time for proving  is 104.840000 s
% Total time is        461.640000 s
This number is prime
%T% PrintCertif: 0.110000
% Time for this number is 462.530000s

Working on 69030620699276583270615285458574981636501591470058004256441854251666135606491426777958839229503576962209214412445166291015577280995546049178565886218653485085518012709344709921949449742833826871078298908049088052422511909695021444212383798384202675425062403243314346724424519917560954572519758327431019290514708232279941800392673925512117436631645807129178041
% Performing a quick factorization
% This number might be prime
% Entering ECPP: delay mode
% Starting phase 1: building the sequence of primes
% N_0=69030620699276583270615285458574981636501591470058004256441854251666135606491426777958839229503576962209214412445166291015577280995546049178565886218653485085518012709344709921949449742833826871078298908049088052422511909695021444212383798384202675425062403243314346724424519917560954572519758327431019290514708232279941800392673925512117436631645807129178041
% Pmax[1193]=4900000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 3.580000
% next D is D_1 = 0 at 904.320000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.020000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.640000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.520000
% P-1: entering Step 2 up to b2=100000 at 912.830000
% Time for P-1.II is 5.830000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.940000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.670000
% P-1: entering Step 2 up to b2=100000 at 927.600000
% Time for P-1.II is 6.080000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 934.010000s
%T% Ecpp sieve(4): 2.460000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.680000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.360000
% P-1: entering Step 2 up to b2=100000 at 945.810000
% Time for P-1.II is 5.550000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.630000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.320000
% P-1: entering Step 2 up to b2=100000 at 960.600000
% Time for P-1.II is 5.510000
%T% Ecpp sieve(4): 2.460000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 6.160000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.640000
% P-1: entering Step 2 up to b2=100000 at 978.700000
% Time for P-1.II is 6.010000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 6.130000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.540000
% P-1: entering Step 2 up to b2=100000 at 994.690000
% Time for P-1.II is 5.840000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 1000.870000s
%T% Ecpp sieve(7): 1.410000
% Extra square factor: 5
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.810000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=173190341
% Time for P-1.I is 3.950000
% P-1: entering Step 2 up to b2=100000 at 1012.060000
% Factor[P-1.II]=390107863763
% Time for P-1.II is 6.030000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.670000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.510000
% P-1: entering Step 2 up to b2=100000 at 1026.590000
% Time for P-1.II is 5.810000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 1032.730000s
%T% Ecpp sieve(8): 2.400000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.640000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.520000
% P-1: entering Step 2 up to b2=100000 at 1043.610000
% Time for P-1.II is 5.860000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.920000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.660000
% P-1: entering Step 2 up to b2=100000 at 1058.380000
% Factor[P-1.II]=1699353659
% Time for P-1.II is 6.380000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 1065.100000s
%T% Ecpp sieve(11): 1.420000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.640000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.500000
% P-1: entering Step 2 up to b2=100000 at 1074.970000
% Factor[P-1.II]=18370823
% Time for P-1.II is 6.120000
% Extra square factor: 83
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Factor[RHO2]=63366911
% Time for rho is 4.770000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.180000
% P-1: entering Step 2 up to b2=100000 at 1090.020000
% Time for P-1.II is 5.230000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 1095.590000s
%T% Ecpp sieve(67): 1.340000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.580000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.500000
% P-1: entering Step 2 up to b2=100000 at 1105.320000
% Time for P-1.II is 5.770000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.830000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.670000
% P-1: entering Step 2 up to b2=100000 at 1119.920000
% Time for P-1.II is 6.080000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 1126.340000s
%T% Ecpp sieve(163): 1.310000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.870000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.650000
% P-1: entering Step 2 up to b2=100000 at 1136.500000
% Time for P-1.II is 6.010000
% Extra square factor: 5
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Factor[RHO2]=79931987
% Time for rho is 5.740000
% Factorization completed using Rho
% Number of D tried was 7
% D[[0]]=163
% A[[0]]=-475096137167907875878027186715250925459616772939203265491705088927911156215506731083497537932833336476895941465587251406593442430842021553324505967203401894093255265841049068442433
% B[[0]]=-17585225122494934368206890235371961706321995881788402333992098182786150684627240694267105433702034424879922272254700242043335589776370169516092173956255491589928668170812402407585
% m[[0]]=69030620699276583270615285458574981636501591470058004256441854251666135606491426777958839229503576962209214412445166291015577280995546049178565886218653485085518012709344709921949924838970994778954176935235803303347971526467960647477875503473130586581277909974397844262357353254037850513985345578837612732945550253833266306359877327406210691897486856197620475
% Factor [p]=79931987^1
% Factor [P]=5^2
% Factor [P]=92699^1
% End of depth 0 at 1149.250000 s

% N_1=372654278258102353651592871254682288523462978337349261284178440858187504062087681430505496067157550153925081516232853523873355460129350563849092112814199489055921291755962194721683716724392397715399331390449803164751442767866124416873029344383812039258442135174515367580763007713675997138004658488907417190192234607104373843548261652925868850163
% Pmax[1145]=4900000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 2.890000
% next D is D_1 = 0 at 1152.150000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.020000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.380000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.320000
% P-1: entering Step 2 up to b2=100000 at 1160.160000
% Time for P-1.II is 5.510000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.420000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=6228774763
% Time for P-1.I is 3.590000
% P-1: entering Step 2 up to b2=100000 at 1173.970000
% Time for P-1.II is 5.210000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 1179.470000s
%T% Ecpp sieve(3): 2.120000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.190000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.210000
% P-1: entering Step 2 up to b2=100000 at 1189.260000
% Time for P-1.II is 5.250000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.360000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.320000
% P-1: entering Step 2 up to b2=100000 at 1202.480000
% Time for P-1.II is 5.480000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.320000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.280000
% P-1: entering Step 2 up to b2=100000 at 1215.850000
% Factor[P-1.II]=12201030199
% Time for P-1.II is 5.680000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.170000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.170000
% P-1: entering Step 2 up to b2=100000 at 1229.140000
% Time for P-1.II is 5.230000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.400000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.340000
% P-1: entering Step 2 up to b2=100000 at 1242.400000
% Time for P-1.II is 5.510000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.360000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.310000
% P-1: entering Step 2 up to b2=100000 at 1255.860000
% Time for P-1.II is 5.490000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 1261.640000s
%T% Ecpp sieve(8): 2.320000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[1]]=8
% A[[1]]=2068054670026075646394194471608647630279885914430823411887538636998137353192907986627137238547134090937182604808291689525653097265763767451715954109450395578385049026146802
% B[[1]]=13630573460580229536703035702108569021546714658747178288103312045549443025333182169442315973260801164065494067626060075878659314941295715355456158878488562975056879902603791
% m[[1]]=372654278258102353651592871254682288523462978337349261284178440858187504062087681430505496067157550153925081516232853523873355460129350563849092112814199489055921291755962192653629046698316751321204859781802172884865528337042712529334392346246458846350455508037276820446672070531071188846315132835810151426424782891150264393152683267876842703362
% Factor [P]=2713^1
% Factor [P]=11^1
% Factor [P]=3^3
% Factor [P]=2^1
% End of depth 1 at 1265.000000 s

% N_2=231243680358134951711235013393973081672768338463483130409748325408022666809443297349031223940571428844238602709881002880428163847672790420390843012266788470189002254859668184892064177031599166081012148628316692471381419761593519994970215948802721183049598769385262391978931761732741587670733091348309332063989683597959112189068894664718721
% Pmax[1125]=4900000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 2.870000
% next D is D_1 = 0 at 1267.880000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.030000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.190000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=4140412649
% Time for P-1.I is 3.420000
% P-1: entering Step 2 up to b2=100000 at 1275.790000
% Time for P-1.II is 4.920000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.200000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.180000
% P-1: entering Step 2 up to b2=100000 at 1288.360000
% Time for P-1.II is 5.250000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 1293.900000s
%T% Ecpp sieve(4): 2.380000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 4.830000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.810000
% P-1: entering Step 2 up to b2=100000 at 1304.150000
% Time for P-1.II is 4.640000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.260000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.130000
% P-1: entering Step 2 up to b2=100000 at 1317.440000
% Factor[P-1.II]=1421954189
% Time for P-1.II is 5.380000
%T% Ecpp sieve(4): 2.340000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.290000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.140000
% P-1: entering Step 2 up to b2=100000 at 1333.870000
% Time for P-1.II is 5.190000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.320000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.160000
% P-1: entering Step 2 up to b2=100000 at 1347.810000
% Time for P-1.II is 5.230000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 1353.330000s
%T% Ecpp sieve(7): 1.370000
% Entering RHO2 with itmax=5000 cmax=5000
% Factor[RHO2]=6962393
% Time for rho is 4.410000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 1362.370000
% Time for P-1.II is 4.950000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.200000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.150000
% P-1: entering Step 2 up to b2=100000 at 1374.930000
% Factor[P-1.II]=233777741
% Time for P-1.II is 5.440000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 1380.660000s
%T% Ecpp sieve(8): 2.330000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.170000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.170000
% P-1: entering Step 2 up to b2=100000 at 1390.600000
% Factor[P-1.II]=1185910793
% Time for P-1.II is 5.460000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[2]]=8
% A[[2]]=-27499072269169249113404394930653588697570951117483239690149678809006170990327716095495582697981336094514288126678409405052087452841041170685049669901844215252081104237922
% B[[2]]=-4593143609875846937673978350879172745220800977985192076762751042515372872608366941174794504686575034989181981231627016832327038095506476949620877154733940703785793941140
% m[[2]]=231243680358134951711235013393973081672768338463483130409748325408022666809443297349031223940571428844238602709881002880428163847672790420390843012266788470189002254859695683964333346280712570475942802217014263422498903001283669673779222119793048899145094352083243728073446049859419997075785178801150373234674733267860956404320975768956644
% Factor [P]=43^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 2 at 1397.050000 s

% N_3=448146667360726650603168630608474964482109183068765756608039390325625323274114917343083767326688815589609695174187990078349154743551919419362098860982148198040702044301735821636304934652543741232447291118244696555230432173030367584843453720529164533226927038921014976886523352440736428441444144963469715571075064472598752721552278622009
% Pmax[1116]=4900000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 2.820000
% next D is D_1 = 0 at 1399.880000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.020000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.150000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=8803679
% Time for P-1.I is 3.390000
% P-1: entering Step 2 up to b2=100000 at 1407.700000
% Time for P-1.II is 4.940000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.160000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.150000
% P-1: entering Step 2 up to b2=100000 at 1420.210000
% Time for P-1.II is 5.240000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 1425.710000s
%T% Ecpp sieve(4): 2.340000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.320000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.190000
% P-1: entering Step 2 up to b2=100000 at 1436.830000
% Time for P-1.II is 5.360000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.300000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.150000
% P-1: entering Step 2 up to b2=100000 at 1450.900000
% Time for P-1.II is 5.230000
%T% Ecpp sieve(4): 2.380000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.360000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.190000
% P-1: entering Step 2 up to b2=100000 at 1467.330000
% Time for P-1.II is 5.290000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.290000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.140000
% P-1: entering Step 2 up to b2=100000 at 1481.310000
% Time for P-1.II is 5.180000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 1486.770000s
%T% Ecpp sieve(7): 1.370000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.140000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.130000
% P-1: entering Step 2 up to b2=100000 at 1495.670000
% Time for P-1.II is 5.250000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.120000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.120000
% P-1: entering Step 2 up to b2=100000 at 1508.420000
% Time for P-1.II is 5.150000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 1513.840000s
%T% Ecpp sieve(8): 2.320000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.140000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.130000
% P-1: entering Step 2 up to b2=100000 at 1523.690000
% Time for P-1.II is 5.250000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.150000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.160000
% P-1: entering Step 2 up to b2=100000 at 1536.520000
% Time for P-1.II is 5.220000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 1542.020000s
%T% Ecpp sieve(43): 1.330000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.950000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.010000
% P-1: entering Step 2 up to b2=100000 at 1550.560000
% Time for P-1.II is 5.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[3]]=43
% A[[3]]=-1123715665895323133542935574402104840755230640030415081886678998214153998353700306109408489537290740056051599884096594826628590227308206535852575384488009768910961718887
% B[[3]]=-111004899500536096708023333136401280054386208039053135243434837350459841079094969908036184160654119336501693072131238894528309380068376291665648796386883811241616440987
% m[[3]]=448146667360726650603168630608474964482109183068765756608039390325625323274114917343083767326688815589609695174187990078349154743551919419362098860982148198040702044302859537302200257786086676806849395958999927195260847254917046583057607718882864839336335528458305716942574952324833023268072735190777922106927639857086762490463240340897
% Factor [P]=23^1
% Factor [P]=17^1
% End of depth 3 at 1556.540000 s

% N_4=1146155159490349490033679362170012696885189726518582497718770819247123588936355287322464878073372929896699987657769795596800907272511302862818667163637207667623278885685062755248594009683086129940791294012787537583787333132780170289149891864150549461218249433397201322103772256585250698895326688467462716386004194007894533223691151767
% Pmax[1107]=4900000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 2.810000
% next D is D_1 = 0 at 1559.360000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.020000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.160000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.160000
% P-1: entering Step 2 up to b2=100000 at 1566.960000
% Time for P-1.II is 5.220000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.940000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=28188361081
% Time for P-1.I is 3.310000
% P-1: entering Step 2 up to b2=100000 at 1579.680000
% Time for P-1.II is 4.650000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 1584.600000s
%T% Ecpp sieve(3): 2.110000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.910000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.970000
% P-1: entering Step 2 up to b2=100000 at 1593.830000
% Time for P-1.II is 4.950000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.930000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.980000
% P-1: entering Step 2 up to b2=100000 at 1605.930000
% Time for P-1.II is 4.950000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.160000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.150000
% P-1: entering Step 2 up to b2=100000 at 1618.450000
% Factor[P-1.II]=35917699
% Time for P-1.II is 5.450000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.960000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 1631.110000
% Time for P-1.II is 4.950000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.940000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=523095619
% Time for P-1.I is 3.220000
% P-1: entering Step 2 up to b2=100000 at 1643.470000
% Time for P-1.II is 4.660000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.090000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.120000
% P-1: entering Step 2 up to b2=100000 at 1655.590000
% Time for P-1.II is 5.150000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 1661.010000s
%T% Ecpp sieve(19): 1.350000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.960000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.010000
% P-1: entering Step 2 up to b2=100000 at 1669.580000
% Time for P-1.II is 4.990000
% Extra square factor: 3
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.140000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.140000
% P-1: entering Step 2 up to b2=100000 at 1682.810000
% Time for P-1.II is 5.210000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 1688.290000s
%T% Ecpp sieve(43): 1.320000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.160000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.130000
% P-1: entering Step 2 up to b2=100000 at 1697.160000
% Time for P-1.II is 5.180000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.160000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.170000
% P-1: entering Step 2 up to b2=100000 at 1709.940000
% Time for P-1.II is 5.230000
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 1715.440000s
%T% Ecpp sieve(24): 1.360000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.940000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.990000
% P-1: entering Step 2 up to b2=100000 at 1723.980000
% Time for P-1.II is 4.930000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.120000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.130000
% P-1: entering Step 2 up to b2=100000 at 1736.430000
% Factor[P-1.II]=129622657
% Time for P-1.II is 5.420000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 1742.120000s
%T% Ecpp sieve(51): 1.330000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.110000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.120000
% P-1: entering Step 2 up to b2=100000 at 1750.930000
% Time for P-1.II is 5.150000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.940000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.020000
% P-1: entering Step 2 up to b2=100000 at 1763.290000
% Time for P-1.II is 4.950000
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 1768.510000s
%T% Ecpp sieve(123): 1.280000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.930000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.990000
% P-1: entering Step 2 up to b2=100000 at 1776.960000
% Time for P-1.II is 4.930000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.140000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.140000
% P-1: entering Step 2 up to b2=100000 at 1789.440000
% Factor[P-1.II]=432547095820759
% Time for P-1.II is 5.450000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 1795.160000s
%T% Ecpp sieve(403): 1.280000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.120000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.140000
% P-1: entering Step 2 up to b2=100000 at 1803.960000
% Time for P-1.II is 5.170000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.150000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.150000
% P-1: entering Step 2 up to b2=100000 at 1816.700000
% Time for P-1.II is 5.220000
% Testing if N is a norm in Q(sqrt(-312)) where (h, g)=(-4, 4)
% next D is D_36 = 312 at 1822.190000s
%T% Ecpp sieve(312): 1.270000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.910000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 1830.610000
% Time for P-1.II is 4.930000
% Cofactor after sieve is a probable prime
% Number of D tried was 9
% D[[4]]=312
% A[[4]]=-42654482028286359048148242430329472180011774184540217809831253238713234619085001997804156321200296809287898062172636767952069143409003187797102327215538692832777050314
% B[[4]]=-2977057466123646190842520671774836132336724906441037281676658598281629664498958450666915433915507476376559330530932028510069026022167863438046620508374271419009467709
% m[[4]]=1146155159490349490033679362170012696885189726518582497718770819247123588936355287322464878073372929896699987657769795596800907272511302862818667163637207667623278885727717237276880368731234372371120766192799311768327550942611423527863126483235551459022405754597498131391670318757887466847395831876465904183106521223433226056468202082
% Factor [P]=3167^1
% Factor [P]=41^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 4 at 1836.460000 s

% N_5=1471161135144117679568619685950917486073596523239636518002945542634951890733395569814813945224473072021558690430236862867837926267724453732493713323677363445212800303084549812826994294222218421643833083286225726904648741650572627178991590722459961158161022529846021511717213744840578356126050700537897043165041062716675813401501
% Pmax[1087]=4900000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 2.750000
% next D is D_1 = 0 at 1839.210000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.020000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.950000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 1846.420000
% Time for P-1.II is 4.930000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.840000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.930000
% P-1: entering Step 2 up to b2=100000 at 1858.350000
% Time for P-1.II is 4.790000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 1863.400000s
%T% Ecpp sieve(3): 2.050000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.930000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=803966851
% Time for P-1.I is 3.200000
% P-1: entering Step 2 up to b2=100000 at 1872.830000
% Time for P-1.II is 4.670000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.730000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.850000
% P-1: entering Step 2 up to b2=100000 at 1884.310000
% Time for P-1.II is 4.700000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.940000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 1896.200000
% Time for P-1.II is 4.930000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.920000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.970000
% P-1: entering Step 2 up to b2=100000 at 1908.260000
% Time for P-1.II is 4.920000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.950000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.010000
% P-1: entering Step 2 up to b2=100000 at 1920.390000
% Time for P-1.II is 4.940000
% Extra square factor: 5
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.920000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.970000
% P-1: entering Step 2 up to b2=100000 at 1933.140000
% Time for P-1.II is 4.870000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 1938.260000s
%T% Ecpp sieve(4): 2.220000
% Entering RHO4 with itmax=4000 cmax=4000
% Factor[RHO4]=26290969
% Time for rho is 3.810000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.750000
% P-1: entering Step 2 up to b2=10000 at 1945.260000
% Time for P-1.II is 0.510000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.040000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.990000
% P-1: entering Step 2 up to b2=100000 at 1954.050000
% Factor[P-1.II]=15868110277
% Time for P-1.II is 5.170000
%T% Ecpp sieve(4): 2.310000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.040000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.970000
% P-1: entering Step 2 up to b2=100000 at 1969.780000
% Time for P-1.II is 4.930000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.070000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.990000
% P-1: entering Step 2 up to b2=100000 at 1983.010000
% Time for P-1.II is 4.940000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 1988.210000s
%T% Ecpp sieve(7): 1.360000
% Extra square factor: 5
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.930000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.990000
% P-1: entering Step 2 up to b2=100000 at 1997.420000
% Time for P-1.II is 4.920000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.950000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.990000
% P-1: entering Step 2 up to b2=100000 at 2009.520000
% Time for P-1.II is 4.940000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 2014.710000s
%T% Ecpp sieve(11): 1.380000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.720000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.840000
% P-1: entering Step 2 up to b2=100000 at 2022.880000
% Time for P-1.II is 4.660000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.960000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=136011731
% Time for P-1.I is 3.220000
% P-1: entering Step 2 up to b2=100000 at 2034.960000
% Time for P-1.II is 4.690000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 2039.900000s
%T% Ecpp sieve(43): 1.300000
% Extra square factor: 5
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.950000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.010000
% P-1: entering Step 2 up to b2=100000 at 2049.100000
% Time for P-1.II is 4.950000
% Extra square factor: 21
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.940000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=19036711
% Time for P-1.I is 3.230000
% P-1: entering Step 2 up to b2=100000 at 2062.130000
% Factor[P-1.II]=16133357257973
% Time for P-1.II is 4.910000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 2067.290000s
%T% Ecpp sieve(67): 1.300000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.940000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.990000
% P-1: entering Step 2 up to b2=100000 at 2075.760000
% Time for P-1.II is 4.940000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.950000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.010000
% P-1: entering Step 2 up to b2=100000 at 2087.910000
% Time for P-1.II is 4.930000
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 2093.100000s
%T% Ecpp sieve(15): 1.360000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.720000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.830000
% P-1: entering Step 2 up to b2=100000 at 2101.240000
% Time for P-1.II is 4.660000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.930000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.990000
% P-1: entering Step 2 up to b2=100000 at 2113.070000
% Time for P-1.II is 4.940000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 2118.270000s
%T% Ecpp sieve(20): 1.350000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.930000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=69293381
% Time for P-1.I is 3.220000
% P-1: entering Step 2 up to b2=100000 at 2127.020000
% Time for P-1.II is 4.670000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.750000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=25147823
% Time for P-1.I is 3.070000
% P-1: entering Step 2 up to b2=100000 at 2138.740000
% Time for P-1.II is 4.620000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 2143.620000s
%T% Ecpp sieve(35): 1.290000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.770000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.850000
% P-1: entering Step 2 up to b2=100000 at 2151.760000
% Time for P-1.II is 4.710000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.640000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.770000
% P-1: entering Step 2 up to b2=100000 at 2163.100000
% Time for P-1.II is 4.550000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 2167.900000s
%T% Ecpp sieve(51): 1.320000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.930000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.980000
% P-1: entering Step 2 up to b2=100000 at 2176.370000
% Time for P-1.II is 4.900000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.930000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=497323033
% Time for P-1.I is 3.200000
% P-1: entering Step 2 up to b2=100000 at 2188.640000
% Time for P-1.II is 4.650000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 2193.540000s
%T% Ecpp sieve(187): 1.270000
% Extra square factor: 135
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.720000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.820000
% P-1: entering Step 2 up to b2=100000 at 2202.250000
% Time for P-1.II is 4.660000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.910000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.960000
% P-1: entering Step 2 up to b2=100000 at 2214.030000
% Time for P-1.II is 4.910000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 2219.190000s
%T% Ecpp sieve(235): 1.260000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.910000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.980000
% P-1: entering Step 2 up to b2=100000 at 2227.570000
% Time for P-1.II is 4.900000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.950000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.990000
% P-1: entering Step 2 up to b2=100000 at 2239.650000
% Time for P-1.II is 4.940000
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 2244.840000s
%T% Ecpp sieve(267): 1.240000
% Cofactor after sieve is a probable prime
% Number of D tried was 14
% D[[5]]=267
% A[[5]]=26405822638716741507815149844992325003055417548179275434412920166819194825866693496769315460260166517790128763957300912307742349826753406872376339807523834410972669
% B[[5]]=4407763440156319339578493629289819420820506145442602613065915363706610295046926621614875576910064996715775872059978328430055989412825106019654793813431677773737873
% m[[5]]=1471161135144117679568619685950917486073596523239636518002945542634951890733395569814813945224473072021558690430236862867837926267724453732493713323677363445212800276678727174110252786407068576651508080230808178725373307237652460359796764855766464388845562269679503721588449787539666048383700873784490170788701255192841402428833
% Factor [P]=1322831^1
% Factor [P]=29^1
% Factor [P]=3^1
% End of depth 5 at 2246.960000 s

% N_6=12783112963866738014592820602707527257338000224645654538723628779497109814328247695855692926017708885199066665862373370722301772101716451372952883553785412395472245289799594248047209186051651107094948760327288823319889310867760914749014514349753249849072494440232999429883905184121668702084496417366614643867647033537289
% Pmax[1061]=4900000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 2.740000
% next D is D_1 = 0 at 2249.700000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.020000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.870000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.970000
% P-1: entering Step 2 up to b2=100000 at 2256.800000
% Time for P-1.II is 5.050000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.760000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.870000
% P-1: entering Step 2 up to b2=100000 at 2268.710000
% Time for P-1.II is 4.710000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 2273.670000s
%T% Ecpp sieve(4): 2.300000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 4.800000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.850000
% P-1: entering Step 2 up to b2=100000 at 2283.850000
% Time for P-1.II is 4.740000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 4.780000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.820000
% P-1: entering Step 2 up to b2=100000 at 2296.420000
% Time for P-1.II is 4.730000
%T% Ecpp sieve(4): 2.290000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[6]]=4
% A[[6]]=6605764883498556424300706370141212679910083146202334481763831361613167489445705124956227058105134375036078999197897562048718308957405284067567684630627987657984
% B[[6]]=1368970613216757050033867443920308250096033701750340106063078507778325019547411909874411811364256332710613512749211451649915114009020891239653040590782423996285
% m[[6]]=12783112963866738014592820602707527257338000224645654538723628779497109814328247695855692926017708885199066665862373370722301772101716451372952883553785412395465639524916095691622908479681509894415038677181086488838125479506147747259568809224797022790967360065196920430686007622072950393127091133299046959237019045879306
% Factor [P]=2371861^1
% Factor [P]=55849^1
% Factor [P]=821^1
% Factor [P]=2^1
% End of depth 6 at 2304.190000 s

% N_7=58770425977074129616331211912330088792338970800157924045891948802813310646688574547489061776148423527990885594276112959671331646915898186793402717489889642827781291193431936277924487569898080682686735377377591579052906818523756824264767332230246738337432933167667417190190856881621629614067089998429175237
% Pmax[1013]=1000000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.590000
% next D is D_1 = 0 at 2304.780000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.780000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.750000
% P-1: entering Step 2 up to b2=10000 at 2308.520000
% Time for P-1.II is 0.520000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.650000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2312.590000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 2313.290000s
%T% Ecpp sieve(4): 0.500000
% Entering RHO4 with itmax=4000 cmax=4000
% Factor[RHO4]=1525217
% Time for rho is 3.760000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 2318.480000
% Time for P-1.II is 0.480000
% Entering RHO4 with itmax=4000 cmax=4000
% Factor[RHO4]=5427133
% Time for rho is 3.770000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 2323.660000
% Time for P-1.II is 0.490000
%T% Ecpp sieve(4): 0.510000
% Entering RHO4 with itmax=4000 cmax=4000
% Time for rho is 3.590000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 2329.210000
% Time for P-1.II is 0.520000
% Entering RHO4 with itmax=4000 cmax=4000
% Time for rho is 3.610000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 2334.300000
% Time for P-1.II is 0.520000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 2335.030000s
%T% Ecpp sieve(7): 0.290000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.800000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 2339.090000
% Time for P-1.II is 0.510000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.650000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2343.150000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 2343.850000s
%T% Ecpp sieve(43): 0.290000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 2347.680000
% Time for P-1.II is 0.490000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.810000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 2351.940000
% Time for P-1.II is 0.520000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 2352.680000s
%T% Ecpp sieve(67): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.630000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2356.480000
% Time for P-1.II is 0.480000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.810000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.770000
% P-1: entering Step 2 up to b2=10000 at 2360.750000
% Time for P-1.II is 0.520000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 2361.480000s
%T% Ecpp sieve(163): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2365.290000
% Time for P-1.II is 0.490000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.790000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 2369.530000
% Time for P-1.II is 0.520000
% Testing if N is a norm in Q(sqrt(-68)) where (h, g)=(4, 2)
% next D is D_70 = 68 at 2370.260000s
%T% Ecpp sieve(68): 0.280000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.790000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 2374.300000
% Time for P-1.II is 0.510000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.800000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 2378.580000
% Time for P-1.II is 0.510000
% Testing if N is a norm in Q(sqrt(-203)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-763)) where (h, g)=(4, 2)
% next D is D_86 = 763 at 2379.520000s
%T% Ecpp sieve(763): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.820000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 2383.560000
% Time for P-1.II is 0.510000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.800000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 2387.830000
% Time for P-1.II is 0.510000
% Testing if N is a norm in Q(sqrt(-772)) 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(-1204)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2788)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-6307)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-59)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-139)) where (h, g)=(3, 1)
% next D is D_233 = 139 at 2389.820000s
%T% Ecpp sieve(139): 0.280000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.810000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 2393.870000
% Time for P-1.II is 0.520000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.740000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.740000
% P-1: entering Step 2 up to b2=10000 at 2398.070000
% Time for P-1.II is 0.500000
% 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)
% next D is D_235 = 283 at 2399.000000s
%T% Ecpp sieve(283): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=1285913
% Time for rho is 2.960000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2403.130000
% Time for P-1.II is 0.490000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=10942229
% Time for rho is 2.990000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 2407.530000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-307)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-331)) where (h, g)=(3, 1)
% next D is D_237 = 331 at 2408.450000s
%T% Ecpp sieve(331): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.780000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.750000
% P-1: entering Step 2 up to b2=10000 at 2412.450000
% Time for P-1.II is 0.520000
% Testing if N is a norm in Q(sqrt(-379)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-499)) where (h, g)=(3, 1)
% next D is D_239 = 499 at 2413.560000s
%T% Ecpp sieve(499): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.780000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 2417.560000
% Time for P-1.II is 0.510000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.620000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.700000
% P-1: entering Step 2 up to b2=10000 at 2421.580000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-643)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-116)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-212)) where (h, g)=(6, 2)
% next D is D_248 = 212 at 2422.900000s
%T% Ecpp sieve(212): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=11712863
% Time for rho is 2.850000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 2426.930000
% Time for P-1.II is 0.480000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.740000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.750000
% P-1: entering Step 2 up to b2=10000 at 2431.110000
% Time for P-1.II is 0.500000
% Testing if N is a norm in Q(sqrt(-436)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-707)) where (h, g)=(6, 2)
% next D is D_259 = 707 at 2432.040000s
%T% Ecpp sieve(707): 0.260000
% Cofactor after sieve is a probable prime
% Number of D tried was 14
% D[[7]]=707
% A[[7]]=52939348730525881255217453633514691565239544139356284100723330198775610627771100767964412162865260604337819248408411949668843542932150729484039719280714
% B[[7]]=18125725045802875869041160382594016321058228393321525755750642368186829536601443191701273419749357763743709963911745169874152915369243111638446203613556
% m[[7]]=58770425977074129616331211912330088792338970800157924045891948802813310646688574547489061776148423527990885594276112959671331646915898186793402717489889589888432560667550681060470854055206515443142596021093490855722708042913129053163999367818083873076828595348419008778241188038078697463337605958709894524
% Factor [P]=7577^1
% Factor [P]=653^1
% Factor [P]=373^1
% Factor [P]=3^3
% Factor [P]=2^2
% End of depth 7 at 2432.980000 s

% N_8=294859946729256658672838413115138978084675569386155087007529113414640655407942291392092356514942876027717383108138060729000645505304980687908130255405880127722474359743664134680275570147688929336473731244920286190821338475412593445491355594526258874540111046342249360508359862079179684356430181
% Pmax[975]=1000000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.570000
% next D is D_1 = 0 at 2433.560000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.610000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2437.240000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 2437.920000s
%T% Ecpp sieve(3): 0.430000
% Extra square factor: 5
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=4470147274039
% Time for rho is 2.790000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.640000
% P-1: entering Step 2 up to b2=10000 at 2442.120000
% Time for P-1.II is 0.430000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.650000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Factor[P-1.I]=73266181
% Time for P-1.I is 0.880000
% P-1: entering Step 2 up to b2=10000 at 2446.440000
% Time for P-1.II is 0.460000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 2447.610000s
%T% Ecpp sieve(4): 0.490000
% Entering RHO4 with itmax=4000 cmax=4000
% Time for rho is 3.380000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2452.380000
% Time for P-1.II is 0.480000
% Entering RHO4 with itmax=4000 cmax=4000
% Time for rho is 3.390000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2457.150000
% Time for P-1.II is 0.490000
%T% Ecpp sieve(4): 0.490000
% Entering RHO4 with itmax=4000 cmax=4000
% Time for rho is 3.370000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2462.570000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 2463.250000s
%T% Ecpp sieve(7): 0.290000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 2464.080000s
%T% Ecpp sieve(11): 0.280000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.630000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2468.060000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 2468.740000s
%T% Ecpp sieve(67): 0.270000
% 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 2469.710000s
%T% Ecpp sieve(15): 0.280000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2473.520000
% Factor[P-1.II]=169915937
% Time for P-1.II is 0.650000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 2474.530000s
%T% Ecpp sieve(20): 0.280000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 2475.340000s
%T% Ecpp sieve(35): 0.280000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=17016841
% Time for rho is 2.790000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.670000
% P-1: entering Step 2 up to b2=10000 at 2479.410000
% Time for P-1.II is 0.450000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 2480.050000s
%T% Ecpp sieve(51): 0.280000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.620000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2484.010000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 2484.670000s
%T% Ecpp sieve(52): 0.280000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 2485.620000s
%T% Ecpp sieve(91): 0.280000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 2486.600000s
%T% Ecpp sieve(115): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 2490.400000
% Time for P-1.II is 0.480000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.620000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2494.400000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 2495.070000s
%T% Ecpp sieve(187): 0.260000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 2496.020000s
%T% Ecpp sieve(403): 0.270000
% Extra square factor: 3
% 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 2496.960000s
%T% Ecpp sieve(427): 0.260000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-84)) where (h, g)=(-4, 4)
% next D is D_29 = 84 at 2497.910000s
%T% Ecpp sieve(84): 0.280000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=2025929
% Time for rho is 2.790000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.670000
% P-1: entering Step 2 up to b2=10000 at 2501.830000
% Time for P-1.II is 0.450000
% Testing if N is a norm in Q(sqrt(-132)) where (h, g)=(-4, 4)
% next D is D_31 = 132 at 2502.640000s
%T% Ecpp sieve(132): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.610000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Factor[P-1.I]=1560775129
% Time for P-1.I is 0.870000
% P-1: entering Step 2 up to b2=10000 at 2506.740000
% Time for P-1.II is 0.460000
% Testing if N is a norm in Q(sqrt(-195)) where (h, g)=(-4, 4)
% next D is D_33 = 195 at 2507.390000s
%T% Ecpp sieve(195): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.630000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2511.350000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-340)) where (h, g)=(-4, 4)
% next D is D_37 = 340 at 2512.020000s
%T% Ecpp sieve(340): 0.260000
% Extra square factor: 3
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.630000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Factor[P-1.I]=5605661
% Time for P-1.I is 0.890000
% P-1: entering Step 2 up to b2=10000 at 2516.310000
% Time for P-1.II is 0.460000
% Testing if N is a norm in Q(sqrt(-372)) where (h, g)=(-4, 4)
% next D is D_38 = 372 at 2516.960000s
%T% Ecpp sieve(372): 0.260000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-435)) where (h, g)=(-4, 4)
% next D is D_40 = 435 at 2517.910000s
%T% Ecpp sieve(435): 0.250000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.630000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 2521.700000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-483)) where (h, g)=(-4, 4)
% next D is D_41 = 483 at 2522.550000s
%T% Ecpp sieve(483): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 2526.350000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-595)) where (h, g)=(-4, 4)
% next D is D_45 = 595 at 2527.190000s
%T% Ecpp sieve(595): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.610000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.700000
% P-1: entering Step 2 up to b2=10000 at 2531.120000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-708)) where (h, g)=(-4, 4)
% next D is D_47 = 708 at 2531.800000s
%T% Ecpp sieve(708): 0.250000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2535.580000
% Time for P-1.II is 0.490000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-715)) where (h, g)=(-4, 4)
% next D is D_48 = 715 at 2536.580000s
%T% Ecpp sieve(715): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.630000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 2540.380000
% Time for P-1.II is 0.480000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1012)) where (h, g)=(-4, 4)
% next D is D_51 = 1012 at 2541.380000s
%T% Ecpp sieve(1012): 0.250000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.630000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2545.320000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-420)) where (h, g)=(-8, 8)
% next D is D_53 = 420 at 2545.990000s
%T% Ecpp sieve(420): 0.260000
% Testing if N is a norm in Q(sqrt(-660)) where (h, g)=(-8, 8)
% next D is D_54 = 660 at 2546.780000s
%T% Ecpp sieve(660): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2550.740000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-1092)) where (h, g)=(-8, 8)
% next D is D_56 = 1092 at 2551.410000s
%T% Ecpp sieve(1092): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.620000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2555.190000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-1155)) where (h, g)=(-8, 8)
% next D is D_57 = 1155 at 2556.040000s
%T% Ecpp sieve(1155): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.590000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.700000
% P-1: entering Step 2 up to b2=10000 at 2559.770000
% Time for P-1.II is 0.470000
% Testing if N is a norm in Q(sqrt(-1380)) where (h, g)=(-8, 8)
% next D is D_59 = 1380 at 2560.610000s
%T% Ecpp sieve(1380): 0.250000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=3560507
% Time for rho is 2.810000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.680000
% P-1: entering Step 2 up to b2=10000 at 2564.540000
% Time for P-1.II is 0.460000
% Testing if N is a norm in Q(sqrt(-1428)) where (h, g)=(-8, 8)
% next D is D_60 = 1428 at 2565.360000s
%T% Ecpp sieve(1428): 0.260000
% Testing if N is a norm in Q(sqrt(-1540)) where (h, g)=(-8, 8)
% next D is D_61 = 1540 at 2566.150000s
%T% Ecpp sieve(1540): 0.250000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.630000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 2569.930000
% Factor[P-1.II]=518216869
% Time for P-1.II is 1.110000
% Factorization completed using p-1
% Number of D tried was 34
% D[[8]]=1540
% A[[8]]=871266669537997611373544561336123550644260132337688994990157696067076706838506039928121741823234673061495915110552582270913424497318249129693588692
% B[[8]]=16521025122064644562879323109994525138675090990800425752952395047997529011880607846756795302669378063836935787622760662649024181526038586454596097
% m[[8]]=294859946729256658672838413115138978084675569386155087007529113414640655407942291392092356514942876027717383108138060729000645505304980687908130254534613458184476748370119573344152019503428796998784736254762590123744631636906553517369613771291585813044195935789667089594935364760930554662841490
% Factor [p]=518216869^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 8 at 2571.040000 s

% N_9=56898947982578440277064468373209012245542236369413726477423704517546428116747062394854683226250374344281984982649814267045916157797823576427831463459097364540727976257777817214235073367213910012409251821318574275077222859934834255148420066443569557563784349866400641927952245946847121
% Pmax[943]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.440000
% next D is D_1 = 0 at 2571.490000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[9]]=1
% Factor [P]=19^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 9 at 2572.280000 s

% N_10=499113578794547721728635687484289581101247687450997600679155302785494983480237389428549852861845388984929692830261528658297510156121259442349398802272783899480069967173489624686272573396613245722888173871215563816466867192410826799547544442487452259331441665494742473052212683744273
% Pmax[936]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.440000
% next D is D_1 = 0 at 2572.720000s
% 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 2573.210000s
%T% Ecpp sieve(4): 0.380000
%T% Ecpp sieve(4): 0.390000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 2574.810000s
%T% Ecpp sieve(8): 0.380000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[10]]=8
% A[[10]]=-1037172229039705572948869917550975720127267420205960863112735047295201311136340355949750949118459075591000815712481921434510540199112533971630
% B[[10]]=-339250660000647495187400636261664756309096017605882606975841365772171346704642158704741632182074198250743385502844546064855128308878125551032
% m[[10]]=499113578794547721728635687484289581101247687450997600679155302785494983480237389428549852861845388984929692830261528658297510156121259442350435974501823605053018837091040600406399840816819206586000908918510765127603207548360577748666003518078453075043923586929253013251325217715904
% Factor [P]=50849^1
% Factor [P]=6491^1
% Factor [P]=11^1
% Factor [P]=3^1
% Factor [P]=2^6
% End of depth 10 at 2575.910000 s

% N_11=715997401049807343854942477023243572502102041991929214467374995119746130403760441574796697221658326634913149913034709987621587358795904784916298421341174338429233975461946033830926654977782868467927019837026820185083734213110957628143865484128776466641951798145236798913
% Pmax[897]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.430000
% next D is D_1 = 0 at 2576.350000s
% 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 2576.750000s
%T% Ecpp sieve(3): 0.340000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[11]]=3
% A[[11]]=-1278340903894175040723402713400679504585157542378726754324371042855413607059796936529751273475387565191723271073850505417191300014771665
% B[[11]]=640269250037371102761116595586669176649651729542520542300494935285905250885009557544957228042730354569805174547797996616822535613736303
% m[[11]]=715997401049807343854942477023243572502102041991929214467374995119746130403760441574796697221658326634913149913034709987621587358795906063257202315516215061831947376141450618988469033704537192838969875250633879982020263964384433015709057207399850317147368989445251570579
% Factor [P]=13^1
% End of depth 11 at 2578.030000 s

% N_12=55076723157677487988841729001787967115546310922456093420567307316903548492596957044215130555512178971916396147156516152893968258368915851019784793501247312448611336626265432229882233361887476372228451942356452306309251074183417924285312092876911562857489922265019351583
% Pmax[893]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.370000
% next D is D_1 = 0 at 2578.400000s
% 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 2578.830000s
%T% Ecpp sieve(3): 0.290000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[12]]=3
% A[[12]]=-393842800316800127483854022070822658806389839971834616009795434966988085566911867830730357056289976354658024489279883470625116438245345
% B[[12]]=147416350596229152206591448554976140963127950401148689719095934648070920248814178116503486069849598139510874430761770324427697262754387
% m[[12]]=55076723157677487988841729001787967115546310922456093420567307316903548492596957044215130555512178971916396147156516152893968258368916244862585110301374796302633407448924238619722205196503486167663418930442019218177081804540474214261666750901400842740960547381457596929
% Factor [P]=6091^1
% Factor [P]=373^1
% Factor [P]=7^2
% Factor [P]=3^1
% End of depth 12 at 2580.040000 s

% N_13=164912405859939962470619162354332345460467939132767099250538731139610781628270277381159897762454280972551574796402627702259645647515440190955091031334214650064632733923187281444480659252980283155648115197132964439272894725871246195726563978456980974491430161549
% Pmax[865]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.370000
% next D is D_1 = 0 at 2580.410000s
% 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 2580.810000s
%T% Ecpp sieve(3): 0.280000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[13]]=3
% A[[13]]=12017514245414757874489705772213542560432368337309245157302407931511439002899005065217165388741577270490122970232275505097506000633
% B[[13]]=-13105075032228458687588231464315213316563475590334278780786857410233206907725409609603400269506903182284098084184081170610123647487
% m[[13]]=164912405859939962470619162354332345460467939132767099250538731139610781628270277381159897762454280972551574796402627702259645647503422676709676273459724944292419191362754913107171414095677875224136676194233959374055729337129668925236441008224705469393924160917
% Factor [P]=223^1
% Factor [P]=7^1
% Factor [P]=3^1
% End of depth 13 at 2582.080000 s

% N_14=35215119765095016542946650086340453867279081599992974428900006649500487215090813021815053974472406784657607259535047555468640966795520537413981694097741820263168736144086037392092977598906230028643321843739901638705045769192754414955464661162653313985463199
% Pmax[853]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.350000
% next D is D_1 = 0 at 2582.440000s
% 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 2582.810000s
%T% Ecpp sieve(3): 0.280000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 2583.840000s
%T% Ecpp sieve(43): 0.190000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 2584.270000s
%T% Ecpp sieve(67): 0.180000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 2584.820000s
%T% Ecpp sieve(163): 0.180000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 2585.250000s
%T% Ecpp sieve(15): 0.190000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[14]]=15
% A[[14]]=165324607126691518048625099325373321270554600051905173453385098091334559980119850602253240916701704271473519331365569365821491616
% B[[14]]=86997415033928897494721962121587115998072932454035157471600153453236776363527226912400068692242612729626032813441184409009437234
% m[[14]]=35215119765095016542946650086340453867279081599992974428900006649500487215090813021815053974472406784657607259535047555468640966630195930287290176049116720937795414873531437340187804145521131937308761863620051036451804852491050143481945329797083948163971584
% Factor [P]=1021^1
% Factor [P]=139^1
% Factor [P]=31^1
% Factor [P]=3^1
% Factor [P]=2^9
% End of depth 14 at 2585.860000 s

% N_15=5211175721483502908742558961573620554533299681696842381880056637434153458274680247579702043721548836034093139663825333409909604497977032207025529941919095269293901304967166910752158184107363439637055994069834942237604666702699814416945124934579871
% Pmax[820]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.300000
% next D is D_1 = 0 at 2586.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 2586.480000s
%T% Ecpp sieve(3): 0.240000
% 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 2587.590000s
%T% Ecpp sieve(11): 0.160000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 2588.090000s
%T% Ecpp sieve(43): 0.160000
% Extra square factor: 3
% Factorization completed using trial division only
% 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 2588.780000s
%T% Ecpp sieve(163): 0.150000
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 2589.270000s
%T% Ecpp sieve(15): 0.160000
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 2589.850000s
%T% Ecpp sieve(24): 0.160000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 2590.340000s
%T% Ecpp sieve(51): 0.150000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 2590.820000s
%T% Ecpp sieve(88): 0.150000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 2591.400000s
%T% Ecpp sieve(115): 0.150000
% Extra square factor: 9
% 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 2591.990000s
%T% Ecpp sieve(187): 0.150000
% Extra square factor: 9
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-120)) where (h, g)=(-4, 4)
% next D is D_30 = 120 at 2592.560000s
%T% Ecpp sieve(120): 0.150000
% Testing if N is a norm in Q(sqrt(-408)) where (h, g)=(-4, 4)
% next D is D_39 = 408 at 2593.050000s
%T% Ecpp sieve(408): 0.140000
% Extra square factor: 485
% Factorization completed using trial division only
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-795)) where (h, g)=(-4, 4)
% next D is D_50 = 795 at 2593.710000s
%T% Ecpp sieve(795): 0.150000
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-55)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-184)) 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(-291)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-355)) where (h, g)=(4, 2)
% next D is D_81 = 355 at 2594.750000s
%T% Ecpp sieve(355): 0.150000
% Testing if N is a norm in Q(sqrt(-568)) where (h, g)=(4, 2)
% next D is D_83 = 568 at 2595.240000s
%T% Ecpp sieve(568): 0.140000
% Testing if N is a norm in Q(sqrt(-723)) where (h, g)=(4, 2)
% next D is D_85 = 723 at 2595.710000s
%T% Ecpp sieve(723): 0.150000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-955)) where (h, g)=(4, 2)
% next D is D_88 = 955 at 2596.280000s
%T% Ecpp sieve(955): 0.140000
% Testing if N is a norm in Q(sqrt(-1003)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1227)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1411)) where (h, g)=(4, 2)
% next D is D_94 = 1411 at 2596.980000s
%T% Ecpp sieve(1411): 0.140000
% Extra square factor: 3
% Factorization completed using trial division only
% Extra square factor: 11
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1555)) where (h, g)=(4, 2)
% next D is D_96 = 1555 at 2597.670000s
%T% Ecpp sieve(1555): 0.130000
% Testing if N is a norm in Q(sqrt(-915)) where (h, g)=(8, 4)
% next D is D_110 = 915 at 2598.130000s
%T% Ecpp sieve(915): 0.150000
% Testing if N is a norm in Q(sqrt(-1635)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1752)) where (h, g)=(8, 4)
% next D is D_124 = 1752 at 2598.740000s
%T% Ecpp sieve(1752): 0.140000
% Cofactor after sieve is a probable prime
% Number of D tried was 22
% D[[15]]=1752
% A[[15]]=3640848025049004013947601689982469531882045545264242941760086201809750316165239496321711503860133569628075610978292386249594
% B[[15]]=65814741657351815749928396071658617259567217794843301151203278288011299285279366719174699366094967695227405515227601980393
% m[[15]]=5211175721483502908742558961573620554533299681696842381880056637434153458274680247579702043721548836034093139663825333409905963649951983203011582340229112799762019259421902667810398097905553689320890754573513230733744533133071738805966832548330278
% Factor [P]=448829^1
% Factor [P]=97^2
% Factor [P]=3^3
% Factor [P]=2^1
% End of depth 15 at 2599.270000 s

% N_16=22851650829924009464416718296172348519673313084466629495054470784325744291926671844152824010499190512486971759783458533370378661446565513075741255504897802611912472575357205196118194410030962582224142593946664151506209449757889466284637
% Pmax[782]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.280000
% next D is D_1 = 0 at 2599.550000s
% 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 2599.840000s
%T% Ecpp sieve(4): 0.280000
%T% Ecpp sieve(4): 0.280000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 2600.880000s
%T% Ecpp sieve(67): 0.150000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 2601.330000s
%T% Ecpp sieve(148): 0.140000
% Testing if N is a norm in Q(sqrt(-68)) where (h, g)=(4, 2)
% next D is D_70 = 68 at 2601.780000s
%T% Ecpp sieve(68): 0.150000
% Testing if N is a norm in Q(sqrt(-292)) where (h, g)=(4, 2)
% next D is D_78 = 292 at 2602.230000s
%T% Ecpp sieve(292): 0.140000
% Testing if N is a norm in Q(sqrt(-388)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-667)) where (h, g)=(4, 2)
% next D is D_84 = 667 at 2602.770000s
%T% Ecpp sieve(667): 0.140000
% Testing if N is a norm in Q(sqrt(-1411)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-2788)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-23)) 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)
% next D is D_232 = 107 at 2603.630000s
%T% Ecpp sieve(107): 0.150000
% Testing if N is a norm in Q(sqrt(-139)) where (h, g)=(3, 1)
% next D is D_233 = 139 at 2604.080000s
%T% Ecpp sieve(139): 0.150000
% Testing if N is a norm in Q(sqrt(-331)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-499)) where (h, g)=(3, 1)
% next D is D_239 = 499 at 2604.620000s
%T% Ecpp sieve(499): 0.150000
% Testing if N is a norm in Q(sqrt(-116)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-212)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-244)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1219)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1363)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1588)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2923)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-3763)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1972)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-164)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-548)) where (h, g)=(8, 2)
% next D is D_574 = 548 at 2606.120000s
%T% Ecpp sieve(548): 0.140000
% Testing if N is a norm in Q(sqrt(-1252)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1348)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2059)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3403)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4267)) where (h, g)=(8, 2)
% next D is D_617 = 4267 at 2606.960000s
%T% Ecpp sieve(4267): 0.140000
% Testing if N is a norm in Q(sqrt(-4387)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4843)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4324)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6148)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6532)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-47)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-79)) where (h, g)=(5, 1)
% next D is D_1047 = 79 at 2608.030000s
%T% Ecpp sieve(79): 0.150000
% Testing if N is a norm in Q(sqrt(-179)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-443)) where (h, g)=(5, 1)
% next D is D_1054 = 443 at 2608.590000s
%T% Ecpp sieve(443): 0.150000
% Testing if N is a norm in Q(sqrt(-571)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-619)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-691)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-739)) where (h, g)=(5, 1)
% next D is D_1060 = 739 at 2609.350000s
%T% Ecpp sieve(739): 0.140000
% Cofactor after sieve is a probable prime
% Number of D tried was 15
% D[[16]]=739
% A[[16]]=-4520948890437717306208896325005093595864582245264188058002255989881007022849290488438769793091939332591077961702167447
% B[[16]]=-309890251754178198452246286766818892981279127214223878707026593089314184980371316424535878700906164916803686803901249
% m[[16]]=22851650829924009464416718296172348519673313084466629495054470784325744291926671844152824010499190512486971759783458537891327551884282819284637580509991398476494717839545263198374184291037985431514631032716457243445542040835851168452085
% Factor [P]=73^1
% Factor [P]=5^1
% End of depth 16 at 2609.960000 s

% N_17=62607262547737012231278680263485886355269350916346930123436906258426696690210059846994038384929289075306771944612215172305006991463788545985308439753401091716423884491904830680477217235720508031546934336209471899850800111879044297129
% Pmax[774]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.280000
% next D is D_1 = 0 at 2610.250000s
% 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 2610.540000s
%T% Ecpp sieve(4): 0.270000
%T% Ecpp sieve(4): 0.270000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 2611.550000s
%T% Ecpp sieve(7): 0.160000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 2612.010000s
%T% Ecpp sieve(8): 0.260000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 2612.550000s
%T% Ecpp sieve(11): 0.160000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 2613.000000s
%T% Ecpp sieve(19): 0.160000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 2613.430000s
%T% Ecpp sieve(67): 0.150000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 2613.860000s
%T% Ecpp sieve(20): 0.160000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 2614.310000s
%T% Ecpp sieve(35): 0.150000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 2614.750000s
%T% Ecpp sieve(40): 0.140000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 2615.180000s
%T% Ecpp sieve(88): 0.150000
% Cofactor after sieve is a probable prime
% Number of D tried was 11
% D[[17]]=88
% A[[17]]=286114588304696863060204450765986072217161141998737527927146069725075718281431574100760553480325964655721520980609938
% B[[17]]=43766878893408066757942452509850222342643758277661355164826827718917489148588740516662587749002560952749538432742738
% m[[17]]=62607262547737012231278680263485886355269350916346930123436906258426696690210059846994038384929289075306771944612214886190418686766925485780857673767328874555281885754376903534407492160002226599972833575655991573886144390358063687192
% Factor [P]=13^1
% Factor [P]=2^3
% End of depth 17 at 2615.680000 s

% N_18=601992909112855886839218079456595061108359143426412789648431790946410545098173652374942676778166241108718961005886681597984795065066591209431323786224316101493095055330547149369302809230790640384354168996692226671982157599596766223
% Pmax[767]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.230000
% next D is D_1 = 0 at 2615.910000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 2616.180000s
%T% Ecpp sieve(3): 0.200000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 2617.010000s
%T% Ecpp sieve(11): 0.130000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 2617.410000s
%T% Ecpp sieve(19): 0.130000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 2617.900000s
%T% Ecpp sieve(24): 0.130000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 2618.310000s
%T% Ecpp sieve(88): 0.120000
% Extra square factor: 27
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 2618.780000s
%T% Ecpp sieve(123): 0.120000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 2619.080000s
%T% Ecpp sieve(267): 0.120000
% Testing if N is a norm in Q(sqrt(-627)) where (h, g)=(-4, 4)
% next D is D_46 = 627 at 2619.460000s
%T% Ecpp sieve(627): 0.120000
% Testing if N is a norm in Q(sqrt(-219)) where (h, g)=(4, 2)
% next D is D_75 = 219 at 2619.840000s
%T% Ecpp sieve(219): 0.120000
% Testing if N is a norm in Q(sqrt(-291)) where (h, g)=(4, 2)
% next D is D_77 = 291 at 2620.230000s
%T% Ecpp sieve(291): 0.120000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-1227)) 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(-1752)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-4323)) where (h, g)=(8, 4)
% next D is D_149 = 4323 at 2620.830000s
%T% Ecpp sieve(4323): 0.110000
% 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(-307)) 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(-499)) where (h, g)=(3, 1)
% next D is D_239 = 499 at 2621.690000s
%T% Ecpp sieve(499): 0.130000
% Extra square factor: 3
% Factorization completed using trial division only
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-547)) where (h, g)=(3, 1)
% next D is D_240 = 547 at 2622.080000s
%T% Ecpp sieve(547): 0.120000
% Testing if N is a norm in Q(sqrt(-643)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% next D is D_243 = 907 at 2622.650000s
%T% Ecpp sieve(907): 0.120000
% Testing if N is a norm in Q(sqrt(-87)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-152)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-451)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-856)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1048)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1203)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1363)) where (h, g)=(6, 2)
% next D is D_276 = 1363 at 2623.630000s
%T% Ecpp sieve(1363): 0.110000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1563)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1843)) where (h, g)=(6, 2)
% next D is D_281 = 1843 at 2624.200000s
%T% Ecpp sieve(1843): 0.110000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-2563)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2787)) where (h, g)=(6, 2)
% next D is D_289 = 2787 at 2624.750000s
%T% Ecpp sieve(2787): 0.120000
% Testing if N is a norm in Q(sqrt(-696)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-984)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-1272)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-1464)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-4587)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-5307)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-6232)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-5016)) where (h, g)=(24, 8)
% next D is D_426 = 5016 at 2625.820000s
%T% Ecpp sieve(5016): 0.110000
% Testing if N is a norm in Q(sqrt(-12408)) where (h, g)=(24, 8)
% next D is D_468 = 12408 at 2626.210000s
%T% Ecpp sieve(12408): 0.110000
% Testing if N is a norm in Q(sqrt(-25707)) where (h, g)=(24, 8)
% next D is D_508 = 25707 at 2626.600000s
%T% Ecpp sieve(25707): 0.140000
% Testing if N is a norm in Q(sqrt(-183)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-376)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-583)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-632)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-979)) where (h, g)=(8, 2)
% next D is D_581 = 979 at 2627.400000s
%T% Ecpp sieve(979): 0.120000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1803)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1912)) where (h, g)=(8, 2)
% next D is D_596 = 1912 at 2627.970000s
%T% Ecpp sieve(1912): 0.110000
% Extra square factor: 9
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-3403)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3448)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4387)) where (h, g)=(8, 2)
% next D is D_618 = 4387 at 2628.620000s
%T% Ecpp sieve(4387): 0.120000
% Extra square factor: 9
% Factorization completed using trial division only
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-4843)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-2328)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-2739)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-3531)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6099)) where (h, g)=(16, 4)
% next D is D_697 = 6099 at 2629.400000s
%T% Ecpp sieve(6099): 0.110000
% Testing if N is a norm in Q(sqrt(-7923)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-8283)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-13827)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-17347)) where (h, g)=(16, 4)
% next D is D_771 = 17347 at 2630.080000s
%T% Ecpp sieve(17347): 0.130000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-21912)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-47)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-79)) where (h, g)=(5, 1)
% next D is D_1047 = 79 at 2630.750000s
%T% Ecpp sieve(79): 0.120000
% Testing if N is a norm in Q(sqrt(-127)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-131)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-523)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-739)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-787)) where (h, g)=(5, 1)
% next D is D_1061 = 787 at 2631.520000s
%T% Ecpp sieve(787): 0.120000
% Testing if N is a norm in Q(sqrt(-1051)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1123)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1723)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2203)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-159)) where (h, g)=(10, 2)
% next D is D_1073 = 159 at 2632.380000s
%T% Ecpp sieve(159): 0.130000
% Testing if N is a norm in Q(sqrt(-319)) where (h, g)=(10, 2)
% next D is D_1076 = 319 at 2632.780000s
%T% Ecpp sieve(319): 0.130000
% Cofactor after sieve is a probable prime
% Number of D tried was 30
% D[[18]]=319
% A[[18]]=3252982498009332810072562120443589693947009087168134026818694431186465925572135467577944899787074350268240247652696
% B[[18]]=2741409918763154385727702142951755380681720874385180770792460773767937937011354826256442889486233146665110562644798
% m[[18]]=601992909112855886839218079456595061108359143426412789648431790946410545098173652374942676778166241108718961005886678345002297055733781136869203342634622154484007887196520330674871622764865068248886591051792439597631889359349113528
% Factor [P]=2^3
% End of depth 18 at 2633.260000 s

% N_19=75249113639106985854902259932074382638544892928301598706053973868301318137271706546867834597270780138589870125735834793125287131966722642108650417829327769310500985899565041334358952845608133531110823881474054949703986169918639191
% Pmax[764]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.230000
% next D is D_1 = 0 at 2633.490000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 2633.780000s
%T% Ecpp sieve(3): 0.180000
% 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]]=7877069179291141818648991706236027658328859496552248625572098798090961278693773977634079485117576672568432438951191
% B[[19]]=-8924651920403572447025655801571018764000700475211395843409816310837127787662117568665779102211866245828749438583931
% m[[19]]=75249113639106985854902259932074382638544892928301598706053973868301318137271706546867834597270780138589870125735826916056107840824903993116944181801669440451004433650939469235560861884329439757133189801988937373031417737479688001
% Factor [P]=31^1
% Factor [P]=19^1
% Factor [P]=3^1
% End of depth 19 at 2634.730000 s

% N_20=42585802851786636024279716996080578742809786603453083591428394945275222488552182539257404978647866518726581848180999952493552824462311258130698461687419038172611450849428109357985773562155879885191392078092211303356772913118103
% Pmax[753]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.230000
% next D is D_1 = 0 at 2634.960000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[20]]=-1
% Factor [P]=140939^1
% Factor [P]=46381^1
% Factor [P]=61^1
% Factor [P]=19^1
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 20 at 2635.260000 s

% N_21=936825835582474262794815238557079467745710270703786433311394858325128290579677381543630596705012997282324760916496696762610005750609829863404979221929214988539191056335531328785260397643214374625278999367277082257
% Pmax[708]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.220000
% next D is D_1 = 0 at 2635.480000s
% 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 2635.690000s
%T% Ecpp sieve(4): 0.230000
%T% Ecpp sieve(4): 0.220000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 2636.510000s
%T% Ecpp sieve(7): 0.130000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 2636.860000s
%T% Ecpp sieve(8): 0.210000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 2637.290000s
%T% Ecpp sieve(19): 0.120000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 2637.630000s
%T% Ecpp sieve(163): 0.120000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 2637.960000s
%T% Ecpp sieve(52): 0.130000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 2638.310000s
%T% Ecpp sieve(91): 0.120000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 2638.650000s
%T% Ecpp sieve(148): 0.110000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 2638.980000s
%T% Ecpp sieve(403): 0.120000
% Testing if N is a norm in Q(sqrt(-532)) where (h, g)=(-4, 4)
% next D is D_43 = 532 at 2639.330000s
%T% Ecpp sieve(532): 0.110000
% Testing if N is a norm in Q(sqrt(-56)) 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(-328)) where (h, g)=(4, 2)
% next D is D_80 = 328 at 2639.910000s
%T% Ecpp sieve(328): 0.110000
% Extra square factor: 37
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 12
% D[[21]]=328
% A[[21]]=-36483567967278931478393474312794063340401268401913704100455598324682957056579682197423904289335196989920306
% B[[21]]=-2714152503661243547340773643044122570298161252626998857456027905414049099576402674613205484487072132835308
% m[[21]]=936825835582474262794815238557079467745710270703786433311394858325128290579677381543630596705012997282324797400064664041541484144084142657468319623197616902243291511933856011742316977325411798529568334564267002564
% Factor [P]=37^2
% Factor [P]=79^1
% Factor [P]=73^1
% Factor [P]=47^1
% Factor [P]=13^1
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 21 at 2640.430000 s

% N_22=6935954220243867883375672728496751686746254159143016744945414692336962756756310148881589968919767077157449897170420556895552011893123008896832053373353231570905426700832279625290027973417505762043490371
% Pmax[671]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 2640.580000s
% 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 2640.770000s
%T% Ecpp sieve(3): 0.130000
% 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 2641.400000s
%T% Ecpp sieve(7): 0.090000
% Extra square factor: 5
% Factorization completed using trial division only
% Extra square factor: 3
% 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 2641.790000s
%T% Ecpp sieve(8): 0.150000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 2642.130000s
%T% Ecpp sieve(11): 0.090000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 2642.410000s
%T% Ecpp sieve(43): 0.090000
% Extra square factor: 15
% 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 2642.750000s
%T% Ecpp sieve(67): 0.090000
% Extra square factor: 5
% 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 2643.090000s
%T% Ecpp sieve(15): 0.090000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 2643.370000s
%T% Ecpp sieve(35): 0.090000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 2643.640000s
%T% Ecpp sieve(40): 0.090000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 2643.910000s
%T% Ecpp sieve(115): 0.090000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 2644.250000s
%T% Ecpp sieve(123): 0.090000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 2644.530000s
%T% Ecpp sieve(235): 0.080000
% Testing if N is a norm in Q(sqrt(-168)) where (h, g)=(-4, 4)
% next D is D_32 = 168 at 2644.800000s
%T% Ecpp sieve(168): 0.080000
% Testing if N is a norm in Q(sqrt(-483)) where (h, g)=(-4, 4)
% next D is D_41 = 483 at 2645.070000s
%T% Ecpp sieve(483): 0.080000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-555)) where (h, g)=(-4, 4)
% next D is D_44 = 555 at 2645.400000s
%T% Ecpp sieve(555): 0.080000
% Testing if N is a norm in Q(sqrt(-795)) where (h, g)=(-4, 4)
% next D is D_50 = 795 at 2645.660000s
%T% Ecpp sieve(795): 0.080000
% Testing if N is a norm in Q(sqrt(-1435)) where (h, g)=(-4, 4)
% next D is D_52 = 1435 at 2645.930000s
%T% Ecpp sieve(1435): 0.080000
% No factor found, sieve only: no PRP test
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-840)) where (h, g)=(-8, 8)
% next D is D_55 = 840 at 2646.190000s
%T% Ecpp sieve(840): 0.080000
% Testing if N is a norm in Q(sqrt(-1155)) where (h, g)=(-8, 8)
% next D is D_57 = 1155 at 2646.450000s
%T% Ecpp sieve(1155): 0.080000
% Testing if N is a norm in Q(sqrt(-1320)) where (h, g)=(-8, 8)
% next D is D_58 = 1320 at 2646.720000s
%T% Ecpp sieve(1320): 0.080000
% Cofactor after sieve is a probable prime
% Number of D tried was 21
% D[[22]]=1320
% A[[22]]=166394369948598706335564464018738950053291234641809925097578428562717748354000736946284248600879030358
% B[[22]]=207310575064547531711092138983294588068042822223583594437391558436815739325544869397798214310746801
% m[[22]]=6935954220243867883375672728496751686746254159143016744945414692336962756756310148881589968919767076991055527221821850559987547874384058843540818731543306473326998138114531271289291027133257161164460014
% Factor [P]=243101^1
% Factor [P]=3761^1
% Factor [P]=61^1
% Factor [P]=2^1
% End of depth 22 at 2647.010000 s

% N_23=62180800473827589122613826156726926184382613859090535447406159139898876755778133218196266096777935690538369677493960969090955316789502817724016354941671268017494946197695993666069624480785167
% Pmax[634]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 2647.090000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 2647.250000s
%T% Ecpp sieve(19): 0.050000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 2647.470000s
%T% Ecpp sieve(43): 0.040000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 2647.680000s
%T% Ecpp sieve(67): 0.040000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 2647.840000s
%T% Ecpp sieve(163): 0.040000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[23]]=163
% A[[23]]=498434954789372999051836947657554498849188549556239633533295639829800822152988564432825260450731
% B[[23]]=1324145144830052057461501157597982715179387224966934058827084854738847727201414789344092262383
% m[[23]]=62180800473827589122613826156726926184382613859090535447406159139898876755778133218196266096777437255583580304494909132143297762290653629174460115308137972377665145375543005101636799220334437
% Factor [P]=30497^1
% Factor [P]=23297^1
% Factor [P]=383^1
% End of depth 23 at 2648.070000 s

% N_24=228507476974470161024513852590151294273742282440213207463936741684543379418606474982134134301840409569754510318714491999894950527561227607899008933630970716007552947764834917411771
% Pmax[596]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 2648.150000s
% 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]=5^1
% Factor [P]=2^1
% End of depth 24 at 2648.330000 s

% N_25=22850747697447016102451385259015129427374228244021320746393674168454337941860647498213413430184040956975451031871449199989495052756122760789900893363097071600755294776483491741177
% Pmax[593]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 2648.410000s
% 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 2648.550000s
%T% Ecpp sieve(3): 0.070000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 2648.940000s
%T% Ecpp sieve(4): 0.080000
%T% Ecpp sieve(4): 0.080000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 2649.340000s
%T% Ecpp sieve(8): 0.080000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 2649.550000s
%T% Ecpp sieve(11): 0.050000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 2649.730000s
%T% Ecpp sieve(163): 0.050000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 2649.950000s
%T% Ecpp sieve(24): 0.050000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 2650.150000s
%T% Ecpp sieve(52): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[25]]=52
% A[[25]]=115287531340767317761027793716065660519705698727842786421316340023261802307843416240261274
% B[[25]]=38757573926598690697501170669821583650099884492499481131634897307262402101934566934971196
% m[[25]]=22850747697447016102451385259015129427374228244021320746393674168454337941860647498213413314896509616208133270843655483923834533050424032947114472046757048338952986933067251479904
% Factor [P]=6827^1
% Factor [P]=31^1
% Factor [P]=29^1
% Factor [P]=17^1
% Factor [P]=2^5
% End of depth 25 at 2650.350000 s

% N_26=6844030257147308338958987626879535472023254259488404250651523822342230892700371235553528550713987810968342151028264582207385286667519649417672552660000754291970776147067
% Pmax[561]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 2650.390000s
% 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 2650.510000s
%T% Ecpp sieve(8): 0.040000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 2650.670000s
%T% Ecpp sieve(232): 0.020000
% Testing if N is a norm in Q(sqrt(-667)) where (h, g)=(4, 2)
% next D is D_84 = 667 at 2650.810000s
%T% Ecpp sieve(667): 0.030000
% Testing if N is a norm in Q(sqrt(-23)) where (h, g)=(3, 1)
% next D is D_228 = 23 at 2650.960000s
%T% Ecpp sieve(23): 0.020000
% Testing if N is a norm in Q(sqrt(-31)) where (h, g)=(3, 1)
% next D is D_229 = 31 at 2651.100000s
%T% Ecpp sieve(31): 0.020000
% 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(-211)) where (h, g)=(3, 1)
% next D is D_234 = 211 at 2651.370000s
%T% Ecpp sieve(211): 0.020000
% Testing if N is a norm in Q(sqrt(-283)) 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(-379)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-499)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-643)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% next D is D_242 = 883 at 2651.720000s
%T% Ecpp sieve(883): 0.030000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-808)) where (h, g)=(6, 2)
% next D is D_261 = 808 at 2651.830000s
%T% Ecpp sieve(808): 0.020000
% Testing if N is a norm in Q(sqrt(-1192)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1363)) where (h, g)=(6, 2)
% next D is D_276 = 1363 at 2652.010000s
%T% Ecpp sieve(1363): 0.020000
% Testing if N is a norm in Q(sqrt(-3427)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-712)) where (h, g)=(8, 2)
% next D is D_578 = 712 at 2652.200000s
%T% Ecpp sieve(712): 0.020000
% Testing if N is a norm in Q(sqrt(-2059)) where (h, g)=(8, 2)
% next D is D_598 = 2059 at 2652.340000s
%T% Ecpp sieve(2059): 0.020000
% Testing if N is a norm in Q(sqrt(-2323)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4747)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-47)) where (h, g)=(5, 1)
% next D is D_1046 = 47 at 2652.570000s
%T% Ecpp sieve(47): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 13
% D[[26]]=47
% A[[26]]=4815760007496359968604711354712898259635212333157083834099528684848387087835169212036
% B[[26]]=298384892763574114808341165754474364410088295257221199064210891612544662554785162326
% m[[26]]=6844030257147308338958987626879535472023254259488404250651523822342230892700371235548712790706491450999737439673551683947750074334362565583573023975152367204135606935032
% Factor [P]=7^1
% Factor [P]=3^1
% Factor [P]=2^3
% End of depth 26 at 2652.740000 s

% N_27=40738275340162549636660640636187711142995561068383358634830498942513279123216495449694718992300544351188913331390188594927083775799777176092696571280668852405569088899
% Pmax[554]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 2652.780000s
% 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 2652.890000s
%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 2653.050000s
%T% Ecpp sieve(67): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 2653.160000s
%T% Ecpp sieve(40): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[27]]=40
% A[[27]]=-123969861986000265033261199498685744108537656839188868362822592771308753389998301366
% B[[27]]=-60742195934914603021746320578639416165593342654098340448515093048397036590872822921
% m[[27]]=40738275340162549636660640636187711142995561068383358634830498942513279123216495449818688854286544616222174530888874339035621432638966044455519164051977605795567390266
% Factor [P]=89491^1
% Factor [P]=1303^1
% Factor [P]=53^1
% Factor [P]=41^1
% Factor [P]=13^1
% Factor [P]=7^1
% Factor [P]=2^1
% End of depth 27 at 2653.340000 s

% N_28=883380377532939240638211870619565581685367573205119240710018085492892249959670829372743985261357947248207344193309026955099994707100372701675472744123847
% Pmax[509]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 2653.380000s
% 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 2653.460000s
%T% Ecpp sieve(7): 0.030000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 2653.580000s
%T% Ecpp sieve(11): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[28]]=11
% A[[28]]=-19770467907099421031701445692603738239648139031125770088104232915053071168628
% B[[28]]=-16902528344670022395195186073636183346377151137527055573292131363112337343558
% m[[28]]=883380377532939240638211870619565581685367573205119240710018085492892249959690599840651084682389648693899947931548675094131120477188476934590525815292476
% Factor [P]=521^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 28 at 2653.750000 s

% N_29=141295645798614721791140734264165959962470821050083051936983059099950775745311996135740736513498024423208564928270741377820076851757593879493046355613
% Pmax[496]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 2653.780000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[29]]=1
% Factor [P]=43^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 29 at 2653.910000 s

% N_30=182552513951698606965298106284452144654355065956179653665352789534820123701953483379509995495475483750915458563657288601834724614673893901153806661
% Pmax[486]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 2653.950000s
% 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 2654.030000s
%T% Ecpp sieve(4): 0.040000
%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 2654.250000s
%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(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 2654.380000s
%T% Ecpp sieve(19): 0.030000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 2654.480000s
%T% Ecpp sieve(43): 0.030000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 2654.590000s
%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 2654.710000s
%T% Ecpp sieve(163): 0.030000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 2654.840000s
%T% Ecpp sieve(20): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 8
% D[[30]]=20
% A[[30]]=-26173627737411679265493319687524465309350016440845591838687963185976309262
% B[[30]]=-1502518999383841518814444967388708957150045846349225152417449174707170110
% m[[30]]=182552513951698606965298106284452144654355065956179653665352789534820123728127111116921674760968803438439923873007305042680316453361857087130115924
% Factor [P]=89521^1
% Factor [P]=929^1
% Factor [P]=281^1
% Factor [P]=101^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 30 at 2654.970000 s

% N_31=6445227322127979481145411338830757507916470537637495912945215787482195771784352534315048504326878503163717924108380949098047902341763
% Pmax[442]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 2655.000000s
% 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 2655.060000s
%T% Ecpp sieve(3): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[31]]=3
% A[[31]]=891744431801256910993245188781423612921910983117866716074139560112
% B[[31]]=-2885925683777700894903709740971394207565758616863121424313286092094
% m[[31]]=6445227322127979481145411338830757507916470537637495912945215787481304027352551277404055259138097079550796013125263082381973762781652
% Factor [P]=19^1
% Factor [P]=13^1
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 31 at 2655.250000 s

% N_32=931929919336029421796618180860433416413601870682113347736439529711004052537962879902263629140846888309831696518979624404565321397
% Pmax[429]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 2655.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 2655.340000s
%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 2655.500000s
%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 2655.660000s
%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 2655.740000s
%T% Ecpp sieve(43): 0.020000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 2655.820000s
%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(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 2655.910000s
%T% Ecpp sieve(123): 0.020000
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 2655.990000s
%T% Ecpp sieve(267): 0.020000
% Testing if N is a norm in Q(sqrt(-132)) where (h, g)=(-4, 4)
% next D is D_31 = 132 at 2656.070000s
%T% Ecpp sieve(132): 0.010000
% Testing if N is a norm in Q(sqrt(-1012)) where (h, g)=(-4, 4)
% next D is D_51 = 1012 at 2656.150000s
%T% Ecpp sieve(1012): 0.010000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-291)) where (h, g)=(4, 2)
% next D is D_77 = 291 at 2656.240000s
%T% Ecpp sieve(291): 0.020000
% Testing if N is a norm in Q(sqrt(-388)) where (h, g)=(4, 2)
% next D is D_82 = 388 at 2656.320000s
%T% Ecpp sieve(388): 0.010000
% Testing if N is a norm in Q(sqrt(-772)) where (h, g)=(4, 2)
% next D is D_87 = 772 at 2656.390000s
%T% Ecpp sieve(772): 0.020000
% Testing if N is a norm in Q(sqrt(-1507)) where (h, g)=(4, 2)
% next D is D_95 = 1507 at 2656.470000s
%T% Ecpp sieve(1507): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 14
% D[[32]]=1507
% A[[32]]=29498001648706621066519958210830139319415193167530923637123146874
% B[[32]]=1377029196066489240662236948122354033959361796529911661930068396
% m[[32]]=931929919336029421796618180860433416413601870682113347736439529681506050889256258835743670930016748990416503351448700767442174524
% Factor [P]=7699^1
% Factor [P]=3329^1
% Factor [P]=41^1
% Factor [P]=37^1
% Factor [P]=13^1
% Factor [P]=2^2
% End of depth 32 at 2656.560000 s

% N_33=460941929718332816000445803852678912351186194358380101283199555361378273131014311356651411663356140093340038286080941
% Pmax[388]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 2656.590000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[33]]=-1
% Factor [P]=2903^1
% Factor [P]=7^1
% Factor [P]=5^1
% Factor [P]=2^2
% End of depth 33 at 2656.640000 s

% N_34=1134151689676523832489655538242898755846627120610157229671767027610300362017160354698714166781546528451700305807
% Pmax[369]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 2656.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 2656.700000s
%T% Ecpp sieve(3): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 2656.800000s
%T% Ecpp sieve(7): 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 2656.870000s
%T% Ecpp sieve(43): 0.010000
% Extra square factor: 3
% Factorization completed using trial division only
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 2656.920000s
%T% Ecpp sieve(24): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[34]]=24
% A[[34]]=-64326821616981318649046117938009095096031464251377887722
% B[[34]]=-4075673662941912248413101132753899137533563895620766491
% m[[34]]=1134151689676523832489655538242898755846627120610157229736093849227281680666206472636723261877577992703078193530
% Factor [P]=11^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 34 at 2657.000000 s

% N_35=10310469906150216658996868529480897780423882914637792997600853174793469824238240660333847835250709024573438123
% Pmax[363]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 2657.020000s
% 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 2657.060000s
%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 2657.120000s
%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 2657.170000s
%T% Ecpp sieve(43): 0.010000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 2657.220000s
%T% Ecpp sieve(232): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[35]]=232
% A[[35]]=5062939705502342442086559156170862251404937961475423922
% B[[35]]=259380239149818233069305089018686492215832463956072863
% m[[35]]=10310469906150216658996868529480897780423882914637792992537913469291127382151681504162985583845771063098014202
% Factor [P]=2^1
% End of depth 35 at 2657.280000 s

% N_36=5155234953075108329498434264740448890211941457318896496268956734645563691075840752081492791922885531549007101
% Pmax[362]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 2657.290000s
% 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 2657.330000s
%T% Ecpp sieve(4): 0.030000
%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 2657.440000s
%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(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 2657.510000s
%T% Ecpp sieve(20): 0.010000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 2657.560000s
%T% Ecpp sieve(35): 0.010000
% Extra square factor: 89
% 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 2657.620000s
%T% Ecpp sieve(52): 0.020000
% Extra square factor: 25
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 2657.690000s
%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 2657.730000s
%T% Ecpp sieve(235): 0.010000
% Extra square factor: 7
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1435)) where (h, g)=(-4, 4)
% next D is D_52 = 1435 at 2657.790000s
%T% Ecpp sieve(1435): 0.010000
% Testing if N is a norm in Q(sqrt(-763)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-772)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1027)) where (h, g)=(4, 2)
% next D is D_90 = 1027 at 2657.870000s
%T% Ecpp sieve(1027): 0.010000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1555)) where (h, g)=(4, 2)
% next D is D_96 = 1555 at 2657.930000s
%T% Ecpp sieve(1555): 0.020000
% Testing if N is a norm in Q(sqrt(-260)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-820)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1060)) where (h, g)=(8, 4)
% next D is D_114 = 1060 at 2658.010000s
%T% Ecpp sieve(1060): 0.020000
% Testing if N is a norm in Q(sqrt(-1780)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2020)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2212)) where (h, g)=(8, 4)
% next D is D_135 = 2212 at 2658.090000s
%T% Ecpp sieve(2212): 0.010000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-6580)) where (h, g)=(16, 8)
% next D is D_188 = 6580 at 2658.160000s
%T% Ecpp sieve(6580): 0.010000
% 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(-283)) where (h, g)=(3, 1)
% next D is D_235 = 283 at 2658.280000s
%T% Ecpp sieve(283): 0.010000
% Testing if N is a norm in Q(sqrt(-307)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-331)) 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(-212)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-436)) where (h, g)=(6, 2)
% next D is D_254 = 436 at 2658.400000s
%T% Ecpp sieve(436): 0.010000
% Extra square factor: 7
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-515)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-707)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1108)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1603)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1963)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2515)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-3523)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2132)) where (h, g)=(12, 4)
% next D is D_327 = 2132 at 2658.560000s
%T% Ecpp sieve(2132): 0.010000
% Extra square factor: 101
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-2740)) where (h, g)=(12, 4)
% next D is D_343 = 2740 at 2658.620000s
%T% Ecpp sieve(2740): 0.020000
% Testing if N is a norm in Q(sqrt(-3115)) where (h, g)=(12, 4)
% next D is D_349 = 3115 at 2658.680000s
%T% Ecpp sieve(3115): 0.010000
% Testing if N is a norm in Q(sqrt(-3835)) where (h, g)=(12, 4)
% next D is D_360 = 3835 at 2658.730000s
%T% Ecpp sieve(3835): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-3892)) where (h, g)=(12, 4)
% next D is D_362 = 3892 at 2658.770000s
%T% Ecpp sieve(3892): 0.020000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-4795)) where (h, g)=(12, 4)
% next D is D_375 = 4795 at 2658.840000s
%T% Ecpp sieve(4795): 0.010000
% Testing if N is a norm in Q(sqrt(-5395)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-6955)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-8260)) where (h, g)=(24, 8)
% next D is D_444 = 8260 at 2658.910000s
%T% Ecpp sieve(8260): 0.010000
% Testing if N is a norm in Q(sqrt(-11620)) where (h, g)=(24, 8)
% Testing if N is a norm in Q(sqrt(-13780)) where (h, g)=(24, 8)
% next D is D_475 = 13780 at 2658.980000s
%T% Ecpp sieve(13780): 0.020000
% Testing if N is a norm in Q(sqrt(-14980)) where (h, g)=(24, 8)
% next D is D_483 = 14980 at 2659.030000s
%T% Ecpp sieve(14980): 0.030000
% Testing if N is a norm in Q(sqrt(-18340)) where (h, g)=(24, 8)
% next D is D_492 = 18340 at 2659.090000s
%T% Ecpp sieve(18340): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 26
% D[[36]]=18340
% A[[36]]=-2140727509734872636562646509291358085936156909875714148
% B[[36]]=-29571849863128507499912177171364443836921076552906825
% m[[36]]=5155234953075108329498434264740448890211941457318896498409684244380436327638487261372850877859042441424721250
% Factor [P]=5^4
% Factor [P]=2^1
% End of depth 36 at 2659.170000 s

% N_37=4124187962460086663598747411792359112169553165855117198727747395504349062110789809098280702287233953139777
% Pmax[351]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 2659.190000s
% 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 2659.220000s
%T% Ecpp sieve(3): 0.020000
% Extra square factor: 53
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[37]]=3
% A[[37]]=115256287287015328016159767600343544329277998967477886
% B[[37]]=32724812658762644848060154705214440441525116909893552
% m[[37]]=4124187962460086663598747411792359112169553165855117083471460108489021045951022208754736373009234985661892
% Factor [P]=53^2
% Factor [P]=2^2
% End of depth 37 at 2659.300000 s

% N_38=367051260453905897436698772854428543268917156092481050504757930623800377888129424061475291296656727097
% Pmax[338]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 2659.320000s
% 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 2659.350000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[38]]=3
% A[[38]]=1087323464971842717133582713210788154049792443089414
% B[[38]]=308724647724175894793020327407683400391746385942392
% m[[38]]=367051260453905897436698772854428543268917156092479963181292958781083244305416213273321241504213637684
% Factor [P]=37963^1
% Factor [P]=13^1
% Factor [P]=3^2
% Factor [P]=2^2
% End of depth 38 at 2659.410000 s

% N_39=20659525460907949814197110324832058884421941432204229173057446104241131564304076848179505050251
% Pmax[314]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 2659.430000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[39]]=-1
% Factor [P]=19^1
% Factor [P]=5^3
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 39 at 2659.460000 s

% N_40=1449791260414592969417341075426811149783995889979244152495259375736219758898531708644175793
% Pmax[300]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 2659.480000s
% 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 2659.500000s
%T% Ecpp sieve(4): 0.030000
%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 2659.590000s
%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 2659.630000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[40]]=8
% A[[40]]=1609929583004549422721776232307504734053656858
% B[[40]]=633175704230781573051378352021318366390615874
% m[[40]]=1449791260414592969417341075426811149783995888369314569490709953014443526591026974590518936
% Factor [P]=379^1
% Factor [P]=3^1
% Factor [P]=2^3
% End of depth 40 at 2659.680000 s

% N_41=159387781487971962336998798969526291752857947270153316786577611369222023591801558332291
% Pmax[287]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 2659.690000s
% 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 2659.710000s
%T% Ecpp sieve(8): 0.020000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 2659.760000s
%T% Ecpp sieve(67): 0.010000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 2659.790000s
%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 2659.820000s
%T% Ecpp sieve(232): 0.020000
% Testing if N is a norm in Q(sqrt(-136)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-328)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-355)) where (h, g)=(4, 2)
% next D is D_81 = 355 at 2659.870000s
%T% Ecpp sieve(355): 0.020000
% Testing if N is a norm in Q(sqrt(-955)) where (h, g)=(4, 2)
% next D is D_88 = 955 at 2659.910000s
%T% Ecpp sieve(955): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 7
% D[[41]]=955
% A[[41]]=-18893624855927198576594387443060285607451503
% B[[41]]=-542036170578177634831158056685691215299671
% m[[41]]=159387781487971962336998798969526291752857966163778172713776187963609466652087165783795
% Factor [P]=5^1
% End of depth 41 at 2659.950000 s

% N_42=31877556297594392467399759793905258350571593232755634542755237592721893330417433156759
% Pmax[285]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 2659.970000s
% 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 2659.990000s
%T% Ecpp sieve(3): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 2660.050000s
%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 2660.080000s
%T% Ecpp sieve(67): 0.010000
% 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 2660.120000s
%T% Ecpp sieve(15): 0.010000
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 2660.150000s
%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 2660.190000s
%T% Ecpp sieve(51): 0.010000
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 2660.220000s
%T% Ecpp sieve(123): 0.020000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 2660.260000s
%T% Ecpp sieve(235): 0.010000
% Testing if N is a norm in Q(sqrt(-120)) where (h, g)=(-4, 4)
% next D is D_30 = 120 at 2660.290000s
%T% Ecpp sieve(120): 0.010000
% Testing if N is a norm in Q(sqrt(-195)) where (h, g)=(-4, 4)
% next D is D_33 = 195 at 2660.330000s
%T% Ecpp sieve(195): 0.010000
% Testing if N is a norm in Q(sqrt(-312)) where (h, g)=(-4, 4)
% next D is D_36 = 312 at 2660.360000s
%T% Ecpp sieve(312): 0.010000
% Testing if N is a norm in Q(sqrt(-408)) where (h, g)=(-4, 4)
% next D is D_39 = 408 at 2660.390000s
%T% Ecpp sieve(408): 0.020000
% Testing if N is a norm in Q(sqrt(-435)) where (h, g)=(-4, 4)
% next D is D_40 = 435 at 2660.430000s
%T% Ecpp sieve(435): 0.010000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-760)) where (h, g)=(-4, 4)
% next D is D_49 = 760 at 2660.450000s
%T% Ecpp sieve(760): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 15
% D[[42]]=760
% A[[42]]=-8688132788798592237488244717399088356668006
% B[[42]]=-261641010171179431215503177215180271904435
% m[[42]]=31877556297594392467399759793905258350571601920888423341347475080966610729505789824766
% Factor [P]=2^1
% End of depth 42 at 2660.510000 s

% N_43=15938778148797196233699879896952629175285800960444211670673737540483305364752894912383
% Pmax[284]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 2660.520000s
% 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 2660.540000s
%T% Ecpp sieve(11): 0.020000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 2660.580000s
%T% Ecpp sieve(88): 0.010000
% Testing if N is a norm in Q(sqrt(-1507)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-83)) where (h, g)=(3, 1)
% next D is D_231 = 83 at 2660.620000s
%T% Ecpp sieve(83): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[43]]=83
% A[[43]]=7170273221943195616911466756622256050834757
% B[[43]]=385619428437978065110480089998817288569401
% m[[43]]=15938778148797196233699879896952629175285793790170989727478120629016548742496844077627
% Factor [P]=227^1
% Factor [P]=7^1
% Factor [P]=3^1
% End of depth 43 at 2660.660000 s

% N_44=3343565795845856143003960540581629782942268468674426206729205082655034349170724581
% Pmax[271]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 2660.670000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 2660.690000s
%T% Ecpp sieve(3): 0.020000
% Extra square factor: 55
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[44]]=3
% A[[44]]=7155551498232741676087433172072224842541
% B[[44]]=-66640981550743392737968511031841050830891
% m[[44]]=3343565795845856143003960540581629782942261313122927973987528995221862276945882041
% Factor [P]=379^1
% Factor [P]=3^1
% End of depth 44 at 2660.770000 s

% N_45=2940691113320893705368478927512427249729341524294571656981116090784399539969993
% Pmax[261]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 2660.790000s
% 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 2660.810000s
%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 2660.870000s
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[45]]=4
% A[[45]]=-1561561497875925354288139589737437993936
% B[[45]]=-1526785032481248749543624668065335210563
% m[[45]]=2940691113320893705368478927512427249730903085792447582335404230374136977963930
% Factor [P]=809^1
% Factor [P]=41^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 45 at 2660.910000 s

% N_46=8865781643464963385596427168477877686185604286509836239667774820989891097
% Pmax[243]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 2660.930000s
% 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 2660.940000s
%T% Ecpp sieve(4): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[46]]=4
% A[[46]]=-1739560411029688650467493636925833248
% B[[46]]=-2847676954564811334025102463368765061
% m[[46]]=8865781643464963385596427168477877687925164697539524890135268457915724346
% Factor [P]=51421^1
% Factor [P]=2129^1
% Factor [P]=2^1
% End of depth 46 at 2660.990000 s

% N_47=40492151721010275411035501934403663971047410779811203319532390897
% Pmax[215]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 2661.000000s
% 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 2661.010000s
%T% Ecpp sieve(4): 0.030000
%T% Ecpp sieve(4): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[47]]=4
% A[[47]]=-314523244138504526756624905385102
% B[[47]]=-125542558302584963987243009871464
% m[[47]]=40492151721010275411035501934403978494291549284337959944437776000
% Factor [P]=457^1
% Factor [P]=17^2
% Factor [P]=5^3
% Factor [P]=2^7
% End of depth 47 at 2661.080000 s

% N_48=19161823253527535629460365637944535642358557996495290457
% Pmax[184]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 2661.090000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[48]]=1
% Factor [P]=19^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 48 at 2661.100000 s

% N_49=56028722963530805934094636368258876147247245603787399
% Pmax[176]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 2661.110000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[49]]=1
% Factor [P]=5^2
% Factor [P]=2^3
% End of depth 49 at 2661.130000 s

% N_50=280143614817654029670473181841294380736236228018937
% Pmax[168]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 2661.140000s
% 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 2661.140000s
%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 2661.170000s
%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 2661.210000s
%T% Ecpp sieve(8): 0.020000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 2661.240000s
%T% Ecpp sieve(67): 0.000000
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 2661.250000s
%T% Ecpp sieve(24): 0.010000
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 2661.270000s
%T% Ecpp sieve(123): 0.010000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 2661.280000s
%T% Ecpp sieve(232): 0.010000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-372)) where (h, g)=(-4, 4)
% next D is D_38 = 372 at 2661.310000s
%T% Ecpp sieve(372): 0.010000
% Testing if N is a norm in Q(sqrt(-708)) where (h, g)=(-4, 4)
% next D is D_47 = 708 at 2661.330000s
%T% Ecpp sieve(708): 0.000000
% Testing if N is a norm in Q(sqrt(-219)) where (h, g)=(4, 2)
% next D is D_75 = 219 at 2661.340000s
%T% Ecpp sieve(219): 0.010000
% Testing if N is a norm in Q(sqrt(-292)) where (h, g)=(4, 2)
% next D is D_78 = 292 at 2661.360000s
%T% Ecpp sieve(292): 0.010000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-328)) where (h, g)=(4, 2)
% next D is D_80 = 328 at 2661.380000s
%T% Ecpp sieve(328): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 13
% D[[50]]=328
% A[[50]]=-5966194351551543670365966
% B[[50]]=-1818753077467960899045458
% m[[50]]=280143614817654029670473187807488732287779898384904
% Factor [P]=163^1
% Factor [P]=29^2
% Factor [P]=2^3
% End of depth 50 at 2661.400000 s

% N_51=255450725853729154664029445488762950445879411
% Pmax[148]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 2661.410000s
% 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 2661.420000s
%T% Ecpp sieve(3): 0.010000
% 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(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 2661.450000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[51]]=8
% A[[51]]=-30521455664326490634034
% B[[51]]=-3358639001617117062081
% m[[51]]=255450725853729154664059966944427276936513446
% Factor [P]=3^3
% Factor [P]=2^1
% End of depth 51 at 2661.470000 s

% N_52=4730568997291280641927036424896801424750249
% Pmax[142]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 2661.480000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[52]]=-1
% Factor [P]=2^3
% End of depth 52 at 2661.490000 s

% N_53=591321124661410080240879553112100178093781
% Pmax[139]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 2661.500000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[53]]=-1
% Factor [P]=5^1
% Factor [P]=2^2
% End of depth 53 at 2661.510000 s

% N_54=29566056233070504012043977655605008904689
% Pmax[135]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 2661.520000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[54]]=-1
% Factor [P]=3677^1
% Factor [P]=17^1
% Factor [P]=11^2
% Factor [P]=2^4
% End of depth 54 at 2661.520000 s

% N_55=244312391189805064864411406208787
% Pmax[108]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 2661.520000s
% 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 2661.530000s
%T% Ecpp sieve(3): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[55]]=3
% A[[55]]=-28601615120213096
% B[[55]]=-7284622554267262
% m[[55]]=244312391189805093466026526421884
% Factor [P]=19^3
% Factor [P]=13^1
% Factor [P]=7^2
% Factor [P]=2^2
% End of depth 55 at 2661.530000 s

% N_56=13979294938539144129807937
% Pmax[84]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 2661.530000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[56]]=-1
% Factor [P]=8171^1
% Factor [P]=11^1
% Factor [P]=3^4
% Factor [P]=2^6
% End of depth 56 at 2661.540000 s

% N_57=30002150087705009
% Pmax[55]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 2661.540000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[57]]=-1
% Factor [P]=1549^1
% Factor [P]=311^1
% Factor [P]=281^1
% Factor [P]=2^4
% End of depth 57 at 2661.540000 s

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

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

% N_60=36073
% Pmax[16]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 2661.540000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[60]]=-1
% Factor [P]=167^1
% Factor [P]=3^3
% Factor [P]=2^3
% Cofactor is 1
% End of depth 60 at 2661.540000 s

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


% Time for building is 1760.800000 s

% Starting phase 2: proving
% Starting proving job for step 0
% D=163 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(163)=1
% Entering AEcModProveLarge
%T% ProveStep(163): 3.770000
% N_0 is prime
% Time for proof[0] is 3.770000 s

% Starting proving job for step 1
% 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): 3.290000
% N_1 is prime
% Time for proof[1] is 3.290000 s

% Starting proving job for step 2
% 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): 3.210000
% N_2 is prime
% Time for proof[2] is 3.210000 s

% Starting proving job for step 3
% 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): 3.030000
% N_3 is prime
% Time for proof[3] is 3.030000 s

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

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

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

% Starting proving job for step 7
% D=707 h=6 g=2 invcode=11 (Stark's) g0=2
%T% Factor of degree 1 found: 9.910000
%T% one root in FindG2G3s: 9.910000s
% Using Stark's theorem
% E found
%T% find E: 10.170000
% Suggested twist(707)=1
% Entering AEcModProveLarge
%T% ProveStep(707): 12.520000
% N_7 is prime
% Time for proof[7] is 12.520000 s

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

% Starting proving job for step 9
%T% ProveStep(1): 0.910000
% N_9 is prime
% Time for proof[9] is 0.910000 s

% Starting proving job for step 10
% 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): 1.920000
% N_10 is prime
% Time for proof[10] is 1.920000 s

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

% Starting proving job for step 12
% 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): 1.430000
% N_12 is prime
% Time for proof[12] is 1.430000 s

% Starting proving job for step 13
% 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): 1.360000
% N_13 is prime
% Time for proof[13] is 1.360000 s

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

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

% Starting proving job for step 16
% D=739 h=5 g=1 invcode=11 (Stark's) g0=1
%T% Factor of degree 1 found: 5.400000
%T% one root in FindG2G3s: 5.400000s
% Using Stark's theorem
% E found
%T% find E: 5.400000
% Suggested twist(739)=1
% Entering AEcModProveLarge
%T% ProveStep(739): 6.550000
% N_16 is prime
% Time for proof[16] is 6.550000 s

% Starting proving job for step 17
% 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
% Using the 8 | D theorem
% E found
%T% find E: 0.250000
% Suggested twist(88)=1
% Entering AEcModProveLarge
%T% ProveStep(88): 1.360000
% N_17 is prime
% Time for proof[17] is 1.360000 s

% Starting proving job for step 18
% D=319 h=10 g=2 invcode=12 (Stark's with f/sqrt(2)) g0=2
%T% Factor of degree 1 found: 4.970000
%T% one root in FindG2G3s: 4.970000s
% Using Stark's theorem
% E found
%T% find E: 5.100000
% Suggested twist(319)=1
% Entering AEcModProveLarge
%T% ProveStep(319): 6.160000
% N_18 is prime
% Time for proof[18] is 6.160000 s

% Starting proving job for step 19
% 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.950000
% N_19 is prime
% Time for proof[19] is 0.950000 s

% Starting proving job for step 20
%T% ProveStep(-1): 0.120000
% N_20 is prime
% Time for proof[20] is 0.120000 s

% Starting proving job for step 21
% D=328 h=4 g=2 invcode=3 (f1^2/sqrt(2)) g0=2
%T% one root in GetInvariant: 0.100000s
% u has been computed
% Using the 8 | D theorem
% E found
%T% find E: 0.290000
% Suggested twist(328)=1
% Entering AEcModProveLarge
%T% ProveStep(328): 1.190000
% N_21 is prime
% Time for proof[21] is 1.190000 s

% Starting proving job for step 22
% Entering FindEForD0mod3
% D=1320 h=-8 g=8 invcode=10 (w3) g0=8
%T% one root in GetInvariant: 0.000000s
% u has been computed
%T% FindW: 0.240000
% E found
%T% find E: 0.240000
% Suggested twist(1320)=1
% Entering AEcModProveLarge
%T% ProveStep(1320): 0.980000
% N_22 is prime
% Time for proof[22] is 0.980000 s

% Starting proving job for step 23
% D=163 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(163)=-1
% Entering AEcModProveLarge
%T% ProveStep(163): 0.640000
% N_23 is prime
% Time for proof[23] is 0.640000 s

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

% Starting proving job for step 25
% D=52 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.120000
% Suggested twist(52)=1
% Entering AEcModProveLarge
%T% ProveStep(52): 0.670000
% N_25 is prime
% Time for proof[25] is 0.670000 s

% Starting proving job for step 26
% D=47 h=5 g=1 invcode=12 (Stark's with f/sqrt(2)) g0=1
%T% Factor of degree 2 found: 1.900000
%T% one root in FindG2G3s: 1.950000s
% Using Stark's theorem
% E found
%T% find E: 1.950000
% Suggested twist(47)=1
% Entering AEcModProveLarge
%T% ProveStep(47): 2.420000
% N_26 is prime
% Time for proof[26] is 2.420000 s

% Starting proving job for step 27
% D=40 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.050000
% E found
%T% find E: 0.050000
% Entering AEcModProveLarge
%T% ProveStep(40): 0.510000
% N_27 is prime
% Time for proof[27] is 0.510000 s

% Starting proving job for step 28
% 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.010000
% Suggested twist(11)=1
% Entering AEcModProveLarge
%T% ProveStep(11): 0.360000
% N_28 is prime
% Time for proof[28] is 0.360000 s

% Starting proving job for step 29
%T% ProveStep(1): 0.150000
% N_29 is prime
% Time for proof[29] is 0.150000 s

% Starting proving job for step 30
% 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.360000
% N_30 is prime
% Time for proof[30] is 0.360000 s

% Starting proving job for step 31
% 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.220000
% N_31 is prime
% Time for proof[31] is 0.220000 s

% Starting proving job for step 32
% D=1507 h=4 g=2 invcode=11 (Stark's) g0=2
%T% one root in FindG2G3s: 0.020000s
% Using Stark's theorem
% E found
%T% find E: 0.050000
% Suggested twist(1507)=1
% Entering AEcModProveLarge
%T% ProveStep(1507): 0.290000
% N_32 is prime
% Time for proof[32] is 0.290000 s

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

% Starting proving job for step 34
% 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.010000
% E found
%T% find E: 0.020000
% Suggested twist(24)=1
% Entering AEcModProveLarge
%T% ProveStep(24): 0.170000
% N_34 is prime
% Time for proof[34] is 0.170000 s

% Starting proving job for step 35
% 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.020000
% E found
%T% find E: 0.020000
% Entering AEcModProveLarge
% Twisting
%T% ProveStep(232): 0.330000
% N_35 is prime
% Time for proof[35] is 0.330000 s

% Starting proving job for step 36
% D=18340 h=24 g=8 invcode=5 (f^2/sqrt(2)) g0=8
%T% Factor of degree 1 found: 0.380000
%T% one root in GetInvariant: 0.380000s
% u has been computed
%T% FindJ: 0.430000
% E found
%T% find E: 0.430000
% Entering AEcModProveLarge
%T% ProveStep(18340): 0.590000
% N_36 is prime
% Time for proof[36] is 0.590000 s

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

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

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

% Starting proving job for step 40
% 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.100000
% N_40 is prime
% Time for proof[40] is 0.100000 s

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

% Starting proving job for step 42
% D=760 h=-4 g=4 invcode=3 (f1^2/sqrt(2)) g0=4
%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(760): 0.180000
% N_42 is prime
% Time for proof[42] is 0.180000 s

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

% Starting proving job for step 44
% 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.070000
% N_44 is prime
% Time for proof[44] is 0.070000 s

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

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

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

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

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

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

% Starting proving job for step 51
% 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_51 is prime
% Time for proof[51] is 0.020000 s

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

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

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

% Starting proving job for step 55
% 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_55 is prime
% Time for proof[55] is 0.010000 s

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

% Starting proving job for step 57
% Using complete factorization theorem
%T% ProveStep(-1): 0.000000
% N_57 is prime
% Time for proof[57] is 0.000000 s

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

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

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

% Starting proving job for step 61
% Using complete factorization theorem
%T% ProveStep(-1): 0.000000
% N_61 is prime
% Time for proof[61] is 0.000000 s
% Time for proving  is 73.950000 s
% Total time is        1834.750000 s
This number is prime
%T% PrintCertif: 0.150000
% Time for this number is 1836.130000s

Working on 17590888313741206941190342917199082290640108985794480079887796762698764418923209696546074222556808104133313979394095068578065707959713988317010565663270007214484386916332287052127161223421639666431165171197397246353556015552968901819009016432082137259494295722498366763718819547288170491520023508834979741395440290770668719791182481
% Performing a quick factorization
% This number might be prime
% Entering ECPP: delay mode
% Starting phase 1: building the sequence of primes
% N_0=17590888313741206941190342917199082290640108985794480079887796762698764418923209696546074222556808104133313979394095068578065707959713988317010565663270007214484386916332287052127161223421639666431165171197397246353556015552968901819009016432082137259494295722498366763718819547288170491520023508834979741395440290770668719791182481
% Pmax[1101]=4900000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 2.810000
% next D is D_1 = 0 at 2739.440000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.030000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.940000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.980000
% P-1: entering Step 2 up to b2=100000 at 2746.630000
% Time for P-1.II is 4.940000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.130000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.130000
% P-1: entering Step 2 up to b2=100000 at 2759.090000
% Time for P-1.II is 5.180000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 2764.540000s
%T% Ecpp sieve(4): 2.370000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 4.800000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.840000
% P-1: entering Step 2 up to b2=100000 at 2774.770000
% Time for P-1.II is 4.680000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.040000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 2787.730000
% Time for P-1.II is 4.920000
%T% Ecpp sieve(4): 2.370000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.460000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.180000
% P-1: entering Step 2 up to b2=100000 at 2803.920000
% Time for P-1.II is 5.220000
% Entering RHO4 with itmax=5000 cmax=5000
% Time for rho is 5.030000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.980000
% P-1: entering Step 2 up to b2=100000 at 2817.390000
% Time for P-1.II is 4.920000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 2822.580000s
%T% Ecpp sieve(7): 1.380000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.160000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.090000
% P-1: entering Step 2 up to b2=100000 at 2831.470000
% Time for P-1.II is 5.080000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.930000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.990000
% P-1: entering Step 2 up to b2=100000 at 2843.720000
% Time for P-1.II is 4.940000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 2848.930000s
%T% Ecpp sieve(8): 2.310000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.750000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.860000
% P-1: entering Step 2 up to b2=100000 at 2858.080000
% Factor[P-1.II]=11065427
% Time for P-1.II is 4.910000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.150000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=228402329
% Time for P-1.I is 3.370000
% P-1: entering Step 2 up to b2=100000 at 2870.770000
% Time for P-1.II is 4.910000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 2875.950000s
%T% Ecpp sieve(19): 1.370000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.710000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.820000
% P-1: entering Step 2 up to b2=100000 at 2884.080000
% Time for P-1.II is 4.650000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.950000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 2895.930000
% Factor[P-1.II]=1935282226610970299
% Time for P-1.II is 5.130000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 2901.340000s
%T% Ecpp sieve(67): 1.290000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.250000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.150000
% P-1: entering Step 2 up to b2=100000 at 2910.300000
% Time for P-1.II is 5.200000
% Extra square factor: 5
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.140000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=79994303
% Time for P-1.I is 3.410000
% P-1: entering Step 2 up to b2=100000 at 2924.020000
% Factor[P-1.II]=15220901946137658677617
% Time for P-1.II is 5.150000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 2929.440000s
%T% Ecpp sieve(20): 1.350000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.960000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.010000
% P-1: entering Step 2 up to b2=100000 at 2938.010000
% Time for P-1.II is 4.950000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.920000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 2950.130000
% Time for P-1.II is 4.930000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 2955.330000s
%T% Ecpp sieve(35): 1.340000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.230000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=46025423
% Time for P-1.I is 3.370000
% P-1: entering Step 2 up to b2=100000 at 2964.530000
% Factor[P-1.II]=680588672497
% Time for P-1.II is 5.150000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.200000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.240000
% P-1: entering Step 2 up to b2=100000 at 2977.380000
% Time for P-1.II is 5.210000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 2982.850000s
%T% Ecpp sieve(40): 1.280000
% Entering RHO2 with itmax=5000 cmax=5000
% Factor[RHO2]=6246371
% Time for rho is 4.190000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.860000
% P-1: entering Step 2 up to b2=100000 at 2991.440000
% Time for P-1.II is 4.700000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.950000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 3003.340000
% Time for P-1.II is 4.940000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 3008.550000s
%T% Ecpp sieve(52): 1.310000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.190000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.100000
% P-1: entering Step 2 up to b2=100000 at 3017.400000
% Time for P-1.II is 5.040000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.000000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.980000
% P-1: entering Step 2 up to b2=100000 at 3029.690000
% Time for P-1.II is 4.920000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 3034.890000s
%T% Ecpp sieve(91): 1.290000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.890000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=16573831
% Time for P-1.I is 3.250000
% P-1: entering Step 2 up to b2=100000 at 3043.550000
% Time for P-1.II is 4.910000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.930000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.990000
% P-1: entering Step 2 up to b2=100000 at 3055.620000
% Time for P-1.II is 4.950000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 3060.840000s
%T% Ecpp sieve(148): 1.300000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.920000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.970000
% P-1: entering Step 2 up to b2=100000 at 3069.270000
% Time for P-1.II is 4.930000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.960000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 3081.410000
% Time for P-1.II is 4.960000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 3086.640000s
%T% Ecpp sieve(232): 1.240000
% Extra square factor: 5
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.980000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.020000
% P-1: entering Step 2 up to b2=100000 at 3095.830000
% Time for P-1.II is 5.000000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.070000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.110000
% P-1: entering Step 2 up to b2=100000 at 3108.270000
% Factor[P-1.II]=10117548751
% Time for P-1.II is 5.300000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 3113.850000s
%T% Ecpp sieve(427): 1.260000
% Cofactor after sieve is a probable prime
% Number of D tried was 14
% D[[0]]=427
% A[[0]]=3460351273536276052553879679940246525861061012471832257222991860252896858489794634810878168779076465270864315789520334215980074951008489442254753241958753685597040539
% B[[0]]=369788604458803546039353590535075528969864858623646073573812710884873625557466106491362971232096909711482763760917933024811560940857526393121464010311164900288659233
% m[[0]]=17590888313741206941190342917199082290640108985794480079887796762698764418923209696546074222556808104133313979394095068578065707959713988317010565663270007214484386912871935778590885170867759986490918645336336233881723758329977041566112157942287502448616126943421901492854503757767836275539948557826490299140687048811915034194141943
% Factor [P]=397^1
% End of depth 0 at 3116.060000 s

% N_1=44309542351992964587381216416118595190529241777819849067727447764984293246657958933365426253291708070864770728952380525385555939445123396264510240965415635300968228999677420097206259876241209033982162834600343158392251280428153757093481506151857688787446163585445595699885399893621753842669895611653627957533216747637065577315219
% Pmax[1092]=4900000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 2.810000
% next D is D_1 = 0 at 3118.880000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.020000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.940000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.970000
% P-1: entering Step 2 up to b2=100000 at 3126.050000
% Time for P-1.II is 4.930000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.960000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 3138.190000
% Time for P-1.II is 4.960000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 3143.410000s
%T% Ecpp sieve(8): 2.320000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.100000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.170000
% P-1: entering Step 2 up to b2=100000 at 3153.260000
% Time for P-1.II is 5.120000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.950000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.970000
% P-1: entering Step 2 up to b2=100000 at 3165.560000
% Time for P-1.II is 4.950000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 3170.780000s
%T% Ecpp sieve(11): 1.340000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.100000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.170000
% P-1: entering Step 2 up to b2=100000 at 3179.650000
% Factor[P-1.II]=10761872786243489
% Time for P-1.II is 5.340000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.730000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.840000
% P-1: entering Step 2 up to b2=100000 at 3191.790000
% Factor[P-1.II]=18997603
% Time for P-1.II is 4.870000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 3196.930000s
%T% Ecpp sieve(19): 1.350000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.960000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.010000
% P-1: entering Step 2 up to b2=100000 at 3205.500000
% Time for P-1.II is 4.970000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.950000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.010000
% P-1: entering Step 2 up to b2=100000 at 3217.680000
% Time for P-1.II is 4.960000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 3222.900000s
%T% Ecpp sieve(67): 1.300000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.990000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=63202000441189
% Time for P-1.I is 3.220000
% P-1: entering Step 2 up to b2=100000 at 3231.650000
% Time for P-1.II is 4.640000
% Extra square factor: 11
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.940000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.980000
% P-1: entering Step 2 up to b2=100000 at 3244.140000
% Time for P-1.II is 4.930000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 3249.340000s
%T% Ecpp sieve(40): 1.280000
% Entering RHO2 with itmax=5000 cmax=5000
% Factor[RHO2]=4935223
% Time for rho is 4.200000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.980000
% P-1: entering Step 2 up to b2=100000 at 3258.050000
% Time for P-1.II is 4.920000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.130000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.140000
% P-1: entering Step 2 up to b2=100000 at 3270.500000
% Time for P-1.II is 5.160000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 3275.920000s
%T% Ecpp sieve(115): 1.290000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.010000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.020000
% P-1: entering Step 2 up to b2=100000 at 3284.490000
% Time for P-1.II is 4.970000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.130000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.150000
% P-1: entering Step 2 up to b2=100000 at 3297.000000
% Time for P-1.II is 5.170000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 3302.440000s
%T% Ecpp sieve(187): 1.280000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.930000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.970000
% P-1: entering Step 2 up to b2=100000 at 3310.860000
% Time for P-1.II is 4.930000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.030000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 3323.060000
% Time for P-1.II is 4.940000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 3328.260000s
%T% Ecpp sieve(232): 1.250000
% Extra square factor: 11
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.770000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.870000
% P-1: entering Step 2 up to b2=100000 at 3337.060000
% Time for P-1.II is 4.710000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.000000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=119700527
% Time for P-1.I is 3.200000
% P-1: entering Step 2 up to b2=100000 at 3349.210000
% Time for P-1.II is 4.640000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 3354.120000s
%T% Ecpp sieve(235): 1.280000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.930000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.990000
% P-1: entering Step 2 up to b2=100000 at 3362.560000
% Time for P-1.II is 4.930000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.950000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.980000
% P-1: entering Step 2 up to b2=100000 at 3374.670000
% Time for P-1.II is 4.920000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 3379.860000s
%T% Ecpp sieve(403): 1.260000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.950000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 3388.310000
% Time for P-1.II is 4.940000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.980000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.020000
% P-1: entering Step 2 up to b2=100000 at 3400.500000
% Time for P-1.II is 4.980000
% Testing if N is a norm in Q(sqrt(-520)) where (h, g)=(-4, 4)
% next D is D_42 = 520 at 3405.740000s
%T% Ecpp sieve(520): 1.210000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.730000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.830000
% P-1: entering Step 2 up to b2=100000 at 3413.730000
% Factor[P-1.II]=214982601077
% Time for P-1.II is 4.880000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.940000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.990000
% P-1: entering Step 2 up to b2=100000 at 3425.780000
% Time for P-1.II is 4.940000
% Testing if N is a norm in Q(sqrt(-715)) where (h, g)=(-4, 4)
% next D is D_48 = 715 at 3430.980000s
%T% Ecpp sieve(715): 1.250000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.720000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.840000
% P-1: entering Step 2 up to b2=100000 at 3439.010000
% Time for P-1.II is 4.670000
% Entering RHO2 with itmax=5000 cmax=5000
% Factor[RHO2]=14916379
% Time for rho is 3.910000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.690000
% P-1: entering Step 2 up to b2=100000 at 3450.500000
% Time for P-1.II is 4.400000
% Testing if N is a norm in Q(sqrt(-55)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-136)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-155)) 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 3455.960000s
%T% Ecpp sieve(323): 1.250000
% Entering RHO2 with itmax=5000 cmax=5000
% Factor[RHO2]=9671537
% Time for rho is 4.200000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.980000
% P-1: entering Step 2 up to b2=100000 at 3464.640000
% Time for P-1.II is 4.890000
% Extra square factor: 11
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.700000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.870000
% P-1: entering Step 2 up to b2=100000 at 3477.020000
% Factor[P-1.II]=21455867
% Time for P-1.II is 4.890000
% Testing if N is a norm in Q(sqrt(-667)) where (h, g)=(4, 2)
% next D is D_84 = 667 at 3482.180000s
%T% Ecpp sieve(667): 1.270000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.220000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.250000
% P-1: entering Step 2 up to b2=100000 at 3491.200000
% Time for P-1.II is 5.280000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.990000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.010000
% P-1: entering Step 2 up to b2=100000 at 3503.720000
% Factor[P-1.II]=101455769
% Time for P-1.II is 5.210000
% Testing if N is a norm in Q(sqrt(-955)) where (h, g)=(4, 2)
% next D is D_88 = 955 at 3509.210000s
%T% Ecpp sieve(955): 1.240000
% Extra square factor: 11
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.990000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.000000
% P-1: entering Step 2 up to b2=100000 at 3518.380000
% Time for P-1.II is 4.940000
% Cofactor after sieve is a probable prime
% Number of D tried was 16
% D[[1]]=955
% A[[1]]=-391654941347293521831514275178527809700081614981141275171997311448958762665365137795845213781413068259892291186097302225913609221997026859890098520621550013487741376
% B[[1]]=-4996813259465327737171866041449586089068183479992937331249116732941799430877864935145180261382623639375399435108316914623748171688848317801681205977538540473043450
% m[[1]]=44309542351992964587381216416118595190529241777819849067727447764984293246657958933365426253291708070864770728952380525385555939445123396264510240965415635300968229391332361444499781707755484212509972534681958139533526452425465206052244171516995484632659944998513855592176585990923979756279117608680487847631737369187079065056596
% Factor [P]=2^2
% End of depth 1 at 3524.260000 s

% N_2=11077385587998241146845304104029648797632310444454962266931861941246073311664489733341356563322927017716192682238095131346388984861280849066127560241353908825242057347833090361124945426938871053127493133670489534883381613106366301513061042879248871158164986249628463898044146497730994939069779402170121961907934342296769766264149
% Pmax[1090]=4900000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 2.840000
% next D is D_1 = 0 at 3527.100000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.000000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.980000
% P-1: entering Step 2 up to b2=100000 at 3534.340000
% Time for P-1.II is 4.970000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.030000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Factor[P-1.I]=34534865583770131687
% Time for P-1.I is 3.320000
% P-1: entering Step 2 up to b2=100000 at 3546.900000
% Factor[P-1.II]=6001703843
% Time for P-1.II is 4.710000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 3551.870000s
%T% Ecpp sieve(3): 2.050000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 4.000000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.030000
% P-1: entering Step 2 up to b2=100000 at 3561.190000
% Time for P-1.II is 4.970000
% Entering RHO2 with itmax=5000 cmax=5000
% Factor[RHO2]=5070133
% Time for rho is 4.260000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 3.010000
% P-1: entering Step 2 up to b2=100000 at 3573.690000
% Time for P-1.II is 4.960000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[2]]=3
% A[[2]]=116854763252119141101342853626071838647348984367824853113054348098013820627296821972501688045915631987272428404194239815958777345941151139740459484856879660863652211
% B[[2]]=-101084958751346302958236044567209282835668882176144018940302540640307490512493629042372553276473258521805384896954406143953370018166303841139322212507806217348973355
% m[[2]]=11077385587998241146845304104029648797632310444454962266931861941246073311664489733341356563322927017716192682238095131346388984861280849066127560241353908825242057230978327109005804325596017427055654486321505167058528500052018203499240415582426898656476940333996476625615742303491178980292433461018982221448449485417108902611939
% Factor [P]=643243^1
% Factor [P]=6673^1
% Factor [P]=7^1
% End of depth 2 at 3579.520000 s

% N_3=368674448721167913018837731755786922513763717063555373006173080574889880844935430306071319357976866541265851154877128000014146091058387044583973153164599492227658080071315779662049637052235561022404017130474628468713025255429710820519031480654702180029022165778128220663756259930894168809856666976068367343123246878943
% Pmax[1055]=4900000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 2.680000
% next D is D_1 = 0 at 3582.210000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.020000
% Entering RHO2 with itmax=5000 cmax=5000
% Factor[RHO2]=32354141
% Time for rho is 4.040000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.930000
% P-1: entering Step 2 up to b2=100000 at 3589.430000
% Time for P-1.II is 4.490000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.830000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.800000
% P-1: entering Step 2 up to b2=10000 at 3597.760000
% Time for P-1.II is 0.560000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 3598.560000s
%T% Ecpp sieve(3): 2.040000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.840000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.800000
% P-1: entering Step 2 up to b2=10000 at 3604.450000
% Time for P-1.II is 0.520000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=571952053
% Time for rho is 3.080000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 3608.970000
% Time for P-1.II is 0.500000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.780000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.770000
% P-1: entering Step 2 up to b2=100000 at 3616.270000
% Time for P-1.II is 4.760000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.760000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.800000
% P-1: entering Step 2 up to b2=100000 at 3627.780000
% Time for P-1.II is 4.630000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.770000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.760000
% P-1: entering Step 2 up to b2=100000 at 3639.170000
% Time for P-1.II is 4.770000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.630000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.800000
% P-1: entering Step 2 up to b2=100000 at 3650.590000
% Time for P-1.II is 4.680000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 3655.530000s
%T% Ecpp sieve(7): 1.330000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.950000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.770000
% P-1: entering Step 2 up to b2=10000 at 3660.790000
% Time for P-1.II is 0.530000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.680000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.830000
% P-1: entering Step 2 up to b2=100000 at 3668.010000
% Factor[P-1.II]=1959578687977
% Time for P-1.II is 4.740000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 3673.000000s
%T% Ecpp sieve(11): 1.410000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.840000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.870000
% P-1: entering Step 2 up to b2=100000 at 3681.360000
% Time for P-1.II is 4.800000
% Entering RHO2 with itmax=5000 cmax=5000
% Factor[RHO2]=11510503
% Time for rho is 3.990000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.670000
% P-1: entering Step 2 up to b2=100000 at 3693.030000
% Time for P-1.II is 4.490000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 3697.770000s
%T% Ecpp sieve(43): 1.300000
% Entering RHO2 with itmax=5000 cmax=5000
% Factor[RHO2]=10408231
% Time for rho is 4.050000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.820000
% P-1: entering Step 2 up to b2=100000 at 3706.180000
% Time for P-1.II is 4.710000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.660000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.810000
% P-1: entering Step 2 up to b2=100000 at 3717.570000
% Time for P-1.II is 4.630000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 3722.450000s
%T% Ecpp sieve(163): 1.250000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[3]]=163
% A[[3]]=980503339431754346659262125349225124452433041974991666121109172949150467029553474333288533569363234408574206942989565860177161059822904160416537010430929612092
% B[[3]]=56117263085831938255154909561446266341412584300559055242982516106376517836136444269618036199474527684610163008678144056757129347628358290991683730385995518554
% m[[3]]=368674448721167913018837731755786922513763717063555373006173080574889880844935430306071319357976866541265851154877128000014146091058387044583973153164599492226677576731884025315390374926886335897951584088499636802591916082480560353489478006321413646459658931369554013720766694070717007750033762815651830332692317266852
% Factor [P]=2225173^1
% Factor [P]=2^2
% End of depth 3 at 3724.550000 s

% N_4=41420874772564640257053915780456949023038176926418235009836659955752865153061742874157573294073861508887831547802926783671892712505767758797178146728883494926762725497285382452891345406276987890149618039642270151870429409587542221828311552216548291577740127550706620757213786756211428027172916759242071328014981
% Pmax[1032]=4900000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 2.670000
% next D is D_1 = 0 at 3727.220000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.020000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.800000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.770000
% P-1: entering Step 2 up to b2=10000 at 3731.020000
% Time for P-1.II is 0.520000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.670000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.740000
% P-1: entering Step 2 up to b2=10000 at 3735.130000
% Time for P-1.II is 0.510000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 3735.870000s
%T% Ecpp sieve(3): 2.060000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.780000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.850000
% P-1: entering Step 2 up to b2=100000 at 3744.780000
% Time for P-1.II is 4.760000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.840000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 3753.340000
% Time for P-1.II is 0.510000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.860000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.770000
% P-1: entering Step 2 up to b2=10000 at 3757.690000
% Time for P-1.II is 0.520000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.680000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.730000
% P-1: entering Step 2 up to b2=10000 at 3761.800000
% Time for P-1.II is 0.500000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 3765.900000
% Time for P-1.II is 0.500000
% Extra square factor: 5
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.760000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.770000
% P-1: entering Step 2 up to b2=10000 at 3770.860000
% Time for P-1.II is 0.520000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 3771.610000s
%T% Ecpp sieve(4): 2.350000
% Entering RHO4 with itmax=4000 cmax=4000
% Time for rho is 3.660000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.770000
% P-1: entering Step 2 up to b2=10000 at 3778.610000
% Time for P-1.II is 0.550000
% Entering RHO4 with itmax=4000 cmax=4000
% Factor[RHO4]=7335089
% Time for rho is 3.880000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.770000
% P-1: entering Step 2 up to b2=10000 at 3784.020000
% Time for P-1.II is 0.540000
%T% Ecpp sieve(4): 2.330000
% Entering RHO4 with itmax=4000 cmax=4000
% Time for rho is 3.700000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.800000
% P-1: entering Step 2 up to b2=10000 at 3791.600000
% Time for P-1.II is 0.510000
% Entering RHO4 with itmax=4000 cmax=4000
% Time for rho is 3.670000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 3796.720000
% Time for P-1.II is 0.540000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 3797.500000s
%T% Ecpp sieve(19): 1.360000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.860000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 3802.680000
% Time for P-1.II is 0.520000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.830000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.780000
% P-1: entering Step 2 up to b2=10000 at 3807.020000
% Time for P-1.II is 0.540000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 3807.800000s
%T% Ecpp sieve(67): 1.300000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.800000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.790000
% P-1: entering Step 2 up to b2=10000 at 3812.890000
% Time for P-1.II is 0.520000
% Extra square factor: 3
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.760000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.820000
% P-1: entering Step 2 up to b2=100000 at 3820.910000
% Time for P-1.II is 4.690000
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 3825.830000s
%T% Ecpp sieve(163): 1.260000
% Extra square factor: 5
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.790000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.830000
% P-1: entering Step 2 up to b2=10000 at 3831.590000
% Time for P-1.II is 0.520000
% Extra square factor: 3
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.880000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.790000
% P-1: entering Step 2 up to b2=10000 at 3836.690000
% Time for P-1.II is 0.540000
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 3837.450000s
%T% Ecpp sieve(15): 1.330000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.870000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.780000
% P-1: entering Step 2 up to b2=10000 at 3842.600000
% Time for P-1.II is 0.530000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.740000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.880000
% P-1: entering Step 2 up to b2=100000 at 3849.970000
% Time for P-1.II is 4.650000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 3854.870000s
%T% Ecpp sieve(20): 1.340000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.770000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.780000
% P-1: entering Step 2 up to b2=10000 at 3859.970000
% Time for P-1.II is 0.500000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=11342629
% Time for rho is 3.000000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.740000
% P-1: entering Step 2 up to b2=10000 at 3864.430000
% Time for P-1.II is 0.510000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 3865.180000s
%T% Ecpp sieve(115): 1.300000
% Extra square factor: 3
% Factorization completed using trial division only
% Entering RHO2 with itmax=5000 cmax=5000
% Factor[RHO2]=16851649
% Time for rho is 4.100000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.720000
% P-1: entering Step 2 up to b2=100000 at 3874.220000
% Time for P-1.II is 4.460000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.710000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 3882.310000
% Time for P-1.II is 0.530000
% Testing if N is a norm in Q(sqrt(-228)) where (h, g)=(-4, 4)
% next D is D_34 = 228 at 3883.060000s
%T% Ecpp sieve(228): 1.280000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.860000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.800000
% P-1: entering Step 2 up to b2=10000 at 3888.210000
% Time for P-1.II is 0.520000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.870000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.770000
% P-1: entering Step 2 up to b2=10000 at 3892.580000
% Time for P-1.II is 0.540000
% Testing if N is a norm in Q(sqrt(-372)) where (h, g)=(-4, 4)
% next D is D_38 = 372 at 3893.370000s
%T% Ecpp sieve(372): 1.230000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.820000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.770000
% P-1: entering Step 2 up to b2=10000 at 3898.390000
% Time for P-1.II is 0.540000
% Extra square factor: 5
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.860000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Factor[P-1.I]=25931203
% Time for P-1.I is 0.970000
% P-1: entering Step 2 up to b2=10000 at 3903.690000
% Factor[P-1.II]=51324640251761
% Time for P-1.II is 0.630000
% Testing if N is a norm in Q(sqrt(-708)) where (h, g)=(-4, 4)
% next D is D_47 = 708 at 3904.540000s
%T% Ecpp sieve(708): 1.160000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.810000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.770000
% P-1: entering Step 2 up to b2=10000 at 3909.510000
% Time for P-1.II is 0.530000
% Entering RHO2 with itmax=5000 cmax=5000
% Time for rho is 3.760000
% Entering P-1 Step 1 with b1=7000 cmax1=7000
% Time for P-1.I is 2.860000
% P-1: entering Step 2 up to b2=100000 at 3916.880000
% Factor[P-1.II]=13480463
% Time for P-1.II is 4.860000
% Testing if N is a norm in Q(sqrt(-1380)) where (h, g)=(-8, 8)
% next D is D_59 = 1380 at 3921.970000s
%T% Ecpp sieve(1380): 1.180000
% Cofactor after sieve is a probable prime
% Number of D tried was 13
% D[[4]]=1380
% A[[4]]=359016396574608124242587752728397003025561198778156349415957582704707064388357630140637612952034964784116554440291145342168545308385055097986597917280860002
% B[[4]]=5163327070348434600401711223111887663073283271064396479913611027380379813145274124687597597743839362291265658349416296625129631873519691236832680011723378
% m[[4]]=41420874772564640257053915780456949023038176926418235009836659955752865153061742874157573294073861508887831547802926783671892712505767758797178146728883494567746328922677258210303592677879984864588419261485920735912846704880477833470681411578935339542775343434152180466068444587666119642117818772644154047154980
% Factor [P]=5^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 4 at 3923.960000 s

% N_5=690347912876077337617565263007615817050636282106970583497277665929214419217695714569292888234564358481463859130048779727864878541762795979952969112148058242795772148711287636838393211297999747743140321024765345598547445081341297224511356859648922325712922390569203007767807409794435327368630312877402567452583
% Pmax[1026]=4900000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 2.710000
% next D is D_1 = 0 at 3926.670000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.020000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.930000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Factor[P-1.I]=11208101
% Time for P-1.I is 0.980000
% P-1: entering Step 2 up to b2=10000 at 3930.790000
% Time for P-1.II is 0.510000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.890000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.840000
% P-1: entering Step 2 up to b2=10000 at 3935.230000
% Time for P-1.II is 0.520000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 3935.980000s
%T% Ecpp sieve(11): 1.360000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.660000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 3940.880000
% Time for P-1.II is 0.490000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[5]]=11
% A[[5]]=-6370098035744391547733868317743052261774162069432670206229097929878261862394313321842362941029912559584723334965315935824565293388547921762231313001210084
% B[[5]]=-15727259203281747778911552420393694869133109497154786710254336044364858342823481680000297102805145449125468313781807285456258733257865710142616484671687546
% m[[5]]=690347912876077337617565263007615817050636282106970583497277665929214419217695714569292888234564358481463859130048779727864878541762795979952969112148058249165870184455679184572261529041052009517302390457435551827645374959603159618824678702011863355625481975292537973083743234359728715916552075108715568662668
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 5 at 3942.200000 s

% N_6=57528992739673111468130438583967984754219690175580881958106472160767868268141309547441074019547029873455321594170731643988739878480232998329414092679004854097155848704639932047688460753421000793108532538119629318970447913300263301568723225167655279635456831274378164423645269529977392993046006259059630721889
% Pmax[1023]=1000000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.550000
% next D is D_1 = 0 at 3942.750000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=2749283
% Time for rho is 3.050000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.740000
% P-1: entering Step 2 up to b2=10000 at 3946.760000
% Time for P-1.II is 0.520000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.860000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Factor[P-1.I]=294224382943
% Time for P-1.I is 0.920000
% P-1: entering Step 2 up to b2=10000 at 3951.240000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 3951.960000s
%T% Ecpp sieve(3): 0.480000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.850000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Factor[P-1.I]=47492921506141
% Time for P-1.I is 0.990000
% P-1: entering Step 2 up to b2=10000 at 3956.500000
% Factor[P-1.II]=58089379867
% Time for P-1.II is 0.670000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.840000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.780000
% P-1: entering Step 2 up to b2=10000 at 3961.010000
% Time for P-1.II is 0.530000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=1224193
% Time for rho is 3.130000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 3965.600000
% Time for P-1.II is 0.500000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.880000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.740000
% P-1: entering Step 2 up to b2=10000 at 3969.960000
% Time for P-1.II is 0.520000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.910000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 3974.350000
% Time for P-1.II is 0.510000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.660000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.690000
% P-1: entering Step 2 up to b2=10000 at 3978.410000
% Time for P-1.II is 0.540000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 3979.170000s
%T% Ecpp sieve(4): 0.490000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[6]]=4
% A[[6]]=3636784398812468180386115961422476928514858451210972455225826855047512214873007053638151599496516029822572022810931942979350683584804788296407254584467870
% B[[6]]=7363588972017087678492932752128136325950239567032395047831794692223595560937296868008919352165779510669434798372675934456515031222665051103935701973551392
% m[[6]]=57528992739673111468130438583967984754219690175580881958106472160767868268141309547441074019547029873455321594170731643988739878480232998329414092679004850460371449892171751661572499330944072278250081327147174093143592865788048428561669587016055783119427008702355353491702290179293808188257709851805046254020
% Factor [P]=199153^1
% Factor [P]=29^1
% Factor [P]=13^1
% Factor [P]=5^1
% Factor [P]=2^2
% End of depth 6 at 3980.420000 s

% N_7=38311448413522721955685536858654748186300874239260617493670889959540902584608489064877470956574721181241897362499103893309611748513730847972339311013311700289699989463449160551415682638083738397531371170665842850535407947210846708064401804650690224239859391194357542848940255469508733004338166466421
% Pmax[992]=1000000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.590000
% next D is D_1 = 0 at 3981.010000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.580000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.740000
% P-1: entering Step 2 up to b2=10000 at 3984.540000
% Time for P-1.II is 0.470000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.730000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.770000
% P-1: entering Step 2 up to b2=10000 at 3988.700000
% Time for P-1.II is 0.470000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 3989.350000s
%T% Ecpp sieve(3): 0.460000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.680000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.690000
% P-1: entering Step 2 up to b2=10000 at 3993.360000
% Time for P-1.II is 0.480000
% Extra square factor: 5
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.650000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.750000
% P-1: entering Step 2 up to b2=10000 at 3997.760000
% Time for P-1.II is 0.490000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.690000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Factor[P-1.I]=30149281
% Time for P-1.I is 0.900000
% P-1: entering Step 2 up to b2=10000 at 4002.020000
% Time for P-1.II is 0.480000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.650000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.740000
% P-1: entering Step 2 up to b2=10000 at 4006.050000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 4006.880000s
%T% Ecpp sieve(4): 0.530000
% Entering RHO4 with itmax=4000 cmax=4000
% Factor[RHO4]=16395076314601
% Time for rho is 3.580000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.650000
% P-1: entering Step 2 up to b2=10000 at 4012.030000
% Time for P-1.II is 0.450000
%T% Ecpp sieve(4): 0.510000
% Entering RHO4 with itmax=4000 cmax=4000
% Time for rho is 3.500000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 4017.420000
% Time for P-1.II is 0.470000
% Entering RHO4 with itmax=4000 cmax=4000
% Time for rho is 3.420000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.730000
% P-1: entering Step 2 up to b2=10000 at 4022.210000
% Time for P-1.II is 0.510000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 4022.920000s
%T% Ecpp sieve(7): 0.280000
% Extra square factor: 3
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.660000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.700000
% P-1: entering Step 2 up to b2=10000 at 4027.100000
% Time for P-1.II is 0.510000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 4027.810000s
%T% Ecpp sieve(19): 0.290000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.710000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 4031.710000
% Time for P-1.II is 0.510000
% Extra square factor: 3
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.610000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.700000
% P-1: entering Step 2 up to b2=10000 at 4035.890000
% Time for P-1.II is 0.470000
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 4036.550000s
%T% Ecpp sieve(15): 0.270000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 4037.420000s
%T% Ecpp sieve(20): 0.310000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.730000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 4041.370000
% Time for P-1.II is 0.510000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.650000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.740000
% P-1: entering Step 2 up to b2=10000 at 4045.450000
% Time for P-1.II is 0.500000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 4046.160000s
%T% Ecpp sieve(35): 0.290000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=6750817
% Time for rho is 2.890000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.620000
% P-1: entering Step 2 up to b2=10000 at 4050.160000
% Time for P-1.II is 0.440000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 4050.970000s
%T% Ecpp sieve(51): 0.290000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.750000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.740000
% P-1: entering Step 2 up to b2=10000 at 4054.940000
% Time for P-1.II is 0.520000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 4055.820000s
%T% Ecpp sieve(115): 0.290000
% Extra square factor: 9
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.680000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.730000
% P-1: entering Step 2 up to b2=10000 at 4059.860000
% Time for P-1.II is 0.490000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 4063.960000
% Time for P-1.II is 0.470000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 4064.620000s
%T% Ecpp sieve(235): 0.250000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=1494347
% Time for rho is 2.770000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.650000
% P-1: entering Step 2 up to b2=10000 at 4068.490000
% Time for P-1.II is 0.470000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.650000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 4072.560000
% Factor[P-1.II]=245628613
% Time for P-1.II is 0.720000
% Testing if N is a norm in Q(sqrt(-84)) where (h, g)=(-4, 4)
% next D is D_29 = 84 at 4073.480000s
%T% Ecpp sieve(84): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.730000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.700000
% P-1: entering Step 2 up to b2=10000 at 4077.380000
% Time for P-1.II is 0.500000
% Testing if N is a norm in Q(sqrt(-228)) where (h, g)=(-4, 4)
% next D is D_34 = 228 at 4078.240000s
%T% Ecpp sieve(228): 0.290000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=7877591
% Time for rho is 2.960000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 4082.390000
% Time for P-1.II is 0.480000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.780000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 4086.600000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-340)) where (h, g)=(-4, 4)
% next D is D_37 = 340 at 4087.280000s
%T% Ecpp sieve(340): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.750000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 4091.170000
% Time for P-1.II is 0.490000
% Extra square factor: 3
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.630000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 4095.350000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-435)) where (h, g)=(-4, 4)
% next D is D_40 = 435 at 4096.020000s
%T% Ecpp sieve(435): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.700000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Factor[P-1.I]=878559061
% Time for P-1.I is 0.870000
% P-1: entering Step 2 up to b2=10000 at 4100.050000
% Time for P-1.II is 0.470000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.680000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 4104.100000
% Time for P-1.II is 0.510000
% Testing if N is a norm in Q(sqrt(-483)) where (h, g)=(-4, 4)
% next D is D_41 = 483 at 4104.810000s
%T% Ecpp sieve(483): 0.280000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.690000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 4108.680000
% Time for P-1.II is 0.500000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.610000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.730000
% P-1: entering Step 2 up to b2=10000 at 4112.710000
% Time for P-1.II is 0.500000
% Testing if N is a norm in Q(sqrt(-532)) where (h, g)=(-4, 4)
% next D is D_43 = 532 at 4113.400000s
%T% Ecpp sieve(532): 0.250000
% Extra square factor: 3
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.670000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 4117.390000
% Time for P-1.II is 0.480000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.710000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.770000
% P-1: entering Step 2 up to b2=10000 at 4121.550000
% Time for P-1.II is 0.510000
% Testing if N is a norm in Q(sqrt(-595)) where (h, g)=(-4, 4)
% next D is D_45 = 595 at 4122.250000s
%T% Ecpp sieve(595): 0.260000
% Extra square factor: 3
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.670000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.750000
% P-1: entering Step 2 up to b2=10000 at 4126.280000
% Time for P-1.II is 0.500000
% Testing if N is a norm in Q(sqrt(-420)) where (h, g)=(-8, 8)
% next D is D_53 = 420 at 4127.150000s
%T% Ecpp sieve(420): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.770000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.760000
% P-1: entering Step 2 up to b2=10000 at 4131.140000
% Time for P-1.II is 0.490000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.700000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 4135.230000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-1380)) where (h, g)=(-8, 8)
% next D is D_59 = 1380 at 4135.920000s
%T% Ecpp sieve(1380): 0.250000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.660000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 4139.750000
% Time for P-1.II is 0.490000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 4143.790000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-1428)) where (h, g)=(-8, 8)
% next D is D_60 = 1428 at 4144.470000s
%T% Ecpp sieve(1428): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.650000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 4148.290000
% Time for P-1.II is 0.490000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 4152.330000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-1995)) where (h, g)=(-8, 8)
% next D is D_63 = 1995 at 4153.010000s
%T% Ecpp sieve(1995): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.680000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.730000
% P-1: entering Step 2 up to b2=10000 at 4156.870000
% Factor[P-1.II]=173841721
% Time for P-1.II is 0.670000
% Cofactor after sieve is a probable prime
% Number of D tried was 22
% D[[7]]=1995
% A[[7]]=-307253639586641346909552916701780737200330280276213818591053833425564861222904700593539925803173685582248777420680326063064003228567877671096767721317
% B[[7]]=-5430859314109574816082783149156780598053170955378349125688585074817045357719897046999159461542740691159760398052432886315053408477160031720054940119
% m[[7]]=38311448413522721955685536858654748186300874239260617493670889959540902584608489064877470956574721181241897362499103893309611748513730847972339311013618953929286630810358713468117463375284068677807584989256896683960972808433751408657941730453863909822108168615037868912004258698076610675434934187739
% Factor [P]=23801^1
% Factor [P]=101^1
% Factor [P]=3^1
% End of depth 7 at 4158.230000 s

% N_8=5312399638964988152685369441677610432140768170744221925621575092532360606726107420796096422242391454728778675785609015416970408863722042903366834576190804575463885688353876118874760008181710849407911694263740018683655276490691783710164122184990689414429319761925563062151097833351790925865213
% Pmax[970]=1000000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.570000
% next D is D_1 = 0 at 4158.800000s
% 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 4159.330000s
%T% Ecpp sieve(4): 0.500000
%T% Ecpp sieve(4): 0.500000
% Entering RHO4 with itmax=4000 cmax=4000
% Time for rho is 3.380000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Factor[P-1.I]=1805261417
% Time for P-1.I is 0.890000
% P-1: entering Step 2 up to b2=10000 at 4165.290000
% Time for P-1.II is 0.450000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 4165.930000s
%T% Ecpp sieve(7): 0.290000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[8]]=7
% A[[8]]=-145707282513885875435727777170581088233830852755424046320535339033853165715388302038250117832139933684320195763261642276920814154858396556765180670
% B[[8]]=-1646918259685560663083220086287115625034449728898205803289922140487887427414264370021909203177270371334039129813249998842334329694816589879997556
% m[[8]]=5312399638964988152685369441677610432140768170744221925621575092532360606726107420796096422242391454728778675785609015416970408863722042903366834721898087089349761124081653289455848242012563604831958014799079052536820991878993821960281954324924373734625083023567839982965252691748347691045884
% Factor [P]=2^2
% End of depth 8 at 4167.060000 s

% N_9=1328099909741247038171342360419402608035192042686055481405393773133090151681526855199024105560597863682194668946402253854242602215930510725841708680474521772337440281020413322363962060503140901207989503699769763134205247969748455490070488581231093433656270755891959995741313172937086922761471
% Pmax[968]=1000000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.570000
% next D is D_1 = 0 at 4167.640000s
% 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 4168.190000s
%T% Ecpp sieve(7): 0.300000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 4169.000000s
%T% Ecpp sieve(11): 0.280000
% Extra square factor: 7
% 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 4169.980000s
%T% Ecpp sieve(19): 0.280000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4170.800000s
%T% Ecpp sieve(67): 0.280000
% Extra square factor: 35
% 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 4171.770000s
%T% Ecpp sieve(163): 0.260000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 4172.560000s
%T% Ecpp sieve(35): 0.290000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=6426383
% Time for rho is 2.780000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.670000
% P-1: entering Step 2 up to b2=10000 at 4176.480000
% Time for P-1.II is 0.450000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 4177.290000s
%T% Ecpp sieve(88): 0.270000
% Extra square factor: 5
% Factorization completed using trial division only
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.610000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 4181.400000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 4182.070000s
%T% Ecpp sieve(91): 0.270000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 4182.870000s
%T% Ecpp sieve(115): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.630000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.720000
% P-1: entering Step 2 up to b2=10000 at 4186.680000
% Time for P-1.II is 0.480000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=1091177
% Time for rho is 2.810000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.670000
% P-1: entering Step 2 up to b2=10000 at 4190.830000
% Time for P-1.II is 0.460000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 4191.480000s
%T% Ecpp sieve(187): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.620000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 4195.260000
% Time for P-1.II is 0.490000
% Extra square factor: 5
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 4196.270000s
%T% Ecpp sieve(403): 0.260000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 4197.060000s
%T% Ecpp sieve(427): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=1423969
% Time for rho is 2.750000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.670000
% P-1: entering Step 2 up to b2=10000 at 4200.920000
% Time for P-1.II is 0.450000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.620000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 4204.890000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-280)) where (h, g)=(-4, 4)
% next D is D_35 = 280 at 4205.560000s
%T% Ecpp sieve(280): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.580000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 4209.470000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-595)) where (h, g)=(-4, 4)
% next D is D_45 = 595 at 4210.140000s
%T% Ecpp sieve(595): 0.260000
% Testing if N is a norm in Q(sqrt(-715)) where (h, g)=(-4, 4)
% next D is D_48 = 715 at 4210.910000s
%T% Ecpp sieve(715): 0.260000
% Testing if N is a norm in Q(sqrt(-760)) where (h, g)=(-4, 4)
% next D is D_49 = 760 at 4211.710000s
%T% Ecpp sieve(760): 0.250000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.650000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 4215.500000
% Time for P-1.II is 0.480000
% Testing if N is a norm in Q(sqrt(-1435)) where (h, g)=(-4, 4)
% next D is D_52 = 1435 at 4216.330000s
%T% Ecpp sieve(1435): 0.260000
% Testing if N is a norm in Q(sqrt(-55)) where (h, g)=(4, 2)
% next D is D_68 = 55 at 4217.120000s
%T% Ecpp sieve(55): 0.280000
% Testing if N is a norm in Q(sqrt(-56)) where (h, g)=(4, 2)
% next D is D_69 = 56 at 4217.930000s
%T% Ecpp sieve(56): 0.270000
% Testing if N is a norm in Q(sqrt(-155)) where (h, g)=(4, 2)
% next D is D_72 = 155 at 4218.740000s
%T% Ecpp sieve(155): 0.270000
% Entering RHO2 with itmax=4000 cmax=4000
% Time for rho is 2.640000
% Entering P-1 Step 1 with b1=2000 cmax1=2000
% Time for P-1.I is 0.710000
% P-1: entering Step 2 up to b2=10000 at 4222.540000
% Time for P-1.II is 0.490000
% Testing if N is a norm in Q(sqrt(-184)) where (h, g)=(4, 2)
% next D is D_73 = 184 at 4223.390000s
%T% Ecpp sieve(184): 0.270000
% Testing if N is a norm in Q(sqrt(-259)) 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 4224.380000s
%T% Ecpp sieve(323): 0.260000
% Entering RHO2 with itmax=4000 cmax=4000
% Factor[RHO2]=1281389
% Time for rho is 3.250000
% Factorization completed using Rho
% Number of D tried was 23
% D[[9]]=323
% A[[9]]=56592471440795860893370376666181535512432407017045830376503392747370199752635920577370534615528042766033958933190339243606714094826809079632832181
% B[[9]]=2555690436534174304568897383796864780743194153381922870683488627278861514559465670994786336662894675381304784752506163390423891197409034380828449
% m[[9]]=1328099909741247038171342360419402608035192042686055481405393773133090151681526855199024105560597863682194668946402253854242602215930510725841708623882050331541579387650036656182426548070733884162159127196377015764005495333827878119535873053188327399697337565552716389027218346128007289929291
% Factor [p]=1281389^1
% Factor [P]=3^2
% End of depth 9 at 4228.070000 s

% N_10=115161482296099262265083901611576067327910228898836035774494515381623652292033346036477612753781496631320011933786283985949153805920373275999864090528329486513079807029718588897796457860331760141374288820471553894858148751413754754457499986619409562565599393015679460077845936985221791
% Pmax[944]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.440000
% next D is D_1 = 0 at 4228.520000s
% 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 4229.020000s
%T% Ecpp sieve(11): 0.220000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4229.740000s
%T% Ecpp sieve(67): 0.210000
% 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 4230.570000s
%T% Ecpp sieve(163): 0.210000
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 4231.300000s
%T% Ecpp sieve(88): 0.210000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 4231.990000s
%T% Ecpp sieve(115): 0.210000
% Testing if N is a norm in Q(sqrt(-55)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-184)) where (h, g)=(4, 2)
% next D is D_73 = 184 at 4232.870000s
%T% Ecpp sieve(184): 0.210000
% Testing if N is a norm in Q(sqrt(-955)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1243)) where (h, g)=(4, 2)
% next D is D_92 = 1243 at 4233.770000s
%T% Ecpp sieve(1243): 0.200000
% Testing if N is a norm in Q(sqrt(-1555)) where (h, g)=(4, 2)
% next D is D_96 = 1555 at 4234.470000s
%T% Ecpp sieve(1555): 0.200000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-23)) 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(-283)) where (h, g)=(3, 1)
% next D is D_235 = 283 at 4235.700000s
%T% Ecpp sieve(283): 0.200000
% Testing if N is a norm in Q(sqrt(-307)) where (h, g)=(3, 1)
% next D is D_236 = 307 at 4236.400000s
%T% Ecpp sieve(307): 0.210000
% Testing if N is a norm in Q(sqrt(-331)) where (h, g)=(3, 1)
% next D is D_237 = 331 at 4237.110000s
%T% Ecpp sieve(331): 0.200000
% Testing if N is a norm in Q(sqrt(-379)) 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 4237.950000s
%T% Ecpp sieve(643): 0.210000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-451)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-515)) where (h, g)=(6, 2)
% next D is D_257 = 515 at 4238.840000s
%T% Ecpp sieve(515): 0.200000
% Testing if N is a norm in Q(sqrt(-835)) where (h, g)=(6, 2)
% next D is D_262 = 835 at 4239.540000s
%T% Ecpp sieve(835): 0.210000
% Testing if N is a norm in Q(sqrt(-856)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1048)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1219)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1315)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1432)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-440)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-2680)) where (h, g)=(12, 4)
% next D is D_341 = 2680 at 4241.300000s
%T% Ecpp sieve(2680): 0.190000
% Testing if N is a norm in Q(sqrt(-4120)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-8395)) where (h, g)=(12, 4)
% next D is D_401 = 8395 at 4242.160000s
%T% Ecpp sieve(8395): 0.190000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-11155)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-18040)) where (h, g)=(24, 8)
% Testing if N is a norm in Q(sqrt(-583)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-979)) where (h, g)=(8, 2)
% next D is D_581 = 979 at 4243.210000s
%T% Ecpp sieve(979): 0.200000
% Cofactor after sieve is a probable prime
% Number of D tried was 18
% D[[10]]=979
% A[[10]]=-19348093268298146458241889877031509703118298331627271287956314558733231276334292364217091808520311217388081441297826031077668246345556241083108
% B[[10]]=-296897846096918971453295034738070330676487392331763543779140345420005794230788781736488975571675290542618846669662341563970047815642018095050
% m[[10]]=115161482296099262265083901611576067327910228898836035774494515381623652292033346036477612753781496631320011933786283985949153805920373275999883438621597784659538048919595620407499576158663387412662245135030287126134483043777971846266020297836797644006897219046757128324191493226304900
% Factor [P]=311^1
% Factor [P]=53^1
% Factor [P]=7^2
% Factor [P]=5^2
% Factor [P]=2^2
% End of depth 10 at 4244.130000 s

% N_11=1425853505171057654517070792932929874910207163333849665449925716683034620605191818366698314451147522819677069061708401927392772094444533155370758476223465669137627870392075204354016892588943059610733695137108327146391805580492602102921380938391659483511115584105294983256608147
% Pmax[918]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.430000
% next D is D_1 = 0 at 4244.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 4245.020000s
%T% Ecpp sieve(3): 0.340000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[11]]=3
% A[[11]]=-1217778112773973351820403795368578530148160200337873160742526215320185376002367451177143262542828719329355360728292262588433209591948852605
% B[[11]]=1186090284468667033694091573749820441723994078225762141709067256488419120177143034934673539422268158226716056966144530628961702508450055711
% m[[11]]=1425853505171057654517070792932929874910207163333849665449925716683034620605191818366698314451147522819677069061708401927392772094444533156588536588997439020958031665760653734502177092926816220353259910457293703148759256757635864645750100267747020211803378172538504575205460753
% Factor [P]=7^1
% End of depth 11 at 4246.380000 s

% N_12=203693357881579664931010113276132839272886737619121380778560816669004945800741688338099759207306788974239581294529771703913253156349219022369790941285348431565433095108664819214596727560973745764751415779613386164108465251090837806535728609678145744543339738934072082172208679
% Pmax[915]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.430000
% next D is D_1 = 0 at 4246.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 4247.250000s
%T% Ecpp sieve(3): 0.330000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 4248.630000s
%T% Ecpp sieve(7): 0.230000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 4249.330000s
%T% Ecpp sieve(19): 0.210000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 4250.000000s
%T% Ecpp sieve(43): 0.210000
% 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 4250.790000s
%T% Ecpp sieve(67): 0.220000
% Extra square factor: 217
% 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 4251.580000s
%T% Ecpp sieve(15): 0.220000
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 4252.250000s
%T% Ecpp sieve(24): 0.220000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 4252.940000s
%T% Ecpp sieve(35): 0.210000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 4253.600000s
%T% Ecpp sieve(51): 0.220000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 4254.260000s
%T% Ecpp sieve(91): 0.220000
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 4254.940000s
%T% Ecpp sieve(123): 0.210000
% Testing if N is a norm in Q(sqrt(-267)) where (h, g)=(-2, 2)
% next D is D_26 = 267 at 4255.600000s
%T% Ecpp sieve(267): 0.210000
% Cofactor after sieve is a probable prime
% Number of D tried was 13
% D[[12]]=267
% A[[12]]=-689562311504277603758897681848083660087483949598779012849266108962886208709291185863205070261745527172744429624557876500552810551315975863
% B[[12]]=-35646897637214356853363867269635192033117949940904582793476215365883269383343883349175133898831506442690219332841369965770479351375852321
% m[[12]]=203693357881579664931010113276132839272886737619121380778560816669004945800741688338099759207306788974239581294529771703913253156349219023059353252789626035324330776956748479302080677159752758614017524742499594873399651114295908068281255782422575369101216239486882633488184543
% Factor [P]=1867^1
% Factor [P]=41^1
% End of depth 12 at 4256.500000 s

% N_13=2661023395842811147804748889912509167869240304899230286994406268945941000963351775224368808801217408575640865017959837797866058191035821430746511983351745141211684023629253652031832431836032223523031924732511984446152705060889493621974156824207027958002485263784114772469
% Pmax[899]=800000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.420000
% next D is D_1 = 0 at 4256.930000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[13]]=1
% Factor [P]=130363^1
% Factor [P]=5^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 13 at 4257.600000 s

% N_14=226804588882395153686650088165141367469573447893721572923674344283606459651839843379586130761473510170800070658934397523996333161252794242976791470598912706247741053283630550593499385206950525628269773609290296620134437008872617539057533947874356643287715862099941
% Pmax[875]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.370000
% next D is D_1 = 0 at 4257.970000s
% 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 4258.370000s
%T% Ecpp sieve(3): 0.280000
% Extra square factor: 5
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[14]]=3
% A[[14]]=-144574337422796915528596959999834874715947476076796807234583213616170824763955805060975145357716588520572588487747852787755316119967
% B[[14]]=543542888981890700769360220213708554549452417922410590864798700555847006086384777269071586399820342664258429408055868011362925442215
% m[[14]]=226804588882395153686650088165141367469573447893721572923674344283606459651839843379586130761473510170800070658934397523996333161252938817314214267514441303207740888158346498069576182014185108841885944434054252425195412154230334127578106536362104496075471178219909
% Factor [P]=135697^1
% Factor [P]=31^1
% Factor [P]=3^1
% End of depth 14 at 4259.900000 s

% N_15=17972092384067504102209539118276033191720662907478764787842422193120366735141476521702338786063091558176623159625988159736681935603756885086897371009813950864100282259023047796761632515563026515343279784559087836919034917708447221840793663900787855554803129
% Pmax[852]=700000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.360000
% next D is D_1 = 0 at 4260.260000s
% 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 4260.620000s
%T% Ecpp sieve(3): 0.280000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 4261.750000s
%T% Ecpp sieve(4): 0.320000
%T% Ecpp sieve(4): 0.330000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 4263.010000s
%T% Ecpp sieve(8): 0.320000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4263.710000s
%T% Ecpp sieve(67): 0.180000
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 4264.260000s
%T% Ecpp sieve(15): 0.190000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 4264.830000s
%T% Ecpp sieve(20): 0.180000
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 4265.390000s
%T% Ecpp sieve(24): 0.190000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 4265.970000s
%T% Ecpp sieve(40): 0.170000
% 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 4266.640000s
%T% Ecpp sieve(51): 0.190000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 4267.200000s
%T% Ecpp sieve(52): 0.180000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 4267.750000s
%T% Ecpp sieve(115): 0.180000
% Testing if N is a norm in Q(sqrt(-148)) where (h, g)=(-2, 2)
% next D is D_22 = 148 at 4268.310000s
%T% Ecpp sieve(148): 0.180000
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 4268.870000s
%T% Ecpp sieve(232): 0.170000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 4269.430000s
%T% Ecpp sieve(403): 0.170000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-120)) where (h, g)=(-4, 4)
% next D is D_30 = 120 at 4269.850000s
%T% Ecpp sieve(120): 0.180000
% Testing if N is a norm in Q(sqrt(-195)) where (h, g)=(-4, 4)
% next D is D_33 = 195 at 4270.410000s
%T% Ecpp sieve(195): 0.170000
% Testing if N is a norm in Q(sqrt(-312)) where (h, g)=(-4, 4)
% next D is D_36 = 312 at 4270.940000s
%T% Ecpp sieve(312): 0.170000
% Testing if N is a norm in Q(sqrt(-340)) where (h, g)=(-4, 4)
% next D is D_37 = 340 at 4271.470000s
%T% Ecpp sieve(340): 0.180000
% Testing if N is a norm in Q(sqrt(-372)) where (h, g)=(-4, 4)
% next D is D_38 = 372 at 4272.020000s
%T% Ecpp sieve(372): 0.170000
% Testing if N is a norm in Q(sqrt(-408)) where (h, g)=(-4, 4)
% next D is D_39 = 408 at 4272.570000s
%T% Ecpp sieve(408): 0.170000
% Testing if N is a norm in Q(sqrt(-435)) where (h, g)=(-4, 4)
% next D is D_40 = 435 at 4273.120000s
%T% Ecpp sieve(435): 0.170000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-520)) where (h, g)=(-4, 4)
% next D is D_42 = 520 at 4273.550000s
%T% Ecpp sieve(520): 0.160000
% Testing if N is a norm in Q(sqrt(-555)) where (h, g)=(-4, 4)
% next D is D_44 = 555 at 4274.080000s
%T% Ecpp sieve(555): 0.170000
% Testing if N is a norm in Q(sqrt(-795)) where (h, g)=(-4, 4)
% next D is D_50 = 795 at 4274.610000s
%T% Ecpp sieve(795): 0.170000
% Testing if N is a norm in Q(sqrt(-1380)) where (h, g)=(-8, 8)
% next D is D_59 = 1380 at 4275.140000s
%T% Ecpp sieve(1380): 0.170000
% Testing if N is a norm in Q(sqrt(-3315)) where (h, g)=(-8, 8)
% next D is D_65 = 3315 at 4275.680000s
%T% Ecpp sieve(3315): 0.170000
% Testing if N is a norm in Q(sqrt(-39)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-68)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-136)) where (h, g)=(4, 2)
% next D is D_71 = 136 at 4276.490000s
%T% Ecpp sieve(136): 0.170000
% Testing if N is a norm in Q(sqrt(-155)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-184)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-355)) where (h, g)=(4, 2)
% next D is D_81 = 355 at 4277.290000s
%T% Ecpp sieve(355): 0.180000
% Cofactor after sieve is a probable prime
% Number of D tried was 29
% D[[15]]=355
% A[[15]]=54740600432880976728432832803859395618209522777935841243595142614179436615524910098253479787036377472458313689966064274494456214
% B[[15]]=13930596197722245574776621847438217993442121674979973438721171614304855452181060064674864815931491189666525086285416015345051792
% m[[15]]=17972092384067504102209539118276033191720662907478764787842422193120366735141476521702338786063091558176623159625988159736681935549016284654016394281381118060240886640813525018825791271967883901163843169034177738665555130672069749382479973934723581060346916
% Factor [P]=85201^1
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 15 at 4277.890000 s

% N_16=7533484845108920628953692326832193951328816943579956635251775294857524616219073770806822684032502786761650667927266178858012202887045375328431924122864553090524124733954130744116765594622415523779836239780124033866786913413185018528655756025131990847
% Pmax[831]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.300000
% next D is D_1 = 0 at 4278.190000s
% 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 4278.540000s
%T% Ecpp sieve(3): 0.240000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[16]]=3
% A[[16]]=171164242525529037402383134632119260751313760755236163802095008528032143379171993668349929321345247967328865245525618205737779
% B[[16]]=16700713169378521759616219060564708655393054436353984734484439568478705792009705871928148667790875569432310649930971963528793
% m[[16]]=7533484845108920628953692326832193951328816943579956635251775294857524616219073770806822684032502786761650667927266178858012031722802849799394521739729920971263373420193375507952963499613887491636457067786455683937465568165217689663410230406926253069
% Factor [P]=3^1
% End of depth 16 at 4279.220000 s

% N_17=2511161615036306876317897442277397983776272314526652211750591764952508205406357923602274228010834262253883555975755392952670677240934283266464840579909973657087791140064458502650987833204629163878819022595485227979155189388405896554470076802308751023
% Pmax[829]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.300000
% next D is D_1 = 0 at 4279.520000s
% 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 4279.870000s
%T% Ecpp sieve(3): 0.230000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 4280.900000s
%T% Ecpp sieve(19): 0.160000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4281.290000s
%T% Ecpp sieve(67): 0.150000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-24)) where (h, g)=(-2, 2)
% next D is D_13 = 24 at 4281.880000s
%T% Ecpp sieve(24): 0.160000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 4282.390000s
%T% Ecpp sieve(51): 0.150000
% Testing if N is a norm in Q(sqrt(-403)) where (h, g)=(-2, 2)
% next D is D_27 = 403 at 4282.890000s
%T% Ecpp sieve(403): 0.150000
% Testing if N is a norm in Q(sqrt(-312)) where (h, g)=(-4, 4)
% next D is D_36 = 312 at 4283.380000s
%T% Ecpp sieve(312): 0.150000
% Testing if N is a norm in Q(sqrt(-408)) where (h, g)=(-4, 4)
% next D is D_39 = 408 at 4283.870000s
%T% Ecpp sieve(408): 0.150000
% Testing if N is a norm in Q(sqrt(-39)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-184)) 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 4284.600000s
%T% Ecpp sieve(219): 0.150000
% Testing if N is a norm in Q(sqrt(-291)) where (h, g)=(4, 2)
% next D is D_77 = 291 at 4285.090000s
%T% Ecpp sieve(291): 0.150000
% Cofactor after sieve is a probable prime
% Number of D tried was 11
% D[[17]]=291
% A[[17]]=16163992229607038840000795661276869802671912649685750424301073932205913237828910412492527414519465430214029539033263352642436
% B[[17]]=5798261327070214407750832313945097260334669454043616897914439501198576173692219077976757865530177380054180250411835082200266
% m[[17]]=2511161615036306876317897442277397983776272314526652211750591764952508205406357923602274228010834262253883555975755392952670661076942053659426000579114312380217988468151808816900563532130696957965581193685072735451740669922975682524931043538956108588
% Factor [P]=36871^1
% Factor [P]=2^2
% End of depth 17 at 4285.660000 s

% N_18=17026671469693708309497284059812576169457516168036208753156896781701799553893018385738617260250835766956982153831977658272562861577812194268029078266892085787054788778117008061217240732084137655376726924175318919013185633173603119829480103190557
% Pmax[812]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.300000
% next D is D_1 = 0 at 4285.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 4286.280000s
%T% Ecpp sieve(3): 0.240000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 4287.280000s
%T% Ecpp sieve(4): 0.280000
%T% Ecpp sieve(4): 0.280000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 4288.380000s
%T% Ecpp sieve(7): 0.160000
% Extra square factor: 13
% Factorization completed using trial division only
% 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 4289.060000s
%T% Ecpp sieve(11): 0.160000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 4289.450000s
%T% Ecpp sieve(19): 0.160000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4289.920000s
%T% Ecpp sieve(67): 0.150000
% Testing if N is a norm in Q(sqrt(-51)) where (h, g)=(-2, 2)
% next D is D_16 = 51 at 4290.400000s
%T% Ecpp sieve(51): 0.150000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 4290.880000s
%T% Ecpp sieve(52): 0.150000
% Cofactor after sieve is a probable prime
% Number of D tried was 9
% D[[18]]=52
% A[[18]]=66742382426147953407258340499819246370712791301694537522352423938734844243637787110261662793443409697745991994808007610374
% B[[18]]=34986849251061091221922486681846425748689321389702046450072209288136859827442808412342614795164927489953528853076004133174
% m[[18]]=17026671469693708309497284059812576169457516168036208753156896781701799553893018385738617260250835766956982153831977658272496119195386046314621819926392266540684075986815313523694888308145402811133089137065057256219742223475857127834672095580184
% Factor [P]=7^1
% Factor [P]=2^3
% End of depth 18 at 4291.460000 s

% N_19=304047704815959076955308643925224574454598503000646584877801728244674992033803899745332451075907781552803252746999601040580287842774750827046818212971290473940787071193130598637408719788310764484519448876161736718209682562068877282762001706789
% Pmax[806]=600000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.300000
% next D is D_1 = 0 at 4291.760000s
% 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 4292.080000s
%T% Ecpp sieve(3): 0.240000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[19]]=3
% A[[19]]=19854455076504974383068092393433517739410926905233847439181927638648388775068551776582638711738554891129607711692987307393
% B[[19]]=-16552859097236365948161729213565458435514806626994628804112647006683178110534171169479043749775422650233033014657913665913
% m[[19]]=304047704815959076955308643925224574454598503000646584877801728244674992033803899745332451075907781552803252746999601040560433387698245852663750120577856956201376144287896751198226792149662375709450897099579098006471127670939269571069014399397
% Factor [P]=541^1
% Factor [P]=331^1
% Factor [P]=181^1
% Factor [P]=73^1
% Factor [P]=67^1
% Factor [P]=31^2
% Factor [P]=13^2
% End of depth 19 at 4292.860000 s

% N_20=11809462747106562459886302988881792682838078298346740120647264525345378783253034898720799111771977230974947979668810115049705745178843402080736760265493225220137781134788398135120771524875418063797284238834108343165311344029013
% Pmax[751]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.230000
% next D is D_1 = 0 at 4293.090000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.010000
% Testing if N is a norm in Q(sqrt(-3)) where (h, g)=(-1, 1)
% next D is D_2 = 3 at 4293.360000s
%T% Ecpp sieve(3): 0.200000
% Testing if N is a norm in Q(sqrt(-4)) where (h, g)=(-1, 1)
% next D is D_3 = 4 at 4294.170000s
%T% Ecpp sieve(4): 0.220000
%T% Ecpp sieve(4): 0.220000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 4295.040000s
%T% Ecpp sieve(11): 0.130000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 4295.440000s
%T% Ecpp sieve(43): 0.120000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[20]]=43
% A[[20]]=183419517113895974833321868984233348305080918316450318499373231987262927261335634372848754911079365153431081482153
% B[[20]]=17781053236214776797278436755879975693960994281022176994596005072152387246921077469441153760810176093568497732899
% m[[20]]=11809462747106562459886302988881792682838078298346740120647264525345378783253034898720799111771977230974947979668626695532591849204010080211752526917188144301821330816289024903133508597614082429424435483923028978011880262546861
% Factor [P]=13^2
% End of depth 20 at 4295.880000 s

% N_21=69878477793529955383942621235986938951704605315661184145841801925120584516290147329708870483857853437721585678512583997234271297065148403619837437379811504744504916072716123687180524246237174138606127123804905195336569600869
% Pmax[744]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.230000
% next D is D_1 = 0 at 4296.120000s
% 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 4296.370000s
%T% Ecpp sieve(4): 0.220000
%T% Ecpp sieve(4): 0.220000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 4297.250000s
%T% Ecpp sieve(7): 0.130000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 4297.630000s
%T% Ecpp sieve(11): 0.130000
% Extra square factor: 7
% 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 4298.110000s
%T% Ecpp sieve(43): 0.120000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 4298.480000s
%T% Ecpp sieve(20): 0.130000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 4298.870000s
%T% Ecpp sieve(35): 0.120000
% Testing if N is a norm in Q(sqrt(-52)) where (h, g)=(-2, 2)
% next D is D_17 = 52 at 4299.240000s
%T% Ecpp sieve(52): 0.130000
% Testing if N is a norm in Q(sqrt(-91)) where (h, g)=(-2, 2)
% next D is D_19 = 91 at 4299.620000s
%T% Ecpp sieve(91): 0.120000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 4299.990000s
%T% Ecpp sieve(187): 0.110000
% Testing if N is a norm in Q(sqrt(-235)) where (h, g)=(-2, 2)
% next D is D_25 = 235 at 4300.360000s
%T% Ecpp sieve(235): 0.110000
% Cofactor after sieve is a probable prime
% Number of D tried was 11
% D[[21]]=235
% A[[21]]=-14589172430012531921998012650543773388536742318803830859129519536148924730442247421769392007336874142223365395926
% B[[21]]=-532636792864227132475154466242036064900758163893565705301852735354777624445980923293990398903683265825839716860
% m[[21]]=69878477793529955383942621235986938951704605315661184145841801925120584516290147329708870483857853437721585678527173169664283828987146416270381210768348247063308746931845643223329448976679421560375519131141779337559934996796
% Factor [P]=2^2
% End of depth 21 at 4300.890000 s

% N_22=17469619448382488845985655308996734737926151328915296036460450481280146129072536832427217620964463359430396419631793292416070957246786604067595302692087061765827186732961410805832362244169855390093879782785444834389983749199
% Pmax[742]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.230000
% next D is D_1 = 0 at 4301.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 4301.380000s
%T% Ecpp sieve(3): 0.190000
% 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 4302.230000s
%T% Ecpp sieve(7): 0.130000
% 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 4302.710000s
%T% Ecpp sieve(11): 0.120000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 4303.010000s
%T% Ecpp sieve(19): 0.120000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[22]]=19
% A[[22]]=5270546222767605791127600237528578465082018960727568209710077754305561469784048829185896361399487114576918909039
% B[[22]]=1488549635104058323494089546444731701519080010536217174166046848078193042333863079418165772296921773591884514715
% m[[22]]=17469619448382488845985655308996734737926151328915296036460450481280146129072536832427217620964463359430396419626522746193303351455659003830066724227005042805099618523251333051526800774385806560907983421385957719813064840161
% Factor [P]=3^2
% Factor [P]=7^2
% End of depth 22 at 4303.540000 s

% N_23=39613649542817435024910783013598037954481068773050557905806010161632984419665616400061717961370665214127883037701865637626538211917594112993348581013616877109069429757939530729085716041691171339927400048494235192319874921
% Pmax[733]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.220000
% next D is D_1 = 0 at 4303.760000s
% 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 4304.000000s
%T% Ecpp sieve(4): 0.210000
%T% Ecpp sieve(4): 0.220000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 4304.850000s
%T% Ecpp sieve(7): 0.130000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 4305.210000s
%T% Ecpp sieve(8): 0.210000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 4305.660000s
%T% Ecpp sieve(19): 0.130000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 4306.030000s
%T% Ecpp sieve(20): 0.130000
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 4306.410000s
%T% Ecpp sieve(35): 0.130000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 4306.770000s
%T% Ecpp sieve(40): 0.120000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 4307.140000s
%T% Ecpp sieve(115): 0.120000
% Cofactor after sieve is a probable prime
% Number of D tried was 9
% D[[23]]=115
% A[[23]]=183255926393144425605490739420638974075517989471188418581745779524416041142625350713335551690757020851055430118
% B[[23]]=32952121210742712368954881470504683611768655669011976056943900055416538697777167615723318419079788380711309168
% m[[23]]=39613649542817435024910783013598037954481068773050557905806010161632984419665616400061717961370665214127883037518609711233393786312103373572709606938098887637881011176193751204669674899065820626591848357737214341264444804
% Factor [P]=63823^1
% Factor [P]=41^1
% Factor [P]=2^2
% End of depth 23 at 4307.560000 s

% N_24=3784633181670633591540206949402180301474110064787653765177360765045801633907649356476898759390076252628542718707818241152588712983287179288595556282953550237631380993108011677557719166447165486502863326446006958007
% Pmax[710]=500000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.220000
% next D is D_1 = 0 at 4307.780000s
% 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 4308.010000s
%T% Ecpp sieve(7): 0.120000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 4308.360000s
%T% Ecpp sieve(11): 0.130000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 4308.710000s
%T% Ecpp sieve(43): 0.120000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4309.000000s
%T% Ecpp sieve(67): 0.120000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 4309.270000s
%T% Ecpp sieve(88): 0.120000
% Testing if N is a norm in Q(sqrt(-187)) where (h, g)=(-2, 2)
% next D is D_23 = 187 at 4309.610000s
%T% Ecpp sieve(187): 0.120000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 4309.870000s
%T% Ecpp sieve(427): 0.120000
% Testing if N is a norm in Q(sqrt(-56)) where (h, g)=(4, 2)
% next D is D_69 = 56 at 4310.210000s
%T% Ecpp sieve(56): 0.120000
% Testing if N is a norm in Q(sqrt(-568)) where (h, g)=(4, 2)
% next D is D_83 = 568 at 4310.560000s
%T% Ecpp sieve(568): 0.120000
% Testing if N is a norm in Q(sqrt(-1003)) where (h, g)=(4, 2)
% next D is D_89 = 1003 at 4310.910000s
%T% Ecpp sieve(1003): 0.110000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-1243)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1411)) where (h, g)=(4, 2)
% next D is D_94 = 1411 at 4311.280000s
%T% Ecpp sieve(1411): 0.120000
% Testing if N is a norm in Q(sqrt(-952)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2968)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-5467)) where (h, g)=(8, 4)
% next D is D_151 = 5467 at 4311.780000s
%T% Ecpp sieve(5467): 0.110000
% Testing if N is a norm in Q(sqrt(-6307)) where (h, g)=(8, 4)
% next D is D_152 = 6307 at 4312.120000s
%T% Ecpp sieve(6307): 0.100000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-31)) 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(-211)) where (h, g)=(3, 1)
% next D is D_234 = 211 at 4312.610000s
%T% Ecpp sieve(211): 0.120000
% Testing if N is a norm in Q(sqrt(-379)) where (h, g)=(3, 1)
% next D is D_238 = 379 at 4312.960000s
%T% Ecpp sieve(379): 0.120000
% Testing if N is a norm in Q(sqrt(-547)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-472)) where (h, g)=(6, 2)
% next D is D_256 = 472 at 4313.470000s
%T% Ecpp sieve(472): 0.120000
% Testing if N is a norm in Q(sqrt(-1099)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2443)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-3763)) where (h, g)=(6, 2)
% next D is D_294 = 3763 at 4313.980000s
%T% Ecpp sieve(3763): 0.120000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-2387)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-248)) where (h, g)=(8, 2)
% next D is D_567 = 248 at 4314.330000s
%T% Ecpp sieve(248): 0.120000
% Testing if N is a norm in Q(sqrt(-371)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-583)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-632)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-979)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1043)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1528)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1939)) where (h, g)=(8, 2)
% next D is D_597 = 1939 at 4315.160000s
%T% Ecpp sieve(1939): 0.110000
% Testing if N is a norm in Q(sqrt(-3883)) where (h, g)=(8, 2)
% next D is D_614 = 3883 at 4315.500000s
%T% Ecpp sieve(3883): 0.110000
% Testing if N is a norm in Q(sqrt(-4267)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4867)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4216)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-4984)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-5848)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-6328)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-14008)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-14707)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-26488)) where (h, g)=(32, 8)
% Testing if N is a norm in Q(sqrt(-79)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-103)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-443)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-683)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-691)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-787)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-947)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1051)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1123)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1723)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1747)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2203)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-119)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-344)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-664)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1643)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1688)) where (h, g)=(10, 2)
% next D is D_1099 = 1688 at 4317.860000s
%T% Ecpp sieve(1688): 0.120000
% Testing if N is a norm in Q(sqrt(-1891)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-3928)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-4627)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-5272)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-5803)) where (h, g)=(10, 2)
% next D is D_1141 = 5803 at 4318.520000s
%T% Ecpp sieve(5803): 0.120000
% Testing if N is a norm in Q(sqrt(-6259)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-6667)) where (h, g)=(10, 2)
% next D is D_1145 = 6667 at 4318.940000s
%T% Ecpp sieve(6667): 0.120000
% Testing if N is a norm in Q(sqrt(-7123)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-7387)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-10483)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-5368)) where (h, g)=(20, 4)
% next D is D_1221 = 5368 at 4319.520000s
%T% Ecpp sieve(5368): 0.120000
% Cofactor after sieve is a probable prime
% Number of D tried was 25
% D[[24]]=5368
% A[[24]]=-74583157754765692926272689046364199552884951800186465221689373160179334836833955960967778305306645784658646
% B[[24]]=-1335620924412198371068811705628921770890121848019643207531901608239963927156357794046452554021222677943697
% m[[24]]=3784633181670633591540206949402180301474110064787653765177360765045801633907649356476898759390076252628542793290975995918281639255976225652795109167905350424096602682481171856892556000403126454281168633091791616654
% Factor [P]=12959^1
% Factor [P]=17^1
% Factor [P]=13^1
% Factor [P]=2^1
% End of depth 24 at 4319.970000 s

% N_25=660739139637861279786372361527633846508970698186597857911317378799932825717944648345669855291973092413725081660429219323156261229023422924300257297363063672811572223165572286437063778314259915152028139058093
% Pmax[688]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 4320.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 4320.340000s
%T% Ecpp sieve(3): 0.130000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[25]]=3
% A[[25]]=-38290827844550065110276291948249933504930373957799187717226826141034135911950240853564820197026931114242
% B[[25]]=19805462727325799880520910666260434871841076850225199727316640839169823028818912384457932385331686928044
% m[[25]]=660739139637861279786372361527633846508970698186597857911317378799932825717944648345669855291973092413763372488273769388266537520971672857805187671320862860528799049306606422349014019167824735349055070172336
% Factor [P]=73^1
% Factor [P]=3^1
% Factor [P]=2^4
% End of depth 25 at 4320.920000 s

% N_26=188567106061033470258667911394872673090459674140010804198435324999980829257404294619198018062777709022192743290032468432724468470596938600971800134509378670242237171605766673044809936977118931321077360209
% Pmax[676]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 4321.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 4321.270000s
%T% Ecpp sieve(3): 0.130000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[26]]=3
% A[[26]]=-642095366796384697053307830949789942339432671937718464180838562340618368838821492105050806074769878238
% B[[26]]=337629957291879969881925931005403861283272332609538009138645046735200251950169724518965836868414822008
% m[[26]]=188567106061033470258667911394872673090459674140010804198435324999980829257404294619198018062777709022834838656828853129777776301546728543311232806447097134423075733946385041883631429082169737395847238448
% Factor [P]=7321^1
% Factor [P]=3^1
% Factor [P]=2^4
% End of depth 26 at 4321.830000 s

% N_27=536604477021107858269213880716638986848505651948762703747311743045066786349213150011377140141310695894330347222683755434645131304770319808630517251875589441398817710315032787767015631636643836781881
% Pmax[657]=350000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.150000
% next D is D_1 = 0 at 4321.980000s
% 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 4322.160000s
%T% Ecpp sieve(3): 0.130000
% 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 4322.760000s
%T% Ecpp sieve(4): 0.150000
%T% Ecpp sieve(4): 0.150000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 4323.360000s
%T% Ecpp sieve(7): 0.090000
% Extra square factor: 3
% 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 4323.680000s
%T% Ecpp sieve(8): 0.140000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 4324.000000s
%T% Ecpp sieve(11): 0.090000
% Extra square factor: 7
% 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 4324.320000s
%T% Ecpp sieve(19): 0.080000
% Cofactor after sieve is a probable prime
% Number of D tried was 7
% D[[27]]=19
% A[[27]]=14241948535623115298534805595242807280779183074151779803291338495370323239449959817525278402392757
% B[[27]]=336093273001968598623805736357002456289399857948483903707344859695282428001516599913350670427749155
% m[[27]]=536604477021107858269213880716638986848505651948762703747311743045066786349213150011377140141310695880088398687060640136110325709527512527851334177723809638107479214944709548317055814111365434389125
% Factor [P]=17^2
% Factor [P]=11^1
% Factor [P]=5^3
% End of depth 27 at 4324.620000 s

% N_28=1350373015466770325936996239614064767155723565772287395400595767335808207232999433812839610295843210770905061181656219279296195557162661284306597490339879554847383994827831515110552536297868347
% Pmax[639]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 4324.710000s
% 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 4324.870000s
%T% Ecpp sieve(7): 0.050000
% Testing if N is a norm in Q(sqrt(-8)) where (h, g)=(-1, 1)
% next D is D_5 = 8 at 4325.090000s
%T% Ecpp sieve(8): 0.080000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 4325.340000s
%T% Ecpp sieve(11): 0.050000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 4325.560000s
%T% Ecpp sieve(19): 0.050000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 4325.770000s
%T% Ecpp sieve(427): 0.040000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-259)) where (h, g)=(4, 2)
% next D is D_76 = 259 at 4325.930000s
%T% Ecpp sieve(259): 0.040000
% 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(-616)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-1672)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-4123)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-5467)) where (h, g)=(8, 4)
% next D is D_151 = 5467 at 4326.430000s
%T% Ecpp sieve(5467): 0.050000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-31)) where (h, g)=(3, 1)
% next D is D_229 = 31 at 4326.590000s
%T% Ecpp sieve(31): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 9
% D[[28]]=31
% A[[28]]=404179548551833561155463023584959602933950152199054457727182965746979827947407393418882561502052
% B[[28]]=411061998086605144695694513102162370350132437713573408716339468604578720001020512635898659497958
% m[[28]]=1350373015466770325936996239614064767155723565772287395400595767335808207232999433812839610295842806591356509348095063816272610597559727334154398435882152371881637014999884107717133653736366296
% Factor [P]=71^1
% Factor [P]=7^1
% Factor [P]=2^3
% End of depth 28 at 4326.840000 s

% N_29=339631040107336601090793822840559549083431480325021980734556279511018160772887181542464690718270323589375379614712038183167155582887255365732997594537764681056749752263552340975134218746571
% Pmax[627]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 4326.920000s
% 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 4327.070000s
%T% Ecpp sieve(3): 0.070000
% 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(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 4327.480000s
%T% Ecpp sieve(7): 0.050000
% 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 4327.710000s
%T% Ecpp sieve(8): 0.080000
% Testing if N is a norm in Q(sqrt(-11)) where (h, g)=(-1, 1)
% next D is D_6 = 11 at 4327.950000s
%T% Ecpp sieve(11): 0.050000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 4328.110000s
%T% Ecpp sieve(19): 0.050000
% 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 4328.350000s
%T% Ecpp sieve(43): 0.050000
% Extra square factor: 3
% Factorization completed using trial division only
% 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 4328.630000s
%T% Ecpp sieve(163): 0.040000
% Extra square factor: 7
% Factorization completed using trial division only
% Extra square factor: 15
% 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 4328.900000s
%T% Ecpp sieve(15): 0.050000
% Extra square factor: 7
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-35)) where (h, g)=(-2, 2)
% next D is D_14 = 35 at 4329.150000s
%T% Ecpp sieve(35): 0.040000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 4329.350000s
%T% Ecpp sieve(40): 0.050000
% 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 4329.580000s
%T% Ecpp sieve(51): 0.050000
% Testing if N is a norm in Q(sqrt(-123)) where (h, g)=(-2, 2)
% next D is D_21 = 123 at 4329.780000s
%T% Ecpp sieve(123): 0.050000
% Cofactor after sieve is a probable prime
% Number of D tried was 13
% D[[29]]=123
% A[[29]]=32811950044200743802977390140294033712399373632086755014671402709926079954410448774674613920496
% B[[29]]=1513892561852084256872857066913398479934737261181558590422632316090321355843684466739862259954
% m[[29]]=339631040107336601090793822840559549083431480325021980734556279511018160772887181542464690718237511639331178870909060793026861549174855992100910839523093278346823672309141892200459604826076
% Factor [P]=383^1
% Factor [P]=3^1
% Factor [P]=2^2
% End of depth 29 at 4330.030000 s

% N_30=73897093147810400585464278250774488486386309905357262997074908509795074145536810605410071957841059973744816986707802609448838457174685812032400095631656500945784088840109201958324544131
% Pmax[615]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 4330.110000s
% 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 4330.260000s
%T% Ecpp sieve(3): 0.070000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[30]]=3
% A[[30]]=-518410257465172689260191004734762365378953887131110498495654470997488309779510272318342377259
% B[[30]]=-94585371571815068468746164630674216009370859321256375997801863691217329380379513399444059559
% m[[30]]=73897093147810400585464278250774488486386309905357262997074908509795074145536810605410071958359470231209989675967993614183600822553639699163510594127310971943272398619619474276666921391
% Factor [P]=1231^1
% Factor [P]=229^1
% End of depth 30 at 4330.560000 s

% N_31=262140316736882360652092693662533348775222011803366677416645353512410736276243656789878899741962441268716773298124482932481494515956564936957955133318355056042314441057327178445709
% Pmax[597]=200000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.080000
% next D is D_1 = 0 at 4330.640000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[31]]=-1
% Factor [P]=146023^1
% Factor [P]=3001^1
% Factor [P]=2531^1
% Factor [P]=823^1
% Factor [P]=83^1
% Factor [P]=3^2
% Factor [P]=2^2
% End of depth 31 at 4330.770000 s

% N_32=96111196584344758791345408675002453436340359964612012083645981232962407219659072475191834364058082672892879808179750405223806736180719533807111965891298340107259
% Pmax[535]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 4330.810000s
% 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 4330.910000s
%T% Ecpp sieve(8): 0.040000
% Testing if N is a norm in Q(sqrt(-19)) where (h, g)=(-1, 1)
% next D is D_7 = 19 at 4331.060000s
%T% Ecpp sieve(19): 0.030000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 4331.190000s
%T% Ecpp sieve(43): 0.030000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4331.320000s
%T% Ecpp sieve(67): 0.020000
% 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(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 4331.370000s
%T% Ecpp sieve(163): 0.030000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 4331.470000s
%T% Ecpp sieve(40): 0.020000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 4331.600000s
%T% Ecpp sieve(115): 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 4331.690000s
%T% Ecpp sieve(232): 0.020000
% Testing if N is a norm in Q(sqrt(-155)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-328)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-667)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-1387)) where (h, g)=(4, 2)
% next D is D_93 = 1387 at 4331.920000s
%T% Ecpp sieve(1387): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 10
% D[[32]]=1387
% A[[32]]=-619800797526844634651207349135861622052869968887017030808513059404504590123144144
% B[[32]]=-458641077972766081779084079570703217023951472863067137621439261997635949435570
% m[[32]]=96111196584344758791345408675002453436340359964612012083645981232962407219659073094992631890902717324100228944041372458093775623197750342320171370395888463251404
% Factor [P]=1129^1
% Factor [P]=2^2
% End of depth 32 at 4332.110000 s

% N_33=21282373025762789812078257013950941859242772357088576634996895755748982998153027700396951260164463535008908092126078932261686364747066063401277982815741466619
% Pmax[523]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 4332.150000s
% 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 4332.250000s
%T% Ecpp sieve(8): 0.040000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 4332.390000s
%T% Ecpp sieve(43): 0.030000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 4332.510000s
%T% Ecpp sieve(40): 0.030000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 4332.630000s
%T% Ecpp sieve(115): 0.030000
% Testing if N is a norm in Q(sqrt(-955)) where (h, g)=(4, 2)
% next D is D_88 = 955 at 4332.760000s
%T% Ecpp sieve(955): 0.020000
% Testing if N is a norm in Q(sqrt(-23)) where (h, g)=(3, 1)
% next D is D_228 = 23 at 4332.890000s
%T% Ecpp sieve(23): 0.020000
% Testing if N is a norm in Q(sqrt(-59)) where (h, g)=(3, 1)
% next D is D_230 = 59 at 4333.000000s
%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(-211)) where (h, g)=(3, 1)
% next D is D_234 = 211 at 4333.160000s
%T% Ecpp sieve(211): 0.020000
% No factor found, sieve only: no PRP test
% 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(-883)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-424)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-515)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-835)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1219)) where (h, g)=(6, 2)
% 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)
% Testing if N is a norm in Q(sqrt(-3880)) where (h, g)=(12, 4)
% next D is D_361 = 3880 at 4333.570000s
%T% Ecpp sieve(3880): 0.030000
% Testing if N is a norm in Q(sqrt(-4360)) where (h, g)=(12, 4)
% Testing if N is a norm in Q(sqrt(-7912)) where (h, g)=(12, 4)
% next D is D_398 = 7912 at 4333.730000s
%T% Ecpp sieve(7912): 0.040000
% Testing if N is a norm in Q(sqrt(-11155)) where (h, g)=(12, 4)
% next D is D_409 = 11155 at 4333.880000s
%T% Ecpp sieve(11155): 0.030000
% Testing if N is a norm in Q(sqrt(-295)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-712)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-995)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1195)) where (h, g)=(8, 2)
% next D is D_584 = 1195 at 4334.120000s
%T% Ecpp sieve(1195): 0.020000
% Testing if N is a norm in Q(sqrt(-1864)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-9640)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-103)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-127)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-179)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-443)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-571)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-619)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1723)) where (h, g)=(5, 1)
% next D is D_1065 = 1723 at 4334.560000s
%T% Ecpp sieve(1723): 0.020000
% Testing if N is a norm in Q(sqrt(-1747)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1867)) where (h, g)=(5, 1)
% next D is D_1067 = 1867 at 4334.710000s
%T% Ecpp sieve(1867): 0.020000
% Testing if N is a norm in Q(sqrt(-635)) where (h, g)=(10, 2)
% next D is D_1081 = 635 at 4334.830000s
%T% Ecpp sieve(635): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 16
% D[[33]]=635
% A[[33]]=-1396259130179426095298826598308902329257188457587062861424722764689776244879571
% B[[33]]=-361928240471905387286898461758750317630273808815257544028910826288011376264709
% m[[33]]=21282373025762789812078257013950941859242772357088576634996895755748982998153029096656081439590558833835506401028408189450143951809927488124042672591986346191
% Factor [P]=167^2
% Factor [P]=67^1
% Factor [P]=31^1
% Factor [P]=7^1
% Factor [P]=3^1
% End of depth 33 at 4334.990000 s

% N_34=17495699767080506874831047328193442879767069184667713086332741823273952930134455250083883010963664456497960610747985403017041782840246894675243954207
% Pmax[493]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.040000
% next D is D_1 = 0 at 4335.030000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4335.110000s
%T% Ecpp sieve(67): 0.030000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-163)) where (h, g)=(-1, 1)
% next D is D_10 = 163 at 4335.190000s
%T% Ecpp sieve(163): 0.030000
% No factor found, sieve only: no PRP test
% 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)
% next D is D_233 = 139 at 4335.310000s
%T% Ecpp sieve(139): 0.020000
% Testing if N is a norm in Q(sqrt(-211)) where (h, g)=(3, 1)
% next D is D_234 = 211 at 4335.420000s
%T% Ecpp sieve(211): 0.020000
% Testing if N is a norm in Q(sqrt(-283)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-307)) where (h, g)=(3, 1)
% next D is D_236 = 307 at 4335.560000s
%T% Ecpp sieve(307): 0.020000
% Testing if N is a norm in Q(sqrt(-331)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-499)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% next D is D_243 = 907 at 4335.750000s
%T% Ecpp sieve(907): 0.030000
% Testing if N is a norm in Q(sqrt(-856)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1048)) where (h, g)=(6, 2)
% next D is D_265 = 1048 at 4335.880000s
%T% Ecpp sieve(1048): 0.020000
% Testing if N is a norm in Q(sqrt(-2227)) where (h, g)=(6, 2)
% next D is D_284 = 2227 at 4335.990000s
%T% Ecpp sieve(2227): 0.020000
% Testing if N is a norm in Q(sqrt(-1528)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3448)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4267)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-131)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-227)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-347)) where (h, g)=(5, 1)
% next D is D_1053 = 347 at 4336.260000s
%T% Ecpp sieve(347): 0.020000
% Testing if N is a norm in Q(sqrt(-571)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-683)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-787)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-947)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1123)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1747)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2203)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2683)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1688)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1819)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-2363)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-2776)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-3859)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-5272)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-7123)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-7363)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1336)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-2488)) where (h, g)=(12, 2)
% next D is D_1604 = 2488 at 4336.880000s
%T% Ecpp sieve(2488): 0.030000
% Testing if N is a norm in Q(sqrt(-4792)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-8248)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-9112)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-251)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-463)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-467)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-487)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-827)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-859)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-1163)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-1483)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2011)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2251)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2467)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2707)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-3067)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-4603)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-5923)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-536)) where (h, g)=(14, 2)
% next D is D_2302 = 536 at 4337.550000s
%T% Ecpp sieve(536): 0.020000
% Testing if N is a norm in Q(sqrt(-1112)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-1816)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-2008)) where (h, g)=(14, 2)
% next D is D_2316 = 2008 at 4337.710000s
%T% Ecpp sieve(2008): 0.020000
% Testing if N is a norm in Q(sqrt(-3352)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-6499)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-7067)) where (h, g)=(14, 2)
% next D is D_2357 = 7067 at 4337.880000s
%T% Ecpp sieve(7067): 0.020000
% Testing if N is a norm in Q(sqrt(-13483)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-18547)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-30067)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-1139)) where (h, g)=(16, 2)
% next D is D_2683 = 1139 at 4338.080000s
%T% Ecpp sieve(1139): 0.020000
% Testing if N is a norm in Q(sqrt(-5752)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-7288)) where (h, g)=(16, 2)
% next D is D_2719 = 7288 at 4338.220000s
%T% Ecpp sieve(7288): 0.020000
% Testing if N is a norm in Q(sqrt(-9208)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-11203)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-11512)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-16531)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-17323)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-21403)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-27787)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-31243)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-199)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-419)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-823)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-1187)) where (h, g)=(9, 1)
% next D is D_3114 = 1187 at 4338.660000s
%T% Ecpp sieve(1187): 0.030000
% Testing if N is a norm in Q(sqrt(-1423)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-3163)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-4363)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-4483)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-4987)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-5443)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-6427)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-6883)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-7723)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-8563)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-8803)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-9067)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-10627)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-4568)) where (h, g)=(18, 2)
% Testing if N is a norm in Q(sqrt(-5464)) where (h, g)=(18, 2)
% Testing if N is a norm in Q(sqrt(-5899)) where (h, g)=(18, 2)
% Testing if N is a norm in Q(sqrt(-7571)) where (h, g)=(18, 2)
% Testing if N is a norm in Q(sqrt(-8152)) where (h, g)=(18, 2)
% Testing if N is a norm in Q(sqrt(-11992)) where (h, g)=(18, 2)
% Testing if N is a norm in Q(sqrt(-12952)) where (h, g)=(18, 2)
% Testing if N is a norm in Q(sqrt(-17131)) where (h, g)=(18, 2)
% next D is D_3250 = 17131 at 4339.370000s
%T% Ecpp sieve(17131): 0.040000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-23347)) where (h, g)=(18, 2)
% Testing if N is a norm in Q(sqrt(-26707)) where (h, g)=(18, 2)
% Testing if N is a norm in Q(sqrt(-36667)) where (h, g)=(18, 2)
% Testing if N is a norm in Q(sqrt(-1592)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-3512)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-4024)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-5944)) where (h, g)=(20, 2)
% next D is D_3327 = 5944 at 4339.650000s
%T% Ecpp sieve(5944): 0.020000
% Testing if N is a norm in Q(sqrt(-6712)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-7096)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-7939)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-10027)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-12139)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-12931)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-14659)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-26827)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-35683)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-37627)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-40723)) where (h, g)=(20, 2)
% Testing if N is a norm in Q(sqrt(-167)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-271)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-659)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-1459)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-1531)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-2539)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-2731)) where (h, g)=(11, 1)
% next D is D_3454 = 2731 at 4340.270000s
%T% Ecpp sieve(2731): 0.020000
% Testing if N is a norm in Q(sqrt(-2851)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-2971)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-3203)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-3347)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-3499)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-5683)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-6163)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-6547)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-7027)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-7507)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-7867)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-9643)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-10987)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-13267)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-14107)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-14683)) where (h, g)=(11, 1)
% next D is D_3480 = 14683 at 4340.830000s
%T% Ecpp sieve(14683): 0.040000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-15667)) where (h, g)=(11, 1)
% Testing if N is a norm in Q(sqrt(-191)) where (h, g)=(13, 1)
% Testing if N is a norm in Q(sqrt(-607)) where (h, g)=(13, 1)
% Testing if N is a norm in Q(sqrt(-631)) where (h, g)=(13, 1)
% Testing if N is a norm in Q(sqrt(-1019)) where (h, g)=(13, 1)
% Testing if N is a norm in Q(sqrt(-1499)) where (h, g)=(13, 1)
% Testing if N is a norm in Q(sqrt(-1667)) where (h, g)=(13, 1)
% Testing if N is a norm in Q(sqrt(-1907)) where (h, g)=(13, 1)
% next D is D_3491 = 1907 at 4341.140000s
%T% Ecpp sieve(1907): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 22
% D[[34]]=1907
% A[[34]]=241230994680525540931703447728911239422148547443698452563497923124756669305
% B[[34]]=2486503292345589589312791774890684609616163558053991366468944745292343773
% m[[34]]=17495699767080506874831047328193442879767069184667713086332741823273952929893224255403357470031961008769049371325836855573343330276748971550487284903
% Factor [P]=3^2
% End of depth 34 at 4341.270000 s

% N_35=1943966640786722986092338592021493653307452131629745898481415758141550325543691583933706385559106778752116596813981872841482592252972107950054142767
% Pmax[490]=110000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 4341.310000s
% 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 4341.390000s
%T% Ecpp sieve(7): 0.030000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4341.500000s
%T% Ecpp sieve(67): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[35]]=67
% A[[35]]=87208252980265288786384923520979621322466342246892097297020773551964398925
% B[[35]]=1595643206653491701427413328724317826645216276151678378769104604710909977
% m[[35]]=1943966640786722986092338592021493653307452131629745898481415758141550325456483330953441096772721855231136975491515530594590494955951334398089743843
% Factor [P]=26731^1
% Factor [P]=17737^1
% Factor [P]=317^1
% Factor [P]=211^1
% End of depth 35 at 4341.600000 s

% N_36=61298764120462579273744267821424743501802044068341838072232238432785771382895958944942249319365553123037959668371044250536572824134487
% Pmax[445]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 4341.630000s
% 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 4341.690000s
%T% Ecpp sieve(3): 0.030000
% Testing if N is a norm in Q(sqrt(-7)) where (h, g)=(-1, 1)
% next D is D_4 = 7 at 4341.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 4341.950000s
%T% Ecpp sieve(11): 0.020000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4342.030000s
%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 4342.100000s
%T% Ecpp sieve(163): 0.010000
% Extra square factor: 3
% Factorization completed using trial division only
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[36]]=163
% A[[36]]=13342979879693663970854348227650977629614321475919622984045615877559
% B[[36]]=641891111362558097381558967413181765125146606704508554105450578997
% m[[36]]=61298764120462579273744267821424743501802044068341838072232238432772428403016265280971394971137902145408345346895124627552527208256929
% Factor [P]=3^2
% End of depth 36 at 4342.200000 s

% N_37=6810973791162508808193807535713860389089116007593537563581359825863603155890696142330154996793100238378705038543902736394725245361881
% Pmax[442]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.030000
% next D is D_1 = 0 at 4342.230000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[37]]=1
% Factor [P]=2003^1
% Factor [P]=839^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 37 at 4342.320000 s

% N_38=225161324070129371172806659951598902437269668520445975308701621976504292557677063478089546807887104529892521783603985373903297
% Pmax[417]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 4342.350000s
% 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 4342.400000s
%T% Ecpp sieve(4): 0.040000
%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 4342.560000s
%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 4342.630000s
%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 4342.720000s
%T% Ecpp sieve(11): 0.020000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4342.790000s
%T% Ecpp sieve(67): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-88)) where (h, g)=(-2, 2)
% next D is D_18 = 88 at 4342.850000s
%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 4342.920000s
%T% Ecpp sieve(187): 0.020000
% Extra square factor: 31
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-232)) where (h, g)=(-2, 2)
% next D is D_24 = 232 at 4343.010000s
%T% Ecpp sieve(232): 0.020000
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 4343.080000s
%T% Ecpp sieve(427): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-56)) where (h, g)=(4, 2)
% next D is D_69 = 56 at 4343.140000s
%T% Ecpp sieve(56): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 11
% D[[38]]=56
% A[[38]]=831482267617731851478179537047895934506249912150611450513487298
% B[[38]]=61132545534535044593109993355960770666282632974244819248552192
% m[[38]]=225161324070129371172806659951598902437269668520445975308701621145022024939945211999910009759991170023642609632992534860416000
% Factor [P]=193^1
% Factor [P]=5^3
% Factor [P]=3^1
% Factor [P]=2^10
% End of depth 38 at 4343.220000 s

% N_39=3038122356300320746610625269208750302748133480683910504489173428662322227708673521155953283678637333004676835505620343
% Pmax[391]=90000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 4343.240000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[39]]=-1
% Factor [P]=11^1
% Factor [P]=7^1
% Factor [P]=2^1
% End of depth 39 at 4343.300000 s

% N_40=19728067248703381471497566683173703264598269355090327951228398887417676803303074812700995348562580084445953477309223
% Pmax[384]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 4343.320000s
% 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 4343.360000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[40]]=3
% A[[40]]=8883164475472274048799389763684708337443287252795950246775
% B[[40]]=23508129947773070002660767355175627475387847167483558533
% m[[40]]=19728067248703381471497566683173703264598269355090327951219515722942204529254275422937310640225136797193157527062449
% Factor [P]=151^1
% Factor [P]=103^1
% Factor [P]=3^1
% End of depth 40 at 4343.430000 s

% N_41=422813760447145919790341985108418595867855491011173148829154412287923112995440867205411831377122029987637058811
% Pmax[368]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 4343.450000s
% 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 4343.490000s
%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 4343.610000s
%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 4343.680000s
%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 4343.730000s
%T% Ecpp sieve(19): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4343.770000s
%T% Ecpp sieve(67): 0.020000
% Extra square factor: 5
% Factorization completed using trial division only
% Extra square factor: 9
% 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 4343.860000s
%T% Ecpp sieve(15): 0.010000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 4343.910000s
%T% Ecpp sieve(40): 0.020000
% Testing if N is a norm in Q(sqrt(-115)) where (h, g)=(-2, 2)
% next D is D_20 = 115 at 4343.960000s
%T% Ecpp sieve(115): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-195)) where (h, g)=(-4, 4)
% next D is D_33 = 195 at 4344.030000s
%T% Ecpp sieve(195): 0.020000
% Testing if N is a norm in Q(sqrt(-520)) where (h, g)=(-4, 4)
% next D is D_42 = 520 at 4344.080000s
%T% Ecpp sieve(520): 0.020000
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-555)) where (h, g)=(-4, 4)
% next D is D_44 = 555 at 4344.150000s
%T% Ecpp sieve(555): 0.020000
% Testing if N is a norm in Q(sqrt(-627)) where (h, g)=(-4, 4)
% next D is D_46 = 627 at 4344.200000s
%T% Ecpp sieve(627): 0.020000
% Testing if N is a norm in Q(sqrt(-715)) where (h, g)=(-4, 4)
% next D is D_48 = 715 at 4344.260000s
%T% Ecpp sieve(715): 0.010000
% No factor found, sieve only: no PRP test
% Extra square factor: 3
% Factorization completed using trial division only
% Testing if N is a norm in Q(sqrt(-1320)) where (h, g)=(-8, 8)
% next D is D_58 = 1320 at 4344.310000s
%T% Ecpp sieve(1320): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 15
% D[[41]]=1320
% A[[41]]=-38563913405979041560343758584106738616347628942906288338
% B[[41]]=-393199410243336073256276317752431972468657562442774505
% m[[41]]=422813760447145919790341985108418595867855491011173148867718325693902154555784625789518569993469658930543347150
% Factor [P]=5^2
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 41 at 4344.390000 s

% N_42=2818758402980972798602279900722790639119036606741154325784788837959347697038564171930123799956464392870288981
% Pmax[361]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 4344.410000s
% 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 4344.440000s
%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 4344.560000s
%T% Ecpp sieve(4): 0.030000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[42]]=4
% A[[42]]=770305658143916340298127291495036030342016268193656530
% B[[42]]=1634140661399391215819100822642313747260238854878806766
% m[[42]]=2818758402980972798602279900722790639119036606741154325014483179815431356740436880435087769614448124676632452
% Factor [P]=2^2
% End of depth 42 at 4344.640000 s

% N_43=704689600745243199650569975180697659779759151685288581253620794953857839185109220108771942403612031169158113
% Pmax[359]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 4344.660000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[43]]=-1
% Factor [P]=4643^1
% Factor [P]=2^5
% End of depth 43 at 4344.700000 s

% N_44=4742957144796220113952253225155460234356552550110977420671042395500335445732212605728865647235166050837
% Pmax[342]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 4344.710000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[44]]=1
% Factor [P]=48121^1
% Factor [P]=11^1
% Factor [P]=2^1
% End of depth 44 at 4344.750000 s

% N_45=4480142996344650241486190328126881133314081878929230878855614346694540321398343008182843671762249
% Pmax[322]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 4344.770000s
% 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 4344.800000s
%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 4344.890000s
%T% Ecpp sieve(8): 0.030000
% Testing if N is a norm in Q(sqrt(-20)) where (h, g)=(-2, 2)
% next D is D_12 = 20 at 4344.940000s
%T% Ecpp sieve(20): 0.020000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 4344.990000s
%T% Ecpp sieve(40): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[45]]=40
% A[[45]]=-2662905670266933167596111008410697733538359654114
% B[[45]]=-520324547197199230284260401976189850126008331910
% m[[45]]=4480142996344650241486190328126881133314081878931893784525881279862136432406753705916382031416364
% Factor [P]=11^1
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 45 at 4345.050000 s

% N_46=14545918819300812472357760805606756926344421684843810988720393765786157248073875668559681920183
% Pmax[313]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 4345.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 4345.090000s
%T% Ecpp sieve(7): 0.010000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 4345.130000s
%T% Ecpp sieve(43): 0.010000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-427)) where (h, g)=(-2, 2)
% next D is D_28 = 427 at 4345.160000s
%T% Ecpp sieve(427): 0.010000
% Testing if N is a norm in Q(sqrt(-56)) where (h, g)=(4, 2)
% next D is D_69 = 56 at 4345.200000s
%T% Ecpp sieve(56): 0.010000
% Testing if N is a norm in Q(sqrt(-568)) where (h, g)=(4, 2)
% next D is D_83 = 568 at 4345.240000s
%T% Ecpp sieve(568): 0.010000
% Testing if N is a norm in Q(sqrt(-763)) where (h, g)=(4, 2)
% Testing if N is a norm in Q(sqrt(-952)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-2968)) where (h, g)=(8, 4)
% Testing if N is a norm in Q(sqrt(-6307)) where (h, g)=(8, 4)
% next D is D_152 = 6307 at 4345.310000s
%T% Ecpp sieve(6307): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-31)) where (h, g)=(3, 1)
% next D is D_229 = 31 at 4345.350000s
%T% Ecpp sieve(31): 0.010000
% Testing if N is a norm in Q(sqrt(-107)) where (h, g)=(3, 1)
% next D is D_232 = 107 at 4345.390000s
%T% Ecpp sieve(107): 0.010000
% Testing if N is a norm in Q(sqrt(-283)) where (h, g)=(3, 1)
% next D is D_235 = 283 at 4345.420000s
%T% Ecpp sieve(283): 0.020000
% Testing if N is a norm in Q(sqrt(-331)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-499)) where (h, g)=(3, 1)
% next D is D_239 = 499 at 4345.470000s
%T% Ecpp sieve(499): 0.010000
% 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)
% Testing if N is a norm in Q(sqrt(-883)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-907)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-707)) where (h, g)=(6, 2)
% next D is D_259 = 707 at 4345.550000s
%T% Ecpp sieve(707): 0.010000
% Testing if N is a norm in Q(sqrt(-856)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-1267)) where (h, g)=(6, 2)
% next D is D_273 = 1267 at 4345.600000s
%T% Ecpp sieve(1267): 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(-1432)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-3763)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-248)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-371)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1043)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-1939)) where (h, g)=(8, 2)
% next D is D_597 = 1939 at 4345.670000s
%T% Ecpp sieve(1939): 0.010000
% Testing if N is a norm in Q(sqrt(-2947)) where (h, g)=(8, 2)
% next D is D_608 = 2947 at 4345.710000s
%T% Ecpp sieve(2947): 0.010000
% Testing if N is a norm in Q(sqrt(-3448)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-3787)) where (h, g)=(8, 2)
% Testing if N is a norm in Q(sqrt(-4216)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-5848)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-7672)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-14008)) where (h, g)=(16, 4)
% Testing if N is a norm in Q(sqrt(-103)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-127)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-179)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-739)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1723)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1747)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-1867)) where (h, g)=(5, 1)
% next D is D_1067 = 1867 at 4345.880000s
%T% Ecpp sieve(1867): 0.010000
% Testing if N is a norm in Q(sqrt(-2203)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-2347)) where (h, g)=(5, 1)
% Testing if N is a norm in Q(sqrt(-119)) where (h, g)=(10, 2)
% next D is D_1071 = 119 at 4345.930000s
%T% Ecpp sieve(119): 0.020000
% Testing if N is a norm in Q(sqrt(-344)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1643)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1819)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-1891)) where (h, g)=(10, 2)
% next D is D_1104 = 1891 at 4346.000000s
%T% Ecpp sieve(1891): 0.020000
% No factor found, sieve only: no PRP test
% Testing if N is a norm in Q(sqrt(-2776)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-5611)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-5803)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-7123)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-7483)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-13843)) where (h, g)=(10, 2)
% Testing if N is a norm in Q(sqrt(-9331)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-12019)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-16408)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-18232)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-23443)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-31003)) where (h, g)=(20, 4)
% Testing if N is a norm in Q(sqrt(-731)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-1208)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-1336)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-2104)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-2488)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-2723)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-2872)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-3043)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-4291)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-4792)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-4907)) where (h, g)=(12, 2)
% next D is D_1630 = 4907 at 4346.240000s
%T% Ecpp sieve(4907): 0.020000
% Testing if N is a norm in Q(sqrt(-6283)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-9667)) where (h, g)=(12, 2)
% Testing if N is a norm in Q(sqrt(-5432)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-8344)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-11032)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-14392)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-17752)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-25048)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-38227)) where (h, g)=(24, 4)
% Testing if N is a norm in Q(sqrt(-71)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-151)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-223)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-463)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-487)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-587)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-811)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-859)) where (h, g)=(7, 1)
% next D is D_2274 = 859 at 4346.440000s
%T% Ecpp sieve(859): 0.010000
% Testing if N is a norm in Q(sqrt(-1171)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-1627)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-1787)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2011)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2083)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2179)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2251)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-2467)) where (h, g)=(7, 1)
% next D is D_2286 = 2467 at 4346.540000s
%T% Ecpp sieve(2467): 0.010000
% Testing if N is a norm in Q(sqrt(-3019)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-5107)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-5923)) where (h, g)=(7, 1)
% Testing if N is a norm in Q(sqrt(-3352)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-5971)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-6979)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-11227)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-13027)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-13603)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-16867)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-18547)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-18643)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-30067)) where (h, g)=(14, 2)
% Testing if N is a norm in Q(sqrt(-5656)) where (h, g)=(28, 4)
% next D is D_2430 = 5656 at 4346.700000s
%T% Ecpp sieve(5656): 0.020000
% Testing if N is a norm in Q(sqrt(-27931)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-37723)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-73627)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-77707)) where (h, g)=(28, 4)
% Testing if N is a norm in Q(sqrt(-1016)) where (h, g)=(16, 2)
% next D is D_2680 = 1016 at 4346.780000s
%T% Ecpp sieve(1016): 0.010000
% Testing if N is a norm in Q(sqrt(-1379)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-3379)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-4171)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-4687)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-7747)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-8299)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-9208)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-10843)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-11179)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-11512)) where (h, g)=(16, 2)
% next D is D_2741 = 11512 at 4346.900000s
%T% Ecpp sieve(11512): 0.020000
% Testing if N is a norm in Q(sqrt(-16531)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-17323)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-22843)) where (h, g)=(16, 2)
% Testing if N is a norm in Q(sqrt(-15736)) where (h, g)=(32, 4)
% Testing if N is a norm in Q(sqrt(-17272)) where (h, g)=(32, 4)
% Testing if N is a norm in Q(sqrt(-17731)) where (h, g)=(32, 4)
% Testing if N is a norm in Q(sqrt(-30328)) where (h, g)=(32, 4)
% Testing if N is a norm in Q(sqrt(-49912)) where (h, g)=(32, 4)
% Testing if N is a norm in Q(sqrt(-53227)) where (h, g)=(32, 4)
% Testing if N is a norm in Q(sqrt(-67123)) where (h, g)=(32, 4)
% Testing if N is a norm in Q(sqrt(-199)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-367)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-419)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-563)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-1087)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-1187)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-1579)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-2003)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-2803)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-3163)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-3307)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-3547)) where (h, g)=(9, 1)
% Testing if N is a norm in Q(sqrt(-3643)) where (h, g)=(9, 1)
% next D is D_3124 = 3643 at 4347.160000s
%T% Ecpp sieve(3643): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 25
% D[[46]]=3643
% A[[46]]=240158202233116963684243764374707498171109485852
% B[[46]]=373318603074828641376240039456899348777517286
% m[[46]]=14545918819300812472357760805606756926344421684603652786487276802101913483699168170388572434332
% Factor [P]=359^1
% Factor [P]=97^1
% Factor [P]=13^1
% Factor [P]=7^1
% Factor [P]=2^2
% End of depth 46 at 4347.200000 s

% N_47=1147555220332527200536414514911576134500630163641029595073680051843176267209019693185331
% Pmax[290]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 4347.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 4347.240000s
%T% Ecpp sieve(3): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[47]]=3
% A[[47]]=-49314441691064399877680256468833422592034811
% B[[47]]=26822296210607560973232111418752716724557399
% m[[47]]=1147555220332527200536414514911576134500630212955471286138079929523432736042442285220143
% Factor [P]=1723^1
% Factor [P]=61^1
% Factor [P]=3^1
% End of depth 47 at 4347.310000 s

% N_48=3639462306285349293982774087994875295347199772145645338820268148144939522951905227
% Pmax[271]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 4347.320000s
% 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 4347.340000s
%T% Ecpp sieve(3): 0.020000
% No factor found, sieve only: no PRP test
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[48]]=3
% A[[48]]=-118087743004153087978378629340298553476875
% B[[48]]=-14296085447031652426843003070924294393431
% m[[48]]=3639462306285349293982774087994875295347317859888649491908246526774279821505382103
% Factor [P]=3^1
% End of depth 48 at 4347.390000 s

% N_49=1213154102095116431327591362664958431782439286629549830636082175591426607168460701
% Pmax[270]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 4347.410000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[49]]=1
% Factor [P]=7^1
% Factor [P]=2^1
% End of depth 49 at 4347.430000 s

% N_50=86653864435365459380542240190354173698745663330682130759720155399387614797747193
% Pmax[266]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 4347.440000s
% 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 4347.460000s
%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 4347.520000s
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[50]]=4
% A[[50]]=2119441305497526466635089755548922927256
% B[[50]]=9248289386340762344969277612157552969197
% m[[50]]=86653864435365459380542240190354173698743543889376633233253520309632065874819938
% Factor [P]=1193^1
% Factor [P]=337^1
% Factor [P]=3^2
% Factor [P]=2^1
% End of depth 50 at 4347.560000 s

% N_51=11974160793905411440975511368568846032389668368452282400337489115901676401
% Pmax[243]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.020000
% next D is D_1 = 0 at 4347.580000s
% 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 4347.590000s
%T% Ecpp sieve(3): 0.020000
% Extra square factor: 425
% Factorization completed using trial division only
% 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 4347.650000s
%T% Ecpp sieve(4): 0.030000
%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 4347.720000s
%T% Ecpp sieve(8): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 4
% D[[51]]=8
% A[[51]]=4186167605351970831933043662010867814
% B[[51]]=1948481586887703692398020095718465126
% m[[51]]=11974160793905411440975511368568846028203500763100311568404445453890808588
% Factor [P]=7283^1
% Factor [P]=11^3
% Factor [P]=3^2
% Factor [P]=2^2
% End of depth 51 at 4347.760000 s

% N_52=34312646775735436004310094752207175718875545486388422772726904371
% Pmax[215]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 4347.770000s
% 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 4347.780000s
%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 4347.840000s
%T% Ecpp sieve(8): 0.020000
% Testing if N is a norm in Q(sqrt(-15)) where (h, g)=(-2, 2)
% next D is D_11 = 15 at 4347.870000s
%T% Ecpp sieve(15): 0.020000
% Testing if N is a norm in Q(sqrt(-40)) where (h, g)=(-2, 2)
% next D is D_15 = 40 at 4347.900000s
%T% Ecpp sieve(40): 0.010000
% 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 4347.930000s
%T% Ecpp sieve(51): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 6
% D[[52]]=51
% A[[52]]=-369700107023103360279501579120872
% B[[52]]=-3350206227329968361147795231890
% m[[52]]=34312646775735436004310094752207545418982568589748702274306025244
% Factor [P]=23^1
% Factor [P]=11^2
% Factor [P]=2^2
% End of depth 52 at 4347.970000 s

% N_53=3082343404216262666574748001455941916904650430268478465173017
% Pmax[201]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 4347.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 4347.990000s
%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[[53]]=4
% A[[53]]=-3302767405483798335236128162408
% B[[53]]=-596049721528932076189068559549
% m[[53]]=3082343404216262666574748001459244684310134228603714593335426
% Factor [P]=37^1
% Factor [P]=2^1
% End of depth 53 at 4348.060000 s

% N_54=41653289246165711710469567587287090328515327413563710720749
% Pmax[195]=70000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 4348.070000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[54]]=-1
% Factor [P]=4973^1
% Factor [P]=109^1
% Factor [P]=37^1
% Factor [P]=2^2
% End of depth 54 at 4348.080000 s

% N_55=519209499287295852232224700056315638398695971057543
% Pmax[169]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 4348.090000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Testing if N is a norm in Q(sqrt(-67)) where (h, g)=(-1, 1)
% next D is D_9 = 67 at 4348.100000s
%T% Ecpp sieve(67): 0.010000
% Testing if N is a norm in Q(sqrt(-568)) where (h, g)=(4, 2)
% next D is D_83 = 568 at 4348.120000s
%T% Ecpp sieve(568): 0.010000
% Testing if N is a norm in Q(sqrt(-1411)) where (h, g)=(4, 2)
% 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 4348.140000s
%T% Ecpp sieve(107): 0.010000
% Testing if N is a norm in Q(sqrt(-283)) where (h, g)=(3, 1)
% Testing if N is a norm in Q(sqrt(-331)) 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)
% Testing if N is a norm in Q(sqrt(-856)) where (h, g)=(6, 2)
% Testing if N is a norm in Q(sqrt(-2923)) where (h, g)=(6, 2)
% next D is D_290 = 2923 at 4348.170000s
%T% Ecpp sieve(2923): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 5
% D[[55]]=2923
% A[[55]]=11396645236180750002967003
% B[[55]]=816137795536632690393859
% m[[55]]=519209499287295852232224688659670402217945968090541
% Factor [P]=1531^1
% End of depth 55 at 4348.190000 s

% N_56=339130959691244841431890717609190334564301742711
% Pmax[158]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 4348.200000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[56]]=-1
% Factor [P]=2423^1
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 56 at 4348.200000 s

% N_57=13996325203930864277007458423821309722009977
% Pmax[144]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 4348.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 4348.210000s
%T% Ecpp sieve(4): 0.020000
% Cofactor after sieve is a probable prime
% Number of D tried was 2
% D[[57]]=4
% A[[57]]=3542723863738778647048
% B[[57]]=3295239310012978285549
% m[[57]]=13996325203930864277003915699957570943362930
% Factor [P]=5^1
% Factor [P]=2^1
% End of depth 57 at 4348.230000 s

% N_58=1399632520393086427700391569995757094336293
% Pmax[141]=50000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 4348.240000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[58]]=-1
% Factor [P]=71^1
% Factor [P]=29^1
% Factor [P]=17^1
% Factor [P]=2^2
% End of depth 58 at 4348.250000 s

% N_59=9996518301239082562211750207094799691
% Pmax[123]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 4348.250000s
% 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 4348.250000s
%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 4348.260000s
%T% Ecpp sieve(8): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[59]]=8
% A[[59]]=-3497537856943815258
% B[[59]]=-1862568862626332345
% m[[59]]=9996518301239082565709288064038614950
% Factor [P]=17^1
% Factor [P]=5^2
% Factor [P]=3^3
% Factor [P]=2^1
% End of depth 59 at 4348.270000 s

% N_60=435578139487541723996047410197761
% Pmax[109]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 4348.270000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[60]]=-1
% Factor [P]=5^1
% Factor [P]=3^1
% Factor [P]=2^8
% End of depth 60 at 4348.270000 s

% N_61=113431807158213990623970679739
% Pmax[97]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 4348.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 4348.280000s
%T% Ecpp sieve(8): 0.000000
% Testing if N is a norm in Q(sqrt(-43)) where (h, g)=(-1, 1)
% next D is D_8 = 43 at 4348.280000s
%T% Ecpp sieve(43): 0.010000
% Cofactor after sieve is a probable prime
% Number of D tried was 3
% D[[61]]=43
% A[[61]]=-529034963667008
% B[[61]]=-63584632458638
% m[[61]]=113431807158214519658934346748
% Factor [P]=1741^1
% Factor [P]=47^1
% Factor [P]=41^1
% Factor [P]=2^2
% End of depth 61 at 4348.290000 s

% N_62=8452678953411713026541
% Pmax[73]=10000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 4348.290000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[62]]=-1
% Factor [P]=229^1
% Factor [P]=71^1
% Factor [P]=5^1
% Factor [P]=2^2
% End of depth 62 at 4348.290000 s

% N_63=25993846341754453
% Pmax[55]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.010000
% next D is D_1 = 0 at 4348.300000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[63]]=-1
% Factor [P]=7^1
% Factor [P]=3^2
% Factor [P]=2^2
% End of depth 63 at 4348.300000 s

% N_64=103150183895851
% Pmax[47]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 4348.300000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Cofactor after sieve is a probable prime
% Number of D tried was 1
% D[[64]]=-1
% Factor [P]=83^1
% Factor [P]=43^1
% Factor [P]=19^1
% Factor [P]=13^1
% Factor [P]=7^1
% Factor [P]=5^2
% Factor [P]=3^1
% Factor [P]=2^1
% End of depth 64 at 4348.300000 s

% N_65=111439
% Pmax[17]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 4348.300000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[65]]=-1
% Factor [P]=151^1
% Factor [P]=41^1
% Factor [P]=3^2
% Factor [P]=2^1
% Cofactor is 1
% End of depth 65 at 4348.300000 s

% N_66=151
% Pmax[8]=5000
% Entering PreSieveWithTabCompactMax
%T% Presieve: 0.000000
% next D is D_1 = 0 at 4348.300000s
% Entering SievePMWithTab
%T% Ecpp sieve(-1): 0.000000
% Factorization completed using sieve only
% Number of D tried was 1
% D[[66]]=-1
% Factor [P]=5^2
% Factor [P]=3^1
% Factor [P]=2^1
% Cofactor is 1
% End of depth 66 at 4348.300000 s


% Time for building is 1611.680000 s

% Starting phase 2: proving
% Starting proving job for step 0
% 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.330000
% Suggested twist(427)=-1
% Entering AEcModProveLarge
%T% ProveStep(427): 3.330000
% N_0 is prime
% Time for proof[0] is 3.330000 s

% Starting proving job for step 1
% D=955 h=4 g=2 invcode=11 (Stark's) g0=2
%T% one root in FindG2G3s: 0.320000s
% Using Stark's theorem
% E found
%T% find E: 0.640000
% Suggested twist(955)=-1
% Entering AEcModProveLarge
%T% ProveStep(955): 3.580000
% N_1 is prime
% Time for proof[1] is 3.580000 s

% Starting proving job for step 2
% 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): 2.610000
% N_2 is prime
% Time for proof[2] is 2.610000 s

% Starting proving job for step 3
% D=163 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(163)=1
% Entering AEcModProveLarge
%T% ProveStep(163): 2.600000
% N_3 is prime
% Time for proof[3] is 2.600000 s

% Starting proving job for step 4
% Entering FindEForD0mod3
% D=1380 h=-8 g=8 invcode=10 (w3) g0=8
%T% one root in GetInvariant: 0.000000s
% u has been computed
%T% FindW: 0.810000
% E found
%T% find E: 0.810000
% Suggested twist(1380)=1
% Entering AEcModProveLarge
%T% ProveStep(1380): 3.320000
% N_4 is prime
% Time for proof[4] is 3.320000 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): 2.470000
% N_5 is prime
% Time for proof[5] is 2.470000 s

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

% Starting proving job for step 7
% Entering FindEForD0mod3
% D=1995 h=-8 g=8 invcode=10 (w3) g0=8
%T% one root in GetInvariant: 0.000000s
% u has been computed
%T% FindW: 0.700000
% E found
%T% find E: 0.700000
% Suggested twist(1995)=-1
% Entering AEcModProveLarge
%T% ProveStep(1995): 2.900000
% N_7 is prime
% Time for proof[7] is 2.900000 s

% Starting proving job for step 8
% 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): 2.120000
% N_8 is prime
% Time for proof[8] is 2.120000 s

% Starting proving job for step 9
% D=323 h=4 g=2 invcode=11 (Stark's) g0=2
%T% one root in FindG2G3s: 0.230000s
% Using Stark's theorem
% E found
%T% find E: 0.450000
% Suggested twist(323)=-1
% Entering AEcModProveLarge
%T% ProveStep(323): 2.520000
% N_9 is prime
% Time for proof[9] is 2.520000 s

% Starting proving job for step 10
% D=979 h=8 g=2 invcode=11 (Stark's) g0=2
%T% Factor of degree 1 found: 4.020000
%T% one root in FindG2G3s: 4.870000s
% Using Stark's theorem
% E found
%T% find E: 5.080000
% Suggested twist(979)=-1
% Entering AEcModProveLarge
%T% ProveStep(979): 6.990000
% N_10 is prime
% Time for proof[10] is 6.990000 s

% Starting proving job for step 11
% 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): 1.560000
% N_11 is prime
% Time for proof[11] is 1.560000 s

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

% Starting proving job for step 13
%T% ProveStep(1): 0.690000
% N_13 is prime
% Time for proof[13] is 0.690000 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): 1.410000
% N_14 is prime
% Time for proof[14] is 1.410000 s

% Starting proving job for step 15
% D=355 h=4 g=2 invcode=11 (Stark's) g0=2
%T% one root in FindG2G3s: 0.160000s
% Using Stark's theorem
% E found
%T% find E: 0.310000
% Suggested twist(355)=1
% Entering AEcModProveLarge
%T% ProveStep(355): 1.750000
% N_15 is prime
% Time for proof[15] is 1.750000 s

% Starting proving job for step 16
% 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): 1.180000
% N_16 is prime
% Time for proof[16] is 1.180000 s

% Starting proving job for step 17
% Entering FindEForD0mod3
% D=291 h=4 g=2 invcode=10 (w3) g0=2
%T% one root in GetInvariant: 0.140000s
% u has been computed
%T% FindW: 0.290000
% E found
%T% find E: 0.300000
% Suggested twist(291)=-1
% Entering AEcModProveLarge
%T% ProveStep(291): 1.620000
% N_17 is prime
% Time for proof[17] is 1.620000 s

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

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

% Starting proving job for step 20
% 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): 1.030000
% N_20 is prime
% Time for proof[20] is 1.030000 s

% Starting proving job for step 21
% 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.110000
% Suggested twist(235)=1
% Entering AEcModProveLarge
%T% ProveStep(235): 1.130000
% N_21 is prime
% Time for proof[21] is 1.130000 s

% Starting proving job for step 22
% 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.990000
% N_22 is prime
% Time for proof[22] is 0.990000 s

% Starting proving job for step 23
% D=115 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.090000
% Suggested twist(115)=1
% Entering AEcModProveLarge
%T% ProveStep(115): 1.030000
% N_23 is prime
% Time for proof[23] is 1.030000 s

% Starting proving job for step 24
% D=5368 h=20 g=4 invcode=3 (f1^2/sqrt(2)) g0=4
%T% Factor of degree 1 found: 8.490000
%T% one root in GetInvariant: 8.490000s
% u has been computed
%T% FindJ: 8.680000
% E found
%T% find E: 8.680000
% Entering AEcModProveLarge
%T% ProveStep(5368): 9.570000
% N_24 is prime
% Time for proof[24] is 9.570000 s

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

% Starting proving job for step 26
% 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.720000
% N_26 is prime
% Time for proof[26] is 0.720000 s

% Starting proving job for step 27
% 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.710000
% N_27 is prime
% Time for proof[27] is 0.710000 s

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

% Starting proving job for step 29
% Entering FindEForD0mod3
% D=123 h=-2 g=2 invcode=10 (w3) g0=2
%T% one root in GetInvariant: 0.000000s
% u has