[build-status: 85982] Log for successful build of gmp-ecm_6.1.2-1 (dist=unstable)
Build Daemon 4
buildd4 at linux-m32r.org
Fri Jul 27 01:06:11 JST 2007
Automatic build of gmp-ecm_6.1.2-1 on mappi006 by sbuild/m32r 0.53
Build started at 20070726-2333
******************************************************************************
Checking available source versions...
Fetching source files...
Reading package lists...
Building dependency tree...
Reading state information...
Need to get 422kB of source archives.
Get:1 http://debian.linux-m32r.org 06_devonian/main gmp-ecm 6.1.2-1 (dsc) [577B]
Get:2 http://debian.linux-m32r.org 06_devonian/main gmp-ecm 6.1.2-1 (tar) [388kB]
Get:3 http://debian.linux-m32r.org 06_devonian/main gmp-ecm 6.1.2-1 (diff) [33.3kB]
Fetched 422kB in 10s (39.8kB/s)
Download complete and in download only mode
** Using build dependencies supplied by package:
Build-Depends: debhelper (>= 4.0.0), libgmp3-dev
Checking for already installed source dependencies...
debhelper: already installed (5.0.53 >= 4.0.0 is satisfied)
libgmp3-dev: missing
Checking for source dependency conflicts...
Reading package lists...
Building dependency tree...
Reading state information...
The following extra packages will be installed:
libgmp3c2 libgmpxx4
Suggested packages:
libgmp3-doc libmpfr-dev
The following NEW packages will be installed:
libgmp3-dev libgmp3c2 libgmpxx4
0 upgraded, 3 newly installed, 0 to remove and 27 not upgraded.
Need to get 0B/1097kB of archives.
After unpacking 2228kB of additional disk space will be used.
WARNING: The following packages cannot be authenticated!
libgmp3c2 libgmpxx4 libgmp3-dev
Authentication warning overridden.
Selecting previously deselected package libgmp3c2.
(Reading database ... 54323 files and directories currently installed.)
Unpacking libgmp3c2 (from .../libgmp3c2_2%3a4.2.1+dfsg-4_m32r.deb) ...
Selecting previously deselected package libgmpxx4.
Unpacking libgmpxx4 (from .../libgmpxx4_2%3a4.2.1+dfsg-4_m32r.deb) ...
Selecting previously deselected package libgmp3-dev.
Unpacking libgmp3-dev (from .../libgmp3-dev_2%3a4.2.1+dfsg-4_m32r.deb) ...
Setting up libgmp3c2 (2:4.2.1+dfsg-4) ...
Setting up libgmpxx4 (2:4.2.1+dfsg-4) ...
Setting up libgmp3-dev (2:4.2.1+dfsg-4) ...
Checking correctness of source dependencies...
Kernel: Linux 2.6.20 m32r (m32r)
Toolchain package versions: libc6-dev_2.3.6.ds1-13 linux-kernel-headers_2.6.18-7.0.1 gcc-4.1_4.1.1-21 g++-4.1_4.1.1-21 binutils_2.17-3 libstdc++6-4.1-dev_4.1.1-21 libstdc++6_4.1.1-21
------------------------------------------------------------------------------
gpg: Signature made Sat Jul 21 19:04:24 2007 JST using DSA key ID A1696D2B
gpg: Can't check signature: public key not found
dpkg-source: extracting gmp-ecm in gmp-ecm-6.1.2
dpkg-source: unpacking gmp-ecm_6.1.2.orig.tar.gz
dpkg-source: applying /debian/buildd4/build/gmp-ecm_6.1.2-1.diff.gz
dpkg-buildpackage: source package is gmp-ecm
dpkg-buildpackage: source version is 6.1.2-1
dpkg-buildpackage: source changed by Laurent Fousse <laurent at komite.net>
dpkg-buildpackage: host architecture m32r
dpkg-buildpackage: source version without epoch 6.1.2-1
/usr/bin/fakeroot debian/rules clean
dh_testdir
dh_testroot
rm -f build-stamp
# Add here commands to clean up after the build process.
/usr/bin/make distclean
make[1]: Entering directory `/build/buildd4/gmp-ecm-6.1.2'
make[1]: *** No rule to make target `distclean'. Stop.
make[1]: Leaving directory `/build/buildd4/gmp-ecm-6.1.2'
make: [clean] Error 2 (ignored)
cp -f /usr/share/misc/config.sub config.sub
cp -f /usr/share/misc/config.guess config.guess
dh_clean
debian/rules build
dh_testdir
# Add here commands to configure the package.
CFLAGS="-Wall -g -O2" ./configure --host=m32r-linux-gnu --build=m32r-linux-gnu --prefix=/usr --mandir=\${prefix}/share/man --infodir=\${prefix}/share/info
checking for a BSD-compatible install... /usr/bin/ginstall -c
checking whether build environment is sane... yes
checking for gawk... gawk
checking whether make sets $(MAKE)... yes
checking for m32r-linux-gnu-gcc... m32r-linux-gnu-gcc
checking for C compiler default output file name... a.out
checking whether the C compiler works... yes
checking whether we are cross compiling... no
checking for suffix of executables...
checking for suffix of object files... o
checking whether we are using the GNU C compiler... yes
checking whether m32r-linux-gnu-gcc accepts -g... yes
checking for m32r-linux-gnu-gcc option to accept ANSI C... none needed
checking for style of include used by make... GNU
checking dependency style of m32r-linux-gnu-gcc... gcc3
checking for m32r-linux-gnu-ranlib... no
checking for ranlib... ranlib
checking build system type... m32r-unknown-linux-gnu
checking host system type... m32r-unknown-linux-gnu
checking how to run the C preprocessor... m32r-linux-gnu-gcc -E
checking for egrep... grep -E
checking for working alloca.h... yes
checking for alloca... yes
checking for ANSI C header files... yes
checking for sys/types.h... yes
checking for sys/stat.h... yes
checking for stdlib.h... yes
checking for string.h... yes
checking for memory.h... yes
checking for strings.h... yes
checking for inttypes.h... yes
checking for stdint.h... yes
checking for unistd.h... yes
checking math.h usability... yes
checking math.h presence... yes
checking for math.h... yes
checking limits.h usability... yes
checking limits.h presence... yes
checking for limits.h... yes
checking malloc.h usability... yes
checking malloc.h presence... yes
checking for malloc.h... yes
checking for strings.h... (cached) yes
checking sys/time.h usability... yes
checking sys/time.h presence... yes
checking for sys/time.h... yes
checking for unistd.h... (cached) yes
checking io.h usability... no
checking io.h presence... no
checking for io.h... no
checking signal.h usability... yes
checking signal.h presence... yes
checking for signal.h... yes
checking windows.h usability... no
checking windows.h presence... no
checking for windows.h... no
checking ctype.h usability... yes
checking ctype.h presence... yes
checking for ctype.h... yes
checking for sys/types.h... (cached) yes
checking sys/resource.h usability... yes
checking sys/resource.h presence... yes
checking for sys/resource.h... yes
checking for an ANSI C-conforming const... yes
checking for inline... inline
checking for size_t... yes
checking whether time.h and sys/time.h may both be included... yes
checking gmp.h usability... yes
checking gmp.h presence... yes
checking for gmp.h... yes
checking for recent GMP... yes
checking if gmp.h version and libgmp version are the same... (4.2.1/4.2.1) yes
checking for working strtod... yes
checking for floor in -lm... yes
checking for floor... yes
checking for sqrt... yes
checking for pow... yes
checking for fmod... yes
checking for isascii... yes
checking for memset... yes
checking for strchr... yes
checking for strlen... yes
checking for strncasecmp... yes
checking for strstr... yes
checking for access... yes
checking for unlink... yes
checking for isspace... yes
checking for isdigit... yes
checking for isxdigit... yes
checking for time... yes
checking for ctime... yes
checking for nice... yes
checking for gethostname... yes
checking for gettimeofday... yes
checking for getrusage... yes
checking for memmove... yes
checking for signal... yes
checking for __gmpn_add_nc... no
checking for __gmpn_mul_fft... yes
checking for __gmpn_mod_34lsub1... yes
checking for malloc_usable_size... yes
checking for xsltproc... xsltproc
checking for docbook.xsl... no
creating config.m4
configure: creating ./config.status
config.status: creating Makefile
config.status: creating athlon/Makefile
config.status: creating pentium4/Makefile
config.status: creating x86_64/Makefile
config.status: creating config.h
config.status: linking ./ecm-params.h.default to ecm-params.h
config.status: executing depfiles commands
dh_testdir
# Add here commands to compile the package.
/usr/bin/make
make[1]: Entering directory `/build/buildd4/gmp-ecm-6.1.2'
/usr/bin/make all-recursive
make[2]: Entering directory `/build/buildd4/gmp-ecm-6.1.2'
make[3]: Entering directory `/build/buildd4/gmp-ecm-6.1.2'
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT ecm.o -MD -MP -MF ".deps/ecm.Tpo" -c -o ecm.o ecm.c; \
then mv -f ".deps/ecm.Tpo" ".deps/ecm.Po"; else rm -f ".deps/ecm.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT ecm2.o -MD -MP -MF ".deps/ecm2.Tpo" -c -o ecm2.o ecm2.c; \
then mv -f ".deps/ecm2.Tpo" ".deps/ecm2.Po"; else rm -f ".deps/ecm2.Tpo"; exit 1; fi
ecm2.c: In function 'multiplyW2n':
ecm2.c:48: warning: unused variable '__dummy'
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT pm1.o -MD -MP -MF ".deps/pm1.Tpo" -c -o pm1.o pm1.c; \
then mv -f ".deps/pm1.Tpo" ".deps/pm1.Po"; else rm -f ".deps/pm1.Tpo"; exit 1; fi
pm1.c: In function '__ecm_pm1_rootsF':
pm1.c:437: warning: dereferencing type-punned pointer will break strict-aliasing rules
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT pp1.o -MD -MP -MF ".deps/pp1.Tpo" -c -o pp1.o pp1.c; \
then mv -f ".deps/pp1.Tpo" ".deps/pp1.Po"; else rm -f ".deps/pp1.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT getprime.o -MD -MP -MF ".deps/getprime.Tpo" -c -o getprime.o getprime.c; \
then mv -f ".deps/getprime.Tpo" ".deps/getprime.Po"; else rm -f ".deps/getprime.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT listz.o -MD -MP -MF ".deps/listz.Tpo" -c -o listz.o listz.c; \
then mv -f ".deps/listz.Tpo" ".deps/listz.Po"; else rm -f ".deps/listz.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT lucas.o -MD -MP -MF ".deps/lucas.Tpo" -c -o lucas.o lucas.c; \
then mv -f ".deps/lucas.Tpo" ".deps/lucas.Po"; else rm -f ".deps/lucas.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT stage2.o -MD -MP -MF ".deps/stage2.Tpo" -c -o stage2.o stage2.c; \
then mv -f ".deps/stage2.Tpo" ".deps/stage2.Po"; else rm -f ".deps/stage2.Tpo"; exit 1; fi
stage2.c: In function '__ecm_stage2':
stage2.c:840: warning: implicit declaration of function 'unlink'
stage2.c:321: warning: 'mpzspm' may be used uninitialized in this function
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT toomcook.o -MD -MP -MF ".deps/toomcook.Tpo" -c -o toomcook.o toomcook.c; \
then mv -f ".deps/toomcook.Tpo" ".deps/toomcook.Po"; else rm -f ".deps/toomcook.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT mpmod.o -MD -MP -MF ".deps/mpmod.Tpo" -c -o mpmod.o mpmod.c; \
then mv -f ".deps/mpmod.Tpo" ".deps/mpmod.Po"; else rm -f ".deps/mpmod.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT mul_lo.o -MD -MP -MF ".deps/mul_lo.Tpo" -c -o mul_lo.o mul_lo.c; \
then mv -f ".deps/mul_lo.Tpo" ".deps/mul_lo.Po"; else rm -f ".deps/mul_lo.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT polyeval.o -MD -MP -MF ".deps/polyeval.Tpo" -c -o polyeval.o polyeval.c; \
then mv -f ".deps/polyeval.Tpo" ".deps/polyeval.Po"; else rm -f ".deps/polyeval.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT median.o -MD -MP -MF ".deps/median.Tpo" -c -o median.o median.c; \
then mv -f ".deps/median.Tpo" ".deps/median.Po"; else rm -f ".deps/median.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT schoen_strass.o -MD -MP -MF ".deps/schoen_strass.Tpo" -c -o schoen_strass.o schoen_strass.c; \
then mv -f ".deps/schoen_strass.Tpo" ".deps/schoen_strass.Po"; else rm -f ".deps/schoen_strass.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT ks-multiply.o -MD -MP -MF ".deps/ks-multiply.Tpo" -c -o ks-multiply.o ks-multiply.c; \
then mv -f ".deps/ks-multiply.Tpo" ".deps/ks-multiply.Po"; else rm -f ".deps/ks-multiply.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT rho.o -MD -MP -MF ".deps/rho.Tpo" -c -o rho.o rho.c; \
then mv -f ".deps/rho.Tpo" ".deps/rho.Po"; else rm -f ".deps/rho.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT bestd.o -MD -MP -MF ".deps/bestd.Tpo" -c -o bestd.o bestd.c; \
then mv -f ".deps/bestd.Tpo" ".deps/bestd.Po"; else rm -f ".deps/bestd.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT auxlib.o -MD -MP -MF ".deps/auxlib.Tpo" -c -o auxlib.o auxlib.c; \
then mv -f ".deps/auxlib.Tpo" ".deps/auxlib.Po"; else rm -f ".deps/auxlib.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT random.o -MD -MP -MF ".deps/random.Tpo" -c -o random.o random.c; \
then mv -f ".deps/random.Tpo" ".deps/random.Po"; else rm -f ".deps/random.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT factor.o -MD -MP -MF ".deps/factor.Tpo" -c -o factor.o factor.c; \
then mv -f ".deps/factor.Tpo" ".deps/factor.Po"; else rm -f ".deps/factor.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT sp.o -MD -MP -MF ".deps/sp.Tpo" -c -o sp.o sp.c; \
then mv -f ".deps/sp.Tpo" ".deps/sp.Po"; else rm -f ".deps/sp.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT spv.o -MD -MP -MF ".deps/spv.Tpo" -c -o spv.o spv.c; \
then mv -f ".deps/spv.Tpo" ".deps/spv.Po"; else rm -f ".deps/spv.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT spm.o -MD -MP -MF ".deps/spm.Tpo" -c -o spm.o spm.c; \
then mv -f ".deps/spm.Tpo" ".deps/spm.Po"; else rm -f ".deps/spm.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT mpzspm.o -MD -MP -MF ".deps/mpzspm.Tpo" -c -o mpzspm.o mpzspm.c; \
then mv -f ".deps/mpzspm.Tpo" ".deps/mpzspm.Po"; else rm -f ".deps/mpzspm.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT mpzspv.o -MD -MP -MF ".deps/mpzspv.Tpo" -c -o mpzspv.o mpzspv.c; \
then mv -f ".deps/mpzspv.Tpo" ".deps/mpzspv.Po"; else rm -f ".deps/mpzspv.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT ntt_gfp.o -MD -MP -MF ".deps/ntt_gfp.Tpo" -c -o ntt_gfp.o ntt_gfp.c; \
then mv -f ".deps/ntt_gfp.Tpo" ".deps/ntt_gfp.Po"; else rm -f ".deps/ntt_gfp.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT ecm_ntt.o -MD -MP -MF ".deps/ecm_ntt.Tpo" -c -o ecm_ntt.o ecm_ntt.c; \
then mv -f ".deps/ecm_ntt.Tpo" ".deps/ecm_ntt.Po"; else rm -f ".deps/ecm_ntt.Tpo"; exit 1; fi
rm -f libecm.a
ar cru libecm.a ecm.o ecm2.o pm1.o pp1.o getprime.o listz.o lucas.o stage2.o toomcook.o mpmod.o mul_lo.o polyeval.o median.o schoen_strass.o ks-multiply.o rho.o bestd.o auxlib.o random.o factor.o sp.o spv.o spm.o mpzspm.o mpzspv.o ntt_gfp.o ecm_ntt.o
ranlib libecm.a
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DOUTSIDE_LIBECM -Wall -g -O2 -MT ecm-auxi.o -MD -MP -MF ".deps/ecm-auxi.Tpo" -c -o ecm-auxi.o `test -f 'auxi.c' || echo './'`auxi.c; \
then mv -f ".deps/ecm-auxi.Tpo" ".deps/ecm-auxi.Po"; else rm -f ".deps/ecm-auxi.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DOUTSIDE_LIBECM -Wall -g -O2 -MT ecm-b1_ainc.o -MD -MP -MF ".deps/ecm-b1_ainc.Tpo" -c -o ecm-b1_ainc.o `test -f 'b1_ainc.c' || echo './'`b1_ainc.c; \
then mv -f ".deps/ecm-b1_ainc.Tpo" ".deps/ecm-b1_ainc.Po"; else rm -f ".deps/ecm-b1_ainc.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DOUTSIDE_LIBECM -Wall -g -O2 -MT ecm-candi.o -MD -MP -MF ".deps/ecm-candi.Tpo" -c -o ecm-candi.o `test -f 'candi.c' || echo './'`candi.c; \
then mv -f ".deps/ecm-candi.Tpo" ".deps/ecm-candi.Po"; else rm -f ".deps/ecm-candi.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DOUTSIDE_LIBECM -Wall -g -O2 -MT ecm-eval.o -MD -MP -MF ".deps/ecm-eval.Tpo" -c -o ecm-eval.o `test -f 'eval.c' || echo './'`eval.c; \
then mv -f ".deps/ecm-eval.Tpo" ".deps/ecm-eval.Po"; else rm -f ".deps/ecm-eval.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DOUTSIDE_LIBECM -Wall -g -O2 -MT ecm-random.o -MD -MP -MF ".deps/ecm-random.Tpo" -c -o ecm-random.o `test -f 'random.c' || echo './'`random.c; \
then mv -f ".deps/ecm-random.Tpo" ".deps/ecm-random.Po"; else rm -f ".deps/ecm-random.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DOUTSIDE_LIBECM -Wall -g -O2 -MT ecm-main.o -MD -MP -MF ".deps/ecm-main.Tpo" -c -o ecm-main.o `test -f 'main.c' || echo './'`main.c; \
then mv -f ".deps/ecm-main.Tpo" ".deps/ecm-main.Po"; else rm -f ".deps/ecm-main.Tpo"; exit 1; fi
main.c: In function 'main':
main.c:985: warning: suggest parentheses around && within ||
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DOUTSIDE_LIBECM -Wall -g -O2 -MT ecm-trial.o -MD -MP -MF ".deps/ecm-trial.Tpo" -c -o ecm-trial.o `test -f 'trial.c' || echo './'`trial.c; \
then mv -f ".deps/ecm-trial.Tpo" ".deps/ecm-trial.Po"; else rm -f ".deps/ecm-trial.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DOUTSIDE_LIBECM -Wall -g -O2 -MT ecm-resume.o -MD -MP -MF ".deps/ecm-resume.Tpo" -c -o ecm-resume.o `test -f 'resume.c' || echo './'`resume.c; \
then mv -f ".deps/ecm-resume.Tpo" ".deps/ecm-resume.Po"; else rm -f ".deps/ecm-resume.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DOUTSIDE_LIBECM -Wall -g -O2 -MT ecm-getprime.o -MD -MP -MF ".deps/ecm-getprime.Tpo" -c -o ecm-getprime.o `test -f 'getprime.c' || echo './'`getprime.c; \
then mv -f ".deps/ecm-getprime.Tpo" ".deps/ecm-getprime.Po"; else rm -f ".deps/ecm-getprime.Tpo"; exit 1; fi
m32r-linux-gnu-gcc -Wall -g -O2 -o ecm ecm-auxi.o ecm-b1_ainc.o ecm-candi.o ecm-eval.o ecm-random.o ecm-main.o ecm-trial.o ecm-resume.o ecm-getprime.o libecm.a -lm -lgmp
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-mpmod.o -MD -MP -MF ".deps/tune-mpmod.Tpo" -c -o tune-mpmod.o `test -f 'mpmod.c' || echo './'`mpmod.c; \
then mv -f ".deps/tune-mpmod.Tpo" ".deps/tune-mpmod.Po"; else rm -f ".deps/tune-mpmod.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-tune.o -MD -MP -MF ".deps/tune-tune.Tpo" -c -o tune-tune.o `test -f 'tune.c' || echo './'`tune.c; \
then mv -f ".deps/tune-tune.Tpo" ".deps/tune-tune.Po"; else rm -f ".deps/tune-tune.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-mul_lo.o -MD -MP -MF ".deps/tune-mul_lo.Tpo" -c -o tune-mul_lo.o `test -f 'mul_lo.c' || echo './'`mul_lo.c; \
then mv -f ".deps/tune-mul_lo.Tpo" ".deps/tune-mul_lo.Po"; else rm -f ".deps/tune-mul_lo.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-listz.o -MD -MP -MF ".deps/tune-listz.Tpo" -c -o tune-listz.o `test -f 'listz.c' || echo './'`listz.c; \
then mv -f ".deps/tune-listz.Tpo" ".deps/tune-listz.Po"; else rm -f ".deps/tune-listz.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-auxlib.o -MD -MP -MF ".deps/tune-auxlib.Tpo" -c -o tune-auxlib.o `test -f 'auxlib.c' || echo './'`auxlib.c; \
then mv -f ".deps/tune-auxlib.Tpo" ".deps/tune-auxlib.Po"; else rm -f ".deps/tune-auxlib.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-ks-multiply.o -MD -MP -MF ".deps/tune-ks-multiply.Tpo" -c -o tune-ks-multiply.o `test -f 'ks-multiply.c' || echo './'`ks-multiply.c; \
then mv -f ".deps/tune-ks-multiply.Tpo" ".deps/tune-ks-multiply.Po"; else rm -f ".deps/tune-ks-multiply.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-toomcook.o -MD -MP -MF ".deps/tune-toomcook.Tpo" -c -o tune-toomcook.o `test -f 'toomcook.c' || echo './'`toomcook.c; \
then mv -f ".deps/tune-toomcook.Tpo" ".deps/tune-toomcook.Po"; else rm -f ".deps/tune-toomcook.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-schoen_strass.o -MD -MP -MF ".deps/tune-schoen_strass.Tpo" -c -o tune-schoen_strass.o `test -f 'schoen_strass.c' || echo './'`schoen_strass.c; \
then mv -f ".deps/tune-schoen_strass.Tpo" ".deps/tune-schoen_strass.Po"; else rm -f ".deps/tune-schoen_strass.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-polyeval.o -MD -MP -MF ".deps/tune-polyeval.Tpo" -c -o tune-polyeval.o `test -f 'polyeval.c' || echo './'`polyeval.c; \
then mv -f ".deps/tune-polyeval.Tpo" ".deps/tune-polyeval.Po"; else rm -f ".deps/tune-polyeval.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-median.o -MD -MP -MF ".deps/tune-median.Tpo" -c -o tune-median.o `test -f 'median.c' || echo './'`median.c; \
then mv -f ".deps/tune-median.Tpo" ".deps/tune-median.Po"; else rm -f ".deps/tune-median.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-ecm_ntt.o -MD -MP -MF ".deps/tune-ecm_ntt.Tpo" -c -o tune-ecm_ntt.o `test -f 'ecm_ntt.c' || echo './'`ecm_ntt.c; \
then mv -f ".deps/tune-ecm_ntt.Tpo" ".deps/tune-ecm_ntt.Po"; else rm -f ".deps/tune-ecm_ntt.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-ntt_gfp.o -MD -MP -MF ".deps/tune-ntt_gfp.Tpo" -c -o tune-ntt_gfp.o `test -f 'ntt_gfp.c' || echo './'`ntt_gfp.c; \
then mv -f ".deps/tune-ntt_gfp.Tpo" ".deps/tune-ntt_gfp.Po"; else rm -f ".deps/tune-ntt_gfp.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-mpzspv.o -MD -MP -MF ".deps/tune-mpzspv.Tpo" -c -o tune-mpzspv.o `test -f 'mpzspv.c' || echo './'`mpzspv.c; \
then mv -f ".deps/tune-mpzspv.Tpo" ".deps/tune-mpzspv.Po"; else rm -f ".deps/tune-mpzspv.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-mpzspm.o -MD -MP -MF ".deps/tune-mpzspm.Tpo" -c -o tune-mpzspm.o `test -f 'mpzspm.c' || echo './'`mpzspm.c; \
then mv -f ".deps/tune-mpzspm.Tpo" ".deps/tune-mpzspm.Po"; else rm -f ".deps/tune-mpzspm.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-sp.o -MD -MP -MF ".deps/tune-sp.Tpo" -c -o tune-sp.o `test -f 'sp.c' || echo './'`sp.c; \
then mv -f ".deps/tune-sp.Tpo" ".deps/tune-sp.Po"; else rm -f ".deps/tune-sp.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-spv.o -MD -MP -MF ".deps/tune-spv.Tpo" -c -o tune-spv.o `test -f 'spv.c' || echo './'`spv.c; \
then mv -f ".deps/tune-spv.Tpo" ".deps/tune-spv.Po"; else rm -f ".deps/tune-spv.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-spm.o -MD -MP -MF ".deps/tune-spm.Tpo" -c -o tune-spm.o `test -f 'spm.c' || echo './'`spm.c; \
then mv -f ".deps/tune-spm.Tpo" ".deps/tune-spm.Po"; else rm -f ".deps/tune-spm.Tpo"; exit 1; fi
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -DTUNE -Wall -g -O2 -MT tune-random.o -MD -MP -MF ".deps/tune-random.Tpo" -c -o tune-random.o `test -f 'random.c' || echo './'`random.c; \
then mv -f ".deps/tune-random.Tpo" ".deps/tune-random.Po"; else rm -f ".deps/tune-random.Tpo"; exit 1; fi
m32r-linux-gnu-gcc -Wall -g -O2 -o tune tune-mpmod.o tune-tune.o tune-mul_lo.o tune-listz.o tune-auxlib.o tune-ks-multiply.o tune-toomcook.o tune-schoen_strass.o tune-polyeval.o tune-median.o tune-ecm_ntt.o tune-ntt_gfp.o tune-mpzspv.o tune-mpzspm.o tune-sp.o tune-spv.o tune-spm.o tune-random.o -lm -lgmp
if m32r-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I. -I. -Wall -g -O2 -MT ecmfactor.o -MD -MP -MF ".deps/ecmfactor.Tpo" -c -o ecmfactor.o ecmfactor.c; \
then mv -f ".deps/ecmfactor.Tpo" ".deps/ecmfactor.Po"; else rm -f ".deps/ecmfactor.Tpo"; exit 1; fi
m32r-linux-gnu-gcc -Wall -g -O2 -o ecmfactor ecmfactor.o libecm.a -lm -lgmp
make[3]: Leaving directory `/build/buildd4/gmp-ecm-6.1.2'
make[2]: Leaving directory `/build/buildd4/gmp-ecm-6.1.2'
make[1]: Leaving directory `/build/buildd4/gmp-ecm-6.1.2'
/usr/bin/make check
make[1]: Entering directory `/build/buildd4/gmp-ecm-6.1.2'
make[2]: Entering directory `/build/buildd4/gmp-ecm-6.1.2'
make[2]: Leaving directory `/build/buildd4/gmp-ecm-6.1.2'
./test.pp1 ./ecm
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 328006342451 (12 digits)
Using B1=120, B2=7446, polynomial x^1, x0=5
Step 1 took 20ms
Step 2 took 30ms
********** Factor found in step 2: 328006342451
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 328006342451 (12 digits)
Using B1=120, B2=7446, polynomial x^1, x0=262405073961
Step 1 took 10ms
Step 2 took 50ms
********** Factor found in step 2: 328006342451
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 2050449218179969792522461197 (28 digits)
Using B1=20, B2=0-2443992, polynomial x^1, x0=3
Step 1 took 10ms
Step 2 took 2040ms
[factor found by P-1]
********** Factor found in step 2: 30210179
Found probable prime factor of 8 digits: 30210179
Probable prime cofactor 67872792749091946543 has 20 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 6215074747201 (13 digits)
Using B1=630, B2=222366, polynomial x^1, x0=5
Step 1 took 40ms
Step 2 took 310ms
********** Factor found in step 2: 6215074747201
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 8857714771093 (13 digits)
Using B1=23251, B2=55926, polynomial x^1, x0=3
Step 1 took 1200ms
Step 2 took 90ms
********** Factor found in step 2: 8857714771093
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 236344687097 (12 digits)
Using B1=619, B2=69876, polynomial x^1, x0=3
Step 1 took 50ms
Step 2 took 130ms
********** Factor found in step 2: 236344687097
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 87251820842149 (14 digits)
Using B1=3691, B2=187176, polynomial x^1, x0=5
Step 1 took 440ms
Step 2 took 360ms
********** Factor found in step 2: 87251820842149
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 719571227339189 (15 digits)
Using B1=41039, B2=64806, polynomial x^1, x0=4
Step 1 took 2160ms
Step 2 took 70ms
********** Factor found in step 2: 719571227339189
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 5468575720021 (13 digits)
Using B1=1439, B2=184626, polynomial x^1, x0=6
Step 1 took 90ms
Step 2 took 260ms
********** Factor found in step 2: 5468575720021
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 49804972211 (11 digits)
Using B1=15443, B2=306006, polynomial x^1, x0=5
Step 1 took 820ms
Step 2 took 330ms
********** Factor found in step 2: 49804972211
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 329573417220613 (15 digits)
Using B1=5279, B2=112716, polynomial x^1, x0=3
Step 1 took 310ms
Step 2 took 180ms
********** Factor found in step 2: 329573417220613
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 4866979762781 (13 digits)
Using B1=7309, B2=114756, polynomial x^1, x0=4
Step 1 took 390ms
Step 2 took 180ms
********** Factor found in step 2: 4866979762781
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 187333846633 (12 digits)
Using B1=2063, B2=11646, polynomial x^1, x0=3
Step 1 took 120ms
Step 2 took 60ms
********** Factor found in step 2: 187333846633
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 332526664667473 (15 digits)
Using B1=65993, B2=116406, polynomial x^1, x0=3
Step 1 took 3219ms
Step 2 took 120ms
********** Factor found in step 2: 332526664667473
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 265043186297 (12 digits)
Using B1=8761, B2=154536, polynomial x^1, x0=3
Step 1 took 480ms
Step 2 took 200ms
********** Factor found in step 2: 265043186297
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 207734163253 (12 digits)
Using B1=1877, B2=4446, polynomial x^1, x0=3
Step 1 took 120ms
Step 2 took 30ms
********** Factor found in step 2: 207734163253
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 225974065503889 (15 digits)
Using B1=7867, B2=8430, polynomial x^1, x0=5
Step 1 took 440ms
Step 2 took 20ms
********** Factor found in step 2: 225974065503889
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 660198074631409 (15 digits)
Using B1=22541, B2=130056, polynomial x^1, x0=5
Step 1 took 1150ms
Step 2 took 170ms
********** Factor found in step 2: 660198074631409
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 563215815517 (12 digits)
Using B1=3469, B2=111186, polynomial x^1, x0=3
Step 1 took 210ms
Step 2 took 160ms
********** Factor found in step 2: 563215815517
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 563215815517 (12 digits)
Using B1=3469, B2=109849-109860, polynomial x^1, x0=3
Step 1 took 240ms
Step 2 took 0ms
********** Factor found in step 2: 563215815517
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 409100738617 (12 digits)
Using B1=19, B2=24, polynomial x^1, x0=3
Step 1 took 10ms
********** Factor found in step 1: 409100738617
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 2277189375098448170118558775447117254551111605543304035536750762506158547102293199086726265869065639109 (103 digits)
Using B1=2337233, B2=174130330, polynomial Dickson(3), x0=3
Step 1 took 352230ms
Step 2 took 83664ms
********** Factor found in step 2: 4190453151940208656715582382315221647
Found probable prime factor of 37 digits: 4190453151940208656715582382315221647
Probable prime cofactor 543423179434447039008165356160798838947285203071935410761431031147 has 66 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 630503947831861669 (18 digits)
Using B1=7, B2=9007199254740000-9007199254741506, polynomial x^1, x0=5
Step 1 took 10ms
Step 2 took 20ms
********** Factor found in step 2: 630503947831861669
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P+1]
Input number is 8589934621 (10 digits)
Using B1=4294967310-4294967311, B2=1, polynomial x^1
Error, maximal step1 bound for P+1 is 4294967295
Please report internal errors at <ecm-discuss at lists.gforge.inria.fr>.
All P+1 tests are ok.
./test.pm1 ./ecm
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 441995541378330835457 (21 digits)
Using B1=157080, B2=7000000000-7214846740, polynomial x^24, x0=2561336636
Step 1 took 6958ms
Step 2 took 29421ms
********** Factor found in step 2: 441995541378330835457
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 335203548019575991076297 (24 digits)
Using B1=23, B2=48, polynomial Dickson(4), x0=2
Step 1 took 10ms
Step 2 took 10ms
********** Factor found in step 2: 335203548019575991076297
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 335203548019575991076297 (24 digits)
Using B1=31, B2=58766400424189339249-58766400424189339260, polynomial Dickson(4), x0=3
Step 1 took 0ms
Step 2 took 20ms
********** Factor found in step 2: 335203548019575991076297
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 2050449353925555290706354283 (28 digits)
Using B1=20, B2=0-2443992, polynomial Dickson(6), x0=2839656117
Step 1 took 10ms
Step 2 took 2839ms
********** Factor found in step 2: 30210181
Found probable prime factor of 8 digits: 30210181
Probable prime cofactor 67872792749091946543 has 20 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 67872792749091946529 (20 digits)
Using B1=8467, B2=12700392, polynomial x^12, x0=3
Step 1 took 450ms
Step 2 took 7258ms
********** Factor found in step 2: 67872792749091946529
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 5735039483399104015346944564789 (31 digits)
Using B1=1277209, B2=11406792, polynomial Dickson(6), x0=704438247
Step 1 took 21144ms
Step 2 took 5328ms
********** Factor found in step 2: 5735039483399104015346944564789
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 620224739362954187513 (21 digits)
Using B1=668093, B2=86338990, polynomial x^12, x0=3
Step 1 took 18475ms
Step 2 took 15195ms
********** Factor found in step 2: 620224739362954187513
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 1405929742229533753 (19 digits)
Using B1=1123483, B2=86797630, polynomial x^12, x0=3446376202
Step 1 took 8988ms
Step 2 took 14015ms
********** Factor found in step 2: 1405929742229533753
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 16811052664235873 (17 digits)
Using B1=19110, B2=214872850, polynomial x^24, x0=3
Step 1 took 460ms
Step 2 took 24223ms
********** Factor found in step 2: 16811052664235873
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 9110965748024759967611 (22 digits)
Using B1=1193119, B2=348717612, polynomial x^24, x0=483325680
Step 1 took 13946ms
Step 2 took 40647ms
********** Factor found in step 2: 9110965748024759967611
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 563796628294674772855559264041716715663 (39 digits)
Using B1=4031563, B2=16724412, polynomial x^12, x0=676663198
Step 1 took 82984ms
Step 2 took 10307ms
********** Factor found in step 2: 563796628294674772855559264041716715663
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 188879386195169498836498369376071664143 (39 digits)
Using B1=3026227, B2=131763460, polynomial x^24, x0=3140310487
Step 1 took 48555ms
Step 2 took 29561ms
********** Factor found in step 2: 188879386195169498836498369376071664143
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 474476178924594486566271953891 (30 digits)
Using B1=9594209, B2=531362382, polynomial x^24, x0=3224152563
Step 1 took 142186ms
Step 2 took 64230ms
********** Factor found in step 2: 474476178924594486566271953891
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 2124306045220073929294177 (25 digits)
Using B1=290021, B2=1425376690, polynomial x^24, x0=2129367644
Step 1 took 11817ms
Step 2 took 91621ms
********** Factor found in step 2: 2124306045220073929294177
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 25591172394760497166702530699464321 (35 digits)
Using B1=100000, B2=1323642, polynomial Dickson(6), x0=3917281202
Step 1 took 4729ms
Step 2 took 1499ms
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Resuming P-1 residue saved by root at mappi006 with GMP-ECM 6.1.2 on Fri Jul 27 00:17:14 2007
Input number is 25591172394760497166702530699464321 (35 digits)
Using B1=100000-120557, B2=2624172, polynomial Dickson(6)
Step 1 took 480ms
Step 2 took 2329ms
********** Factor found in step 2: 25591172394760497166702530699464321
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 504403158265489337 (18 digits)
Using B1=8, B2=9007199254740700-9007199254741140, polynomial Dickson(4), x0=836111658
Step 1 took 10ms
Step 2 took 30ms
********** Factor found in step 2: 504403158265489337
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [P-1]
Input number is 6857 (4 digits)
Using B1=840, B2=876, polynomial Dickson(4), x0=3455825372
Step 1 took 10ms
Step 2 took 20ms
********** Factor found in step 2: 6857
Found input number N
All P-1 tests are ok.
./test.ecm ./ecm
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 2050449353925555290706354283 (28 digits)
Using B1=30, B2=0-2443992, polynomial x^1, sigma=7
Step 1 took 10ms
Step 2 took 2270ms
********** Factor found in step 2: 30210181
Found probable prime factor of 8 digits: 30210181
Probable prime cofactor 67872792749091946543 has 20 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 212252637915375215854013140804296246361 (39 digits)
Using B1=63421, B2=1822795201-1822795212, polynomial x^1, sigma=781683988
Step 1 took 17195ms
Step 2 took 20ms
********** Factor found in step 2: 212252637915375215854013140804296246361
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 137703491 (9 digits)
Using B1=84, B2=1506, polynomial x^1, sigma=6
Step 1 took 20ms
********** Factor found in step 1: 137703491
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 3533000986701102061387017352606588294716061 (43 digits)
Using B1=191, B2=240, polynomial x^1, sigma=1621
Step 1 took 70ms
Step 2 took 30ms
********** Factor found in step 2: 291310394389387
Found probable prime factor of 15 digits: 291310394389387
Probable prime cofactor 12127960604037464813777571703 has 29 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 145152979917007299777325725119 (30 digits)
Using B1=924, B2=145866, polynomial x^1, sigma=711387948
Step 1 took 270ms
Step 2 took 420ms
********** Factor found in step 2: 59124358487827
Found probable prime factor of 14 digits: 59124358487827
Probable prime cofactor 2455045325301797 has 16 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 2^919-1 (277 digits)
Using B1=937, B2=1, polynomial x^1, sigma=262763035
Step 1 took 1870ms
********** Factor found in step 1: 33554520197234177
Found probable prime factor of 17 digits: 33554520197234177
Composite cofactor (2^919-1)/33554520197234177 has 261 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 2^919-1 (277 digits)
Using B1=283, B2=1746, polynomial x^1, sigma=1691973485
Step 1 took 580ms
Step 2 took 500ms
********** Factor found in step 2: 33554520197234177
Found probable prime factor of 17 digits: 33554520197234177
Composite cofactor (2^919-1)/33554520197234177 has 261 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is (2^1033+1)/3 (311 digits)
Using B1=521, B2=1, polynomial x^1, sigma=2301432245
Step 1 took 1210ms
********** Factor found in step 1: 24651922299337
Found probable prime factor of 14 digits: 24651922299337
Composite cofactor ((2^1033+1)/3)/24651922299337 has 298 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is (2^1033+1)/3 (311 digits)
Using B1=223, B2=2226, polynomial x^1, sigma=2301432245
Step 1 took 500ms
Step 2 took 580ms
********** Factor found in step 2: 24651922299337
Found probable prime factor of 14 digits: 24651922299337
Composite cofactor ((2^1033+1)/3)/24651922299337 has 298 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is (2^1063+1)/3/26210488518118323164267329859 (292 digits)
Using B1=383, B2=1, polynomial x^1, sigma=2399424618
Step 1 took 930ms
********** Factor found in step 1: 114584129081
Found probable prime factor of 12 digits: 114584129081
Composite cofactor ((2^1063+1)/3/26210488518118323164267329859)/114584129081 has 281 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is (2^1063+1)/3/26210488518118323164267329859 (292 digits)
Using B1=71, B2=510, polynomial x^1, sigma=2399424618
Step 1 took 160ms
Step 2 took 310ms
********** Factor found in step 2: 114584129081
Found probable prime factor of 12 digits: 114584129081
Composite cofactor ((2^1063+1)/3/26210488518118323164267329859)/114584129081 has 281 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 242668358425701966181147598421249782519178289604307455138484425562807899 (72 digits)
Using B1=28560, B2=80000000-87572112, polynomial x^1, sigma=1417477358
Step 1 took 14306ms
Step 2 took 8107ms
********** Factor found in step 2: 314189411150178070008866231673623
Found probable prime factor of 33 digits: 314189411150178070008866231673623
Probable prime cofactor 772363261821417470288502136863983499613 has 39 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 3533000986701102061387017352606588294716061 (43 digits)
********** Factor found in step 1: 291310394389387
Found probable prime factor of 15 digits: 291310394389387
Probable prime cofactor 12127960604037464813777571703 has 29 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 121279606270805899614487548491773862357 (39 digits)
********** Factor found in step 1: 10000000019
Found probable prime factor of 11 digits: 10000000019
Probable prime cofactor 12127960604037464813777571703 has 29 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 291310394389387 (15 digits)
Using B1=2000, B2=147396, polynomial x^3, sigma=40
Step 1 took 420ms
Step 2 took 440ms
********** Factor found in step 2: 291310394389387
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 3533000986701102061387017352606588294716061 (43 digits)
Using B1=167, B2=216, polynomial x^1, sigma=3547
Step 1 took 70ms
Step 2 took 30ms
********** Factor found in step 2: 291310394389387
Found probable prime factor of 15 digits: 291310394389387
Probable prime cofactor 12127960604037464813777571703 has 29 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 449590253344339769860648131841615148645295989319968106906219761704350259884936939123964073775456979170209297434164627098624602597663490109944575251386017 (153 digits)
Using B1=61843, B2=30575172, polynomial x^2, sigma=63844855
Step 1 took 85634ms
Step 2 took 47855ms
********** Factor found in step 2: 241421225374647262615077397
Found probable prime factor of 27 digits: 241421225374647262615077397
Probable prime cofactor 1862264813902122131423372344559339567503391871088436708374700394762064021217072743463856958990845558484946068708307156081498461 has 127 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 17061648125571273329563156588435816942778260706938821014533 (59 digits)
Using B1=174000, B2=85880350, polynomial x^2, sigma=585928442
Step 1 took 72658ms
Step 2 took 32879ms
********** Factor found in step 2: 4562371492227327125110177
Found probable prime factor of 25 digits: 4562371492227327125110177
Probable prime cofactor 3739644646350764691998599898592229 has 34 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 89101594496537524661600025466303491594098940711325290746374420963129505171895306244425914080753573576861992127359576789001 (122 digits)
Using B1=157721, B2=1057746, polynomial x^1, sigma=877655087
Step 1 took 156501ms
Step 2 took 4089ms
********** Factor found in step 2: 122213491239590733375594767461662771175707001
Found probable prime factor of 45 digits: 122213491239590733375594767461662771175707001
Probable prime cofactor 729065126875888654836271846897328714196046117321552802754910712464291427082001 has 78 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 5394204444759808120647321820789847518754252780933425517607611172590240019087317088600360602042567541009369753816111824690753627535877960715703346991252857 (154 digits)
Using B1=149827, B2=61418292, polynomial x^2, sigma=805816989
Step 1 took 208815ms
********** Factor found in step 1: 25233450176615986500234063824208915571213
Found probable prime factor of 41 digits: 25233450176615986500234063824208915571213
Composite cofactor 213771973590779703877582369062709101178538085915092060190430818668514532785234237012872011811995059836377330127389 has 114 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 3923385745693995079670229419275984584311007321932374190635656246740175165573932140787529348954892963218868359081838772941945556717 (130 digits)
Using B1=141667, B2=171932680, polynomial Dickson(3), sigma=876329474
Step 1 took 158111ms
Step 2 took 122382ms
********** Factor found in step 2: 662926550178509475639682769961460088456141816377
Found probable prime factor of 48 digits: 662926550178509475639682769961460088456141816377
Probable prime cofactor 5918281210244974807753908524217714036623152303854001660136533635338204743433806421 has 82 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 124539923134619429718018353168641490719788526741873602224103589351798060075728544650990190016536810151633233676972068237330360238752628542584228856301923448951 (159 digits)
Using B1=96097, B2=30612132, polynomial x^2, sigma=1604840403
Step 1 took 101549ms
Step 2 took 50664ms
********** Factor found in step 2: 148296291984475077955727317447564721950969097
Found probable prime factor of 45 digits: 148296291984475077955727317447564721950969097
Probable prime cofactor 839804700900123195473468092497901750422530587828620063507554515144683510250490874819119570309824866293030799718783 has 114 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 4983070578699621345648758795946786489699447158923341167929707152021191319057138908604417894224244096909460401007237133698775496719078793168004317119431646035122982915288481052088094940158965731422616671 (202 digits)
Using B1=122861, B2=191766, polynomial x^1, sigma=909010734
Step 1 took 273255ms
Step 2 took 1669ms
********** Factor found in step 2: 1610390727168185680580455244749516255695631992277
Found probable prime factor of 49 digits: 1610390727168185680580455244749516255695631992277
Composite cofactor 3094323939297745576239630305708145221943652772146352976583265583941709400206907308455251844923141717213622722981913978180008321605958419308465245792685923 has 154 digits
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 1408323592065265621229603282020508687 (37 digits)
Using B1=531571, B2=29973883000-29973884406, polynomial x^1, sigma=1549542516
Step 1 took 141056ms
Step 2 took 60ms
********** Factor found in step 2: 1408323592065265621229603282020508687
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 3213162276640339413566047915418064969550383692549981333701 (58 digits)
Using B1=408997, B2=41173452, polynomial x^2, sigma=2735675386
Step 1 took 149913ms
Step 2 took 19934ms
********** Factor found in step 2: 3213162276640339413566047915418064969550383692549981333701
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 39614081257132168796771975177 (29 digits)
Using B1=1000000, B2=1045563762, polynomial Dickson(6), sigma=480
Step 1 took 229389ms
Step 2 took 114394ms
********** Factor found in step 2: 39614081257132168796771975177
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 10000286586958753753 (20 digits)
Using B1=1000000, B2=1045563762, polynomial Dickson(6), sigma=3956738175
Step 1 took 197998ms
Step 2 took 87833ms
********** Factor found in step 2: 10000286586958753753
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 49672383630046506169472128421 (29 digits)
Using B1=166669, B2=128916070, polynomial Dickson(3), sigma=2687434659
Step 1 took 39568ms
Step 2 took 25442ms
********** Factor found in step 2: 49672383630046506169472128421
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 216259730493575791390589173296092767511 (39 digits)
Using B1=1124423, B2=21390612, polynomial x^2, sigma=214659179
Step 1 took 306585ms
Step 2 took 9417ms
********** Factor found in step 2: 216259730493575791390589173296092767511
Found input number N
GMP-ECM 6.1.2 [powered by GMP 4.2.1] [ECM]
Input number is 49367108402201032092269771894422156977426293789852367266303146912244441959559870316184237 (89 digits)
Using B1=5000, B2=600786, polynomial x^1, sigma=6
Step 1 took 3359ms
Step 2 took 2140ms
All ECM tests are ok.
make[1]: Leaving directory `/build/buildd4/gmp-ecm-6.1.2'
touch build-stamp
/usr/bin/fakeroot debian/rules binary-arch
dh_testdir
dh_testroot
dh_clean -k
dh_installdirs
# Add here commands to install the package into debian/gmp-ecm.
/usr/bin/make install DESTDIR=/build/buildd4/gmp-ecm-6.1.2/debian/gmp-ecm
make[1]: Entering directory `/build/buildd4/gmp-ecm-6.1.2'
make[2]: Entering directory `/build/buildd4/gmp-ecm-6.1.2'
make[3]: Entering directory `/build/buildd4/gmp-ecm-6.1.2'
test -z "/usr/bin" || mkdir -p -- "/build/buildd4/gmp-ecm-6.1.2/debian/gmp-ecm/usr/bin"
/usr/bin/ginstall -c 'ecm' '/build/buildd4/gmp-ecm-6.1.2/debian/gmp-ecm/usr/bin/ecm'
test -z "/usr/lib" || mkdir -p -- "/build/buildd4/gmp-ecm-6.1.2/debian/gmp-ecm/usr/lib"
/usr/bin/ginstall -c -m 644 'libecm.a' '/build/buildd4/gmp-ecm-6.1.2/debian/gmp-ecm/usr/lib/libecm.a'
ranlib '/build/buildd4/gmp-ecm-6.1.2/debian/gmp-ecm/usr/lib/libecm.a'
test -z "/usr/include" || mkdir -p -- "/build/buildd4/gmp-ecm-6.1.2/debian/gmp-ecm/usr/include"
/usr/bin/ginstall -c -m 644 'ecm.h' '/build/buildd4/gmp-ecm-6.1.2/debian/gmp-ecm/usr/include/ecm.h'
test -z "/usr/share/man/man1" || mkdir -p -- "/build/buildd4/gmp-ecm-6.1.2/debian/gmp-ecm/usr/share/man/man1"
make[3]: Leaving directory `/build/buildd4/gmp-ecm-6.1.2'
make[2]: Leaving directory `/build/buildd4/gmp-ecm-6.1.2'
make[1]: Leaving directory `/build/buildd4/gmp-ecm-6.1.2'
rm -rf /build/buildd4/gmp-ecm-6.1.2/debian/gmp-ecm/usr/lib
rm -rf /build/buildd4/gmp-ecm-6.1.2/debian/gmp-ecm/usr/include
mkdir -p /build/buildd4/gmp-ecm-6.1.2/debian/gmp-ecm/usr/share/man/man1
cp ecm.1 debian/gmp-ecm/usr/share/man/man1
ln -s /usr/share/man/man1/ecm.1.gz debian/gmp-ecm/usr/share/man/man1/gmp-ecm.1.gz
dh_testdir
dh_testroot
dh_installchangelogs ChangeLog
dh_installdocs
dh_installexamples
dh_installman
dh_link
dh_strip
dh_compress
dh_fixperms
dh_installdeb
dh_shlibdeps
dh_gencontrol
dh_md5sums
dh_builddeb
dpkg-deb: building package `gmp-ecm' in `../gmp-ecm_6.1.2-1_m32r.deb'.
dpkg-genchanges -B
dpkg-genchanges: arch-specific upload - not including arch-independent packages
dpkg-genchanges: binary-only upload - not including any source code
dpkg-buildpackage: binary only upload (no source included)
******************************************************************************
Build finished at 20070727-0105
gmp-ecm_6.1.2-1_m32r.changes:
Format: 1.7
Date: Sat, 21 Jul 2007 11:39:43 +0200
Source: gmp-ecm
Binary: gmp-ecm
Architecture: m32r
Version: 6.1.2-1
Distribution: unstable
Urgency: low
Maintainer: Laurent Fousse <laurent at komite.net>
Changed-By: Laurent Fousse <laurent at komite.net>
Description:
gmp-ecm - Factor integers using the Elliptic Curve Method
Closes: 434026
Changes:
gmp-ecm (6.1.2-1) unstable; urgency=low
.
* New Upstream Version (closes: #434026).
Files:
ab974931f0f80cebebb7120a2aba4d68 148804 math optional gmp-ecm_6.1.2-1_m32r.deb
/debian/buildd4/build/chroot-unstable/build/buildd4/gmp-ecm_6.1.2-1_m32r.deb:
new debian package, version 2.0.
size 148804 bytes: control archive= 1121 bytes.
1075 bytes, 24 lines control
583 bytes, 9 lines md5sums
Package: gmp-ecm
Version: 6.1.2-1
Architecture: m32r
Maintainer: Laurent Fousse <laurent at komite.net>
Installed-Size: 288
Depends: libc6 (>= 2.3.5-1), libgmp3c2
Section: math
Priority: optional
Description: Factor integers using the Elliptic Curve Method
gmp-ecm is a free implementation of the Elliptic Curve Method (ECM)
for integer factorization.
.
The original purpose of the ECMNET project was to make Richard Brent's
prediction true, i.e. to find a factor of 50 digits or more by
ECM. This goal was attained on September 14, 1998, when Conrad Curry
found a 53-digit factor of 2^677-1 c150 using George Woltman's mprime
program. The new goal of ECMNET is now to find other large factors by
ecm, mainly by contributing to the Cunningham project, most likely the
longest, ongoing computational project in history according to Bob
Silverman. A new record was set by Nik Lygeros and rm: cannot remove directory `/tmp/dpkgcQddLd': Directory not empty
rm cleanup failed, code 256
Michel Mizony, who
found in December 1999 a prime factor of 54 digits using GMP-ECM.
.
See http://www.loria.fr/~zimmerma/records/ecmnet.html for more
informations about ecmnet.
/debian/buildd4/build/chroot-unstable/build/buildd4/gmp-ecm_6.1.2-1_m32r.deb:
drwxr-xr-x root/root 0 2007-07-27 01:04 ./
drwxr-xr-x root/root 0 2007-07-27 01:03 ./usr/
drwxr-xr-x root/root 0 2007-07-27 01:04 ./usr/bin/
-rwxr-xr-x root/root 179504 2007-07-27 01:04 ./usr/bin/ecm
drwxr-xr-x root/root 0 2007-07-27 01:03 ./usr/share/
drwxr-xr-x root/root 0 2007-07-27 01:03 ./usr/share/man/
drwxr-xr-x root/root 0 2007-07-27 01:04 ./usr/share/man/man1/
-rw-r--r-- root/root 5091 2007-07-27 01:03 ./usr/share/man/man1/ecm.1.gz
drwxr-xr-x root/root 0 2007-07-27 01:03 ./usr/share/doc/
drwxr-xr-x root/root 0 2007-07-27 01:04 ./usr/share/doc/gmp-ecm/
-rw-r--r-- root/root 31938 2006-12-19 01:32 ./usr/share/doc/gmp-ecm/changelog.gz
-rw-r--r-- root/root 10931 2006-05-06 02:25 ./usr/share/doc/gmp-ecm/README.gz
-rw-r--r-- root/root 2359 2006-12-19 01:32 ./usr/share/doc/gmp-ecm/NEWS.gz
-rw-r--r-- root/root 1274 2006-05-06 02:25 ./usr/share/doc/gmp-ecm/AUTHORS
-rw-r--r-- root/root 613 2007-07-26 23:39 ./usr/share/doc/gmp-ecm/README.Debian
-rw-r--r-- root/root 1459 2007-07-26 23:39 ./usr/share/doc/gmp-ecm/copyright
-rw-r--r-- root/root 1120 2007-07-26 23:39 ./usr/share/doc/gmp-ecm/changelog.Debian.gz
lrwxrwxrwx root/root 0 2007-07-27 01:04 ./usr/share/man/man1/gmp-ecm.1.gz -> ecm.1.gz
******************************************************************************
Built successfully
Purging /debian/buildd4/build/chroot-unstable/build/buildd4/gmp-ecm-6.1.2
------------------------------------------------------------------------------
(Reading database ... 54353 files and directories currently installed.)
Removing libgmp3-dev ...
Removing libgmpxx4 ...
Purging configuration files for libgmpxx4 ...
Removing libgmp3c2 ...
Purging configuration files for libgmp3c2 ...
******************************************************************************
Finished at 20070727-0106
Build needed 01:26:02, 7160k disk space
More information about the build-status
mailing list