Links to Precompiled GMP-ECM versions - Page 36

pinhodecarlos · 2015-12-09, 16:23

Can I request linux 64-bit binaries for IB, SB, H and AMD processors? Thank you in advance. Carlos

VBCurtis · 2015-12-09, 20:43

Quote:

Originally Posted by VolMike

Thank you!

Thanks, indeed, to ATH. On my Core-M (broadwell?) laptop, his Haswell binary improved stage 2 by 25%.

VictordeHolland · 2015-12-10, 02:03

Quote:

Originally Posted by ATH

Lastest SVN 2745 compiled for Sandy Bridge with GMP 6.1.0 with the following:
./configure ABI=64 CC=gcc CFLAGS="-O3 -m64 -mavx -march=sandybridge -mtune=sandybridge" LDFLAGS="-Wl,--stack,16777216" --build=x86_64-w64-mingw32 --disable-assert

I tested your executable (SVN 2745, GMP6.1.0 SandyBridge) versus (GMP-ECM 6.4.4 MPIR2.6.0) on some Mersenne numbers with large known ECM factors (M1069, M1163, M1181), the speed differences are quite noticable.
It's also good to know it finds the factors with the lucky sigmas ;) .

Mersenne B1 and B2 values Stage2time 6.4.4 - SVN2745
M1069 (B1=40e6 , B2=12.7e12) 1113 sec - 790 sec
M1163 (B1=500e6 , B2=15.8e12) 1,547 sec - 1,103 sec
M1181 (B1=2.9e9 , B2=82.6e12) 6,967 sec - 5,101 sec

GMP-ECM 6.4.4 [configured with MPIR 2.6.0] [ECM]

Code:

Resuming ECM residue saved with Prime95 
Input number is 0x524EB487386A7910F4BD06831FC6E00169AD6462B2E8F3FA67871F815C1EFA553F229D464ECEE9AF1BA9DE7DFE60FFBEC3E38DF878DDE9041D8F90958054729DB7D394C3BEC0512041E7E47DD7C2964D4F86E4628B2F7D0EA6137C0DBC794C1FC46E383925D786B616E39 (256 digits)
Using special division for factor of 2^1069-1
Using B1=40000000-40000000, B2=12713429328616, polynomial Dickson(30), sigma=3725672826
dF=524288, k=4, d=5705700, d2=17, i0=-9
Step 1 took 16ms
Step 2 took 1112614ms
********** Factor found in step 2: 5557036167944892502666285821951871600803581019193074182942021552512721
Found probable prime factor of 70 digits: 5557036167944892502666285821951871600803581019193074182942021552512721

Resuming ECM residue saved with Prime95 
Input number is 0x9147A2E44DC7CF72A0E935C6A5B17DB9B421E806990653A5CE2270883D931F04BC0E4B92D7C2A951DCFE8DCEBBD97C4B6A948C38A95B8E8AB435984DA07D775B77D2DF227C0178F23596DB9444226F908FC44E71AF85FCEAE217AFB8005E0750DABFCEC0EA93DD74F7B3359901CB33BEC52F607D3C521AC9851E95AAA1BE025DAC012E09 (318 digits)
Using special division for factor of 2^1163-1
Using B1=500000000-500000000, B2=15892280203816, polynomial Dickson(30), sigma=3000085158
dF=524288, k=5, d=5705700, d2=17, i0=71
Step 1 took 0ms
Step 2 took 1547358ms
********** Factor found in step 2: 1042816042941845750042952206680089794415014668329850393031910483526456487
Found probable prime factor of 73 digits: 1042816042941845750042952206680089794415014668329850393031910483526456487

Resuming ECM residue saved with Prime95 
Input number is 0x1214395AD012FF6F732747927DA7F9F1684B0A4396B182F9030AC8D53DFBA4C66B6BF1F17321FE0918762863C338F490D3EEBDDE0B051E21917932F1A8A788241C1EEDDF977C28153D7FCA61364600F25C1A55E5D8D634024284477D712079C06B26B057DEE465C1004898499F274C7227E5432845DCDD5EC7 (291 digits)
Using special division for factor of 2^1181-1
Using B1=2900000000-2900000000, B2=82640965106716, polynomial Dickson(30), sigma=4000027779
dF=524288, k=26, d=5705700, d2=17, i0=492
Step 1 took 0ms
Step 2 took 6966536ms
********** Factor found in step 2: 1808422353177349564546512035512530001279481259854248860454348989451026887
Found probable prime factor of 73 digits: 1808422353177349564546512035512530001279481259854248860454348989451026887

GMP-ECM 7.0-dev SVN2745 [configured with GMP 6.1.0, --enable-asm-redc] [ECM]

Code:

Resuming ECM residue saved with Prime95 
Input number is 0x524EB487386A7910F4BD06831FC6E00169AD6462B2E8F3FA67871F815C1EFA553F229D464ECEE9AF1BA9DE7DFE60FFBEC3E38DF878DDE9041D8F90958054729DB7D394C3BEC0512041E7E47DD7C2964D4F86E4628B2F7D0EA6137C0DBC794C1FC46E383925D786B616E39 (256 digits)
Using special division for factor of 2^1069-1
Using B1=40000000-40000000, B2=12713429328616, polynomial Dickson(30), sigma=0:3725672826
dF=524288, k=4, d=5705700, d2=17, i0=-9
Step 1 took 15ms
Step 2 took 790442ms
********** Factor found in step 2: 5557036167944892502666285821951871600803581019193074182942021552512721
Found prime factor of 70 digits: 5557036167944892502666285821951871600803581019193074182942021552512721

Resuming ECM residue saved with Prime95 
Input number is 0x9147A2E44DC7CF72A0E935C6A5B17DB9B421E806990653A5CE2270883D931F04BC0E4B92D7C2A951DCFE8DCEBBD97C4B6A948C38A95B8E8AB435984DA07D775B77D2DF227C0178F23596DB9444226F908FC44E71AF85FCEAE217AFB8005E0750DABFCEC0EA93DD74F7B3359901CB33BEC52F607D3C521AC9851E95AAA1BE025DAC012E09 (318 digits)
Using special division for factor of 2^1163-1
Using B1=500000000-500000000, B2=15892280203816, polynomial Dickson(30), sigma=0:3000085158
dF=524288, k=5, d=5705700, d2=17, i0=71
Step 1 took 0ms
Step 2 took 1102802ms
********** Factor found in step 2: 1042816042941845750042952206680089794415014668329850393031910483526456487
Found prime factor of 73 digits: 1042816042941845750042952206680089794415014668329850393031910483526456487

Resuming ECM residue saved with Prime95 
Input number is 0x1214395AD012FF6F732747927DA7F9F1684B0A4396B182F9030AC8D53DFBA4C66B6BF1F17321FE0918762863C338F490D3EEBDDE0B051E21917932F1A8A788241C1EEDDF977C28153D7FCA61364600F25C1A55E5D8D634024284477D712079C06B26B057DEE465C1004898499F274C7227E5432845DCDD5EC7 (291 digits)
Using special division for factor of 2^1181-1
Using B1=2900000000-2900000000, B2=82640965106716, polynomial Dickson(30), sigma=0:4000027779
dF=524288, k=26, d=5705700, d2=17, i0=492
Step 1 took 15ms
Step 2 took 5101311ms
********** Factor found in step 2: 1808422353177349564546512035512530001279481259854248860454348989451026887
Found prime factor of 73 digits: 1808422353177349564546512035512530001279481259854248860454348989451026887

LaurV · 2015-12-10, 02:30

Quote:

Originally Posted by VictordeHolland

Massive thanks!
That one is almost 20% faster in stage 2 on my Sandy and Ivy Bridge processors compared to the ancient one I was using (GMP-ECM 6.4.4 with MPIR2.6.0 for processor type i7 from this page) .
I wanted to get/compile more recent ones myself, but never got around to do so.

+1 from me! Same here! Thanks ATH!

Gordon · 2015-12-12, 15:22

Quote:

Originally Posted by ATH

Lastest SVN 2745 compiled on for Haswell with GMP 6.1.0 with the following:
./configure ABI=64 CC=gcc CFLAGS="-O3 -m64 -mavx2 -mfma -march=haswell -mtune=haswell" LDFLAGS="-Wl,--stack,16777216" --build=x86_64-w64-mingw32 --disable-assert

gmpecm7-svn2745.zip

Doesn't play well with interim stage 1 residue files from Prime95

"Error, save file line has no '=' in : [Fri Dec 11 18:"

whereas the version in this : ecm70dev-svn2256-x64-nehalem.zip copes just fine with the missing '=' and carries on.

Not really practical to edit the results file when it contains the residues from 600 curves....

Phil MjX · 2015-12-12, 19:07

Thanks for the binaries.

They are faster than all previous precompiled versions that I have for my laptop but the auto-increase of B1 bounds has disappeared (-i option) and B2scale also.

It may cause aliqueit to crash in some cases and ecp.py to be tweaked.

Philippe

MatWur-S530113 · 2015-12-12, 19:07

Quote:

Originally Posted by ATH

Lastest SVN 2745 compiled on for Haswell with GMP 6.1.0 with the following:
./configure ABI=64 CC=gcc CFLAGS="-O3 -m64 -mavx2 -mfma -march=haswell -mtune=haswell" LDFLAGS="-Wl,--stack,16777216" --build=x86_64-w64-mingw32 --disable-assert

gmpecm7-svn2745.zip

Many thanks from me, too

Indeed this version is about 22% faster at stage 2 as my old one with GMP 4.4, very nice!
The zip contains 2 more exe-files 'ecmfactor' and 'multiecm', any info about them available?

@ Gordon: I simply wrote a 20 line proggy with Lazarus, reading a prime95-stage1-output-txt-file, deleting all lines starting with a bracket '[' and resaving it to an gmp-stage2-input-file. I never had problems with the bracket

Gordon · 2015-12-20, 15:03

Quote:

Originally Posted by MatWur-S530113

Many thanks from me, too

Indeed this version is about 22% faster at stage 2 as my old one with GMP 4.4, very nice!
The zip contains 2 more exe-files 'ecmfactor' and 'multiecm', any info about them available?

@ Gordon: I simply wrote a 20 line proggy with Lazarus, reading a prime95-stage1-output-txt-file, deleting all lines starting with a bracket '[' and resaving it to an gmp-stage2-input-file. I never had problems with the bracket

I downloaded Notepad++ and with a bit of regex was able to fix it.

I too am curious about multiecm...

ATH · 2015-12-20, 16:32

I do not know what "ecmfactor.exe" and "multiecm.exe" are used for. I just include them as they are compiled along side of "ecm.exe". I guess we should ask the GMP-ECM team.

@Gordon: Maybe you should create a thread in the GMP-ECM forum about the issue with interim files from Prime95. I have nothing to do with the GMP-ECM development team, I'm just compiling it (when I can figure out to get it to work).

lavalamp · 2015-12-23, 10:53

Is there an additional benefit if compiled with --ffast-math, or is that too dangerous?

ATH · 2015-12-25, 23:54

Got the latest svn 2749 compiled on a Broadwell laptop only with GMP 6.0.0 unfortunately as 6.1.0 failed to compile (I sent a mail to the gmp site). I also did new compile on haswell and sandybridge with slightly new options:

Broadwell; GMP-ECM7 SVN 2749 with GMP 6.0.0: gmpecm7-svn2749-broadwell.zip (compiled on Core i5 5200U laptop)

Haswell: GMP-ECM7 SVN 2749 with GMP 6.1.0: gmpecm7-svn2749-haswell.zip (compiled on a Haswell-E Core i7 5960X desktop)

Sandy Bridge: GMPECM7 SVN 2749 with GMP 6.1.0: gmpecm7-svn2749-sandybridge.zip (compiled on a Core i7 2720QM laptop)

2015-12-20, 16:32	#394
ATH Einyen Dec 2003 Denmark 101111011101₂ Posts	I do not know what "ecmfactor.exe" and "multiecm.exe" are used for. I just include them as they are compiled along side of "ecm.exe". I guess we should ask the GMP-ECM team. @Gordon: Maybe you should create a thread in the GMP-ECM forum about the issue with interim files from Prime95. I have nothing to do with the GMP-ECM development team, I'm just compiling it (when I can figure out to get it to work). Last fiddled with by ATH on 2015-12-20 at 16:33

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Project Links	masser	Sierpinski/Riesel Base 5	25	2011-11-26 09:21
Links to Precompiled Msieve versions	wblipp	Msieve	0	2011-07-17 20:59
Links	davieddy	Information & Answers	9	2010-10-08 14:27
Links question	ET_	PrimeNet	0	2008-01-26 09:35
Links.	Xyzzy	Forum Feedback	2	2007-03-18 02:17

2015-12-09, 16:23	#386
pinhodecarlos "Carlos Pinho" Oct 2011 Milton Keynes, UK 5×7×139 Posts	Can I request linux 64-bit binaries for IB, SB, H and AMD processors? Thank you in advance. Carlos

2015-12-12, 19:07	#391
Phil MjX Sep 2004 5×37 Posts	Thanks for the binaries. They are faster than all previous precompiled versions that I have for my laptop but the auto-increase of B1 bounds has disappeared (-i option) and B2scale also. It may cause aliqueit to crash in some cases and ecp.py to be tweaked. Philippe

2015-12-23, 10:53	#395
lavalamp Oct 2007 Manchester, UK 53C₁₆ Posts	Is there an additional benefit if compiled with --ffast-math, or is that too dangerous?

2015-12-25, 23:54	#396
ATH Einyen Dec 2003 Denmark 3,037 Posts	Got the latest svn 2749 compiled on a Broadwell laptop only with GMP 6.0.0 unfortunately as 6.1.0 failed to compile (I sent a mail to the gmp site). I also did new compile on haswell and sandybridge with slightly new options: Broadwell; GMP-ECM7 SVN 2749 with GMP 6.0.0: gmpecm7-svn2749-broadwell.zip (compiled on Core i5 5200U laptop) Haswell: GMP-ECM7 SVN 2749 with GMP 6.1.0: gmpecm7-svn2749-haswell.zip (compiled on a Haswell-E Core i7 5960X desktop) Sandy Bridge: GMPECM7 SVN 2749 with GMP 6.1.0: gmpecm7-svn2749-sandybridge.zip (compiled on a Core i7 2720QM laptop)