mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > GMP-ECM

Reply
 
Thread Tools
Old 2015-12-09, 16:23   #386
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

5×7×139 Posts
Default

Can I request linux 64-bit binaries for IB, SB, H and AMD processors? Thank you in advance. Carlos
pinhodecarlos is offline   Reply With Quote
Old 2015-12-09, 20:43   #387
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

124316 Posts
Default

Quote:
Originally Posted by VolMike View Post
Thank you!
Thanks, indeed, to ATH. On my Core-M (broadwell?) laptop, his Haswell binary improved stage 2 by 25%.
VBCurtis is offline   Reply With Quote
Old 2015-12-10, 02:03   #388
VictordeHolland
 
VictordeHolland's Avatar
 
"Victor de Hollander"
Aug 2011
the Netherlands

23×3×72 Posts
Default

Quote:
Originally Posted by ATH View Post
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
VictordeHolland is offline   Reply With Quote
Old 2015-12-10, 02:30   #389
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

52×7×53 Posts
Default

Quote:
Originally Posted by VictordeHolland View Post
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!

Last fiddled with by LaurV on 2015-12-10 at 02:33
LaurV is offline   Reply With Quote
Old 2015-12-12, 15:22   #390
Gordon
 
Gordon's Avatar
 
Nov 2008

7658 Posts
Default

Quote:
Originally Posted by ATH View Post
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....
Gordon is offline   Reply With Quote
Old 2015-12-12, 19:07   #391
Phil MjX
 
Phil MjX's Avatar
 
Sep 2004

5·37 Posts
Default

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
Phil MjX is offline   Reply With Quote
Old 2015-12-12, 19:07   #392
MatWur-S530113
 
MatWur-S530113's Avatar
 
Apr 2007
Spessart/Germany

A216 Posts
Default

Quote:
Originally Posted by ATH View Post
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
MatWur-S530113 is offline   Reply With Quote
Old 2015-12-20, 15:03   #393
Gordon
 
Gordon's Avatar
 
Nov 2008

3×167 Posts
Default

Quote:
Originally Posted by MatWur-S530113 View Post
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...
Gordon is offline   Reply With Quote
Old 2015-12-20, 16:32   #394
ATH
Einyen
 
ATH's Avatar
 
Dec 2003
Denmark

3,037 Posts
Default

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
ATH is online now   Reply With Quote
Old 2015-12-23, 10:53   #395
lavalamp
 
lavalamp's Avatar
 
Oct 2007
Manchester, UK

32×149 Posts
Default

Is there an additional benefit if compiled with --ffast-math, or is that too dangerous?
lavalamp is online now   Reply With Quote
Old 2015-12-25, 23:54   #396
ATH
Einyen
 
ATH's Avatar
 
Dec 2003
Denmark

57358 Posts
Default

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)
ATH is online now   Reply With Quote
Reply

Thread Tools


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

All times are UTC. The time now is 16:58.

Fri Mar 5 16:58:00 UTC 2021 up 92 days, 13:09, 1 user, load averages: 2.57, 2.54, 2.42

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.