- Hi,

please take a short look at this (completed) factorization. Wasn't it

too slow (on this fast machine)? Were the parameters correct? Should

the matrix be so big?

Washuu

PS. I tried ECM, I haven't just been lucky enough.

N=184882746155407225169603381797719531303157417581

05700458865665051663583049065157772996647203603442

175230555693510905800477

( 122 digits)

Divisors found:

r1=3414377722997660306778420701787237313 (pp37)

r2=5414829909125842652937999139221690431040170057

783327360590432991821745452530835636829

(pp85)

Version: GGNFS-0.77.1

Total time: 137.10 hours.

Scaled time: 69.24 units (timescale=0.505).

Factorization parameters were as follows:

name: hp782

n:

18488274615540722516960338179771953130315741758105

70045886566505166358304906515777299664720360344217

5230555693510905800477

skew: 97259.91

# norm 2.22e+16

c5: 3720

c4: -4421372558

c3: -133549990222290

c2: 6810756205034300238

c1: 1039633026003540222243229

c0: 16169508505016419402458994044

# alpha -5.06

Y1: 3479345214763

Y0: -346155890495632062217315

# Murphy_E 2.22e-10

# M

70058916964555953120503678457052770951121009888205

99316670227513859859737087520281507959970424794977

230625625928268216714

type: gnfs

rlim: 5000000

alim: 5000000

lpbr: 27

lpba: 27

mfbr: 50

mfba: 50

rlambda: 2.4

alambda: 2.4

qintsize: 60000

Factor base limits: 5000000/5000000

Large primes per side: 3

Large prime bits: 27/27

Max factor residue bits: 50/50

Sieved algebraic special-q in [2500000, 6400001)

Primes: RFBsize:348513, AFBsize:348365, largePrimes:7890324

encountered

Relations: rels:8169525, finalFF:805105

Max relations in full relation-set: 28

Initial matrix: 696954 x 805105 with sparse part having weight

83420732.

Pruned matrix : 655747 x 659295 with weight 57255737.

Polynomial selection time: 1.51 hours.

Total sieving time: 121.22 hours.

Total relation processing time: 0.72 hours.

Matrix solve time: 13.10 hours.

Time per square root: 0.54 hours.

Prototype def-par.txt line would be:

gnfs,121,5,maxs1,maxskew,goodScore,efrac,j0,j1,eSt

epSize,maxTime,5000000,5000000,27,27,50,50,2.4,2.4,60000

total time: 137.10 hours.

--------- CPU info (if available) ----------

CPU: Intel(R) Pentium(R) 4 CPU 3.40GHz stepping 04

Memory: 1031516k/1048016k available (2084k kernel code, 15572k

reserved, 769k data, 232k init, 130512k highmem)

Calibrating delay loop... 6717.44 BogoMIPS (lpj=3358720) - --- In ggnfs@yahoogroups.com, Bouk de Water <bdewater@y...> wrote:
> Leaving m out is indeed a good idea :-)

Heh, just FYI, the latest CVS snapshots of GGNFS fix this little

>

> -> SNFS_DIFFICULTY is about 679.437899273151143712210122884678133053.

>

> Ouch.

>

> Better now!

problem. You can specify or not specify m at your preference for

non-monic linear polynomials and the SNFS difficulty calculation

should work properly regardless. :)

--

Sam