View Single Post
Old 2016-01-15, 01:31   #4
wombatman
I moo ablest echo power!
 
wombatman's Avatar
 
May 2013

6CD16 Posts
Default

It's not a screenshot, but here's the full text:

Code:
$ yafu-x64.exe "tune()" -v -v


01/14/16 19:30:18 v1.34.5 @ BEN-PC, System/Build Info:
Using GMP-ECM, Powered by GMP
detected        Intel(R) Core(TM) i7-4930K CPU @ 3.40GHz
detected L1 = 32768 bytes, L2 = 12582912 bytes, CL = 64 bytes
measured cpu frequency ~= 3362.986750
using 1 random witnesses for Rabin-Miller PRP checks

===============================================================
======= Welcome to YAFU (Yet Another Factoring Utility) =======
=======             bbuhrow@gmail.com                   =======
=======     Type help at any time, or quit to quit      =======
===============================================================
cached 78498 primes. pmax = 999983


>> Setting THREADS = 1 for tuning

starting SIQS on c60: 349594255864176572614071853194924838158088864370890996447417
fb bounds: 85%
        small: 1024
        SPV: 36
        10bit: 104
        11bit: 168
        12bit: 296
        13bit: 520
        32k div 3: 688
        14bit: 968
        15bit: 1736
        med: 2544
        large: 3488
        all: 3488
start primes
        SPV: 251
        10bit: 1039
        11bit: 2153
        12bit: 4201
        13bit: 8147
        32k div 3: 11003
        14bit: 16433
        15bit: 32803
        med: 49277
        large: 70009

==== sieve params ====
n = 61 digits, 201 bits
factor base: 3488 primes (max prime = 70009)
single large prime cutoff: 3850495 (55 * pmax)
allocating 2 large prime slices of factor base
buckets hold 2048 elements
using SSE4.1 enabled 32k sieve core
sieve interval: 4 blocks of size 32768
polynomial A has ~ 7 factors
using multiplier of 7
using SPV correction of 20 bits, starting at offset 36
using SSE2 for x64 sieve scanning
using SSE2 for resieving 13-16 bit primes
using SSE2 for 8x trial divison to 13 bits
using SSE4.1 and inline ASM for small prime sieving
using SSE2 for poly updating up to 15 bits
using SSE4.1 for medium prime poly updating
using SSE4.1 and inline ASM for large prime poly updating
trial factoring cutoff at 68 bits

==== sieving in progress (1 thread):    3552 relations needed ====
====           Press ctrl-c to abort and save state           ====
996 rels found: 700 full + 296 from 6611 partial, (5387.61 rels/sec)
Max specified relations found

sieve time = 0.0000, relation time = 0.0000, poly_time = 0.0000
trial division touched 114375 sieve locations out of 1593573376


sieving required 6079 total polynomials
trial division touched 114375 sieve locations out of 1593573376
That last line is the last thing that appears on the screen before it crashes.

Edit to add: If I run siqs() on the number, the crash occurs after the linear algebra step:

Code:
sieving required 0 total polynomials
trial division touched 0 sieve locations out of 0
QS elapsed time = 0.0400 seconds.

==== post processing stage (msieve-1.38) ====
begin with 18896 relations
reduce to 5518 relations in 2 passes
attempting to read 5518 relations
recovered 5518 relations
recovered 4324 polynomials
freed 2 duplicate relations
attempting to build 3804 cycles
found 3804 cycles in 1 passes
distribution of cycle lengths:
   length 1 : 1830
   length 2 : 1974
largest cycle: 2 relations
matrix is 3488 x 3804 (0.5 MB) with weight 98453 (25.88/col)
sparse part has weight 98453 (25.88/col)
filtering completed in 4 passes
matrix is 3232 x 3296 (0.4 MB) with weight 82450 (25.02/col)
sparse part has weight 82450 (25.02/col)
commencing Lanczos iteration
memory use: 0.6 MB
lanczos halted after 52 iterations (dim = 3226)
recovered 61 nontrivial dependencies
Lanczos elapsed time = 0.0700 seconds.
Sqrt elapsed time = 0.0050 seconds.
SIQS elapsed time = 0.1150 seconds.

Last fiddled with by wombatman on 2016-01-15 at 01:34
wombatman is offline   Reply With Quote