OPERACIONES MODULARES Y FACTORIZACION

...

searching for 15-digit factors

commencing quadratic sieve (73-digit input)

using multiplier of 13

using generic 32kb sieve core

sieve interval: 12 blocks of size 32768

processing polynomials in batches of 17

using a sieve bound of 414709 (17316 primes)

using large prime bound of 41470900 (25 bits)

using trial factoring cutoff of 25 bits

polynomial 'A' values have 9 factors

17579 relations (8762 full + 8817 combined from 95565 partial), need 17412

begin with 104327 relations

reduce to 25288 relations in 2 passes

attempting to read 25288 relations

recovered 25288 relations

recovered 19512 polynomials

attempting to build 17579 cycles

found 17579 cycles in 1 passes

distribution of cycle lengths:

length 1 : 8762

length 2 : 8817

largest cycle: 2 relations

matrix is 17316 x 17579 (2.5 MB) with weight 514566 (29.27/col)

sparse part has weight 514566 (29.27/col)

filtering completed in 3 passes

matrix is 12929 x 12992 (2.0 MB) with weight 419082 (32.26/col)

sparse part has weight 419082 (32.26/col)

saving the first 48 matrix rows for later

matrix includes 64 packed rows

matrix is 12881 x 12992 (1.5 MB) with weight 319972 (24.63/col)

sparse part has weight 252485 (19.43/col)

commencing Lanczos iteration

memory use: 1.5 MB

lanczos halted after 205 iterations (dim = 12879)

recovered 16 nontrivial dependencies

p36 factor: 577803361030007737556462101396979819

p37 factor: 2784222289679045837865482495812787663

elapsed time 00:00:50

- 1354543287778399153166979461113793173551214783618259618960560750495486103455301

- Msieve v. 1.53 (SVN 1005)

random seeds: 073a5dd8 19492b51

factoring 1354543287778399153166979461113793173551214783618259618960560750495486103455301 (79 digits)

searching for 15-digit factors

commencing quadratic sieve (79-digit input)

using multiplier of 5

using generic 32kb sieve core

sieve interval: 12 blocks of size 32768

processing polynomials in batches of 17

using a sieve bound of 1074461 (41645 primes)

using large prime bound of 107446100 (26 bits)

using trial factoring cutoff of 27 bits

polynomial 'A' values have 10 factors

42159 relations (21810 full + 20349 combined from 228754 partial), need 41741

begin with 250564 relations

reduce to 59982 relations in 2 passes

attempting to read 59982 relations

recovered 59982 relations

recovered 49752 polynomials

attempting to build 42159 cycles

found 42159 cycles in 1 passes

distribution of cycle lengths:

length 1 : 21810

length 2 : 20349

largest cycle: 2 relations

matrix is 41645 x 42159 (6.1 MB) with weight 1255652 (29.78/col)

sparse part has weight 1255652 (29.78/col)

filtering completed in 3 passes

matrix is 29242 x 29305 (4.6 MB) with weight 967309 (33.01/col)

sparse part has weight 967309 (33.01/col)

saving the first 48 matrix rows for later

matrix includes 64 packed rows

matrix is 29194 x 29305 (2.9 MB) with weight 701509 (23.94/col)

sparse part has weight 462980 (15.80/col)

commencing Lanczos iteration

memory use: 2.9 MB

lanczos halted after 464 iterations (dim = 29190)

recovered 16 nontrivial dependencies

p39 factor: 397186006336842365962121302181622579361

p40 factor: 3410349977510659824161633811376227061541

elapsed time 00:03:24

- 1473581925762428348880838685007956586120125158907213652820145423054427928545607960997

- Msieve v. 1.53 (SVN 1005)

random seeds: 4e2b4124 d1b20dc5

factoring