GMP-ECM 6.0.1

April 1, 2005: We are pleased to announce the release of GMP-ECM 6.0.1, which may be downloaded from:

This is a minor release containing mostly bugfixes:

• now checks for availability of snprintf() during configure
• fixed linking problems with tune and tune2 on PowerPC G5
• fixed segfault in rho.c
• fixed main()'s B2 value being overwritten by callees
• allow both \r and \n for newline (for Apple computers)
• made files compile under Visual C
• fixed bug in listz.c that could leave undefined data
• fixed the -B2scale option
• fixed small error in printed B2' value (with -v)
• added Windows section to INSTALL
• small corrections to ecm.xml and ecm.1
• added curve counter in loop mode again
• fixed segfault when a non-number was in place of B2 on command line
• worked around problem with MinGW/Wine scanf() (value 1 too high for %n)
• free rhotable memory at end of stage 2
• replaced GSL's dilog_series() in rho.c due to licensing (GPL vs. LGPL)

Jim Fougeron
Laurent Fousse
Alexander Kruppa
Dave Newman
Paul Zimmermann

Related links:

• project page on InriaGforge.
• the ECMNET factorization project
• the GMP-ECM thread on mersenneforum.org
• ecm is used in the GGNFS number field sieve implementation (project sourceforge page)
• the previous version (6.0).
• an official debian package is available.

Known problems:

• minor memory leak in mpmod.c/isbase2 (fixed in development version) patch 01
• invalid Found input number N reported on some numbers (patch 02). This could happen for example with F15, B1=99000, B2=150577181, sigma=3039152787.
• a serious bug in P+1 can cause infinite loop or miss factors on 64bits architectures with B1 > 2^32 (patch 03). You can check for the bug on your version with echo 8589934621 | ecm -pp1 -x0 10 4294967310-4294967311 1
• wrong detection of divisors of 2ⁿ+1 or 2ⁿ-1 (patch 04). This patch superseedes patch01.