Debian packages on transit

Package: libecm1-dev:amd64
Status: install ok installed
Priority: optional
Section: libdevel
Installed-Size: 1049
Maintainer: Debian Math Team <team+math@tracker.debian.org> [Debian Bug Report]
Architecture: amd64
Multi-Arch: same
Source: gmp-ecm
Version: 7.0.5+ds-1
Replaces: libecm0-dev
Depends: libecm1 (= 7.0.5+ds-1), libecm1-dev-common (= 7.0.5+ds-1), libgmp-dev
Breaks: libecm0-dev
Description: factor integers using the Elliptic Curve Method -- libdev
 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 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
 information about ecmnet.
 
 This package provides the static library and symbolic links needed
 for development.
Homepage: https://gitlab.inria.fr/zimmerma/ecm

Files owned by package libecm1-dev:amd64:

/usr
/usr/lib
/usr/lib/x86_64-linux-gnu
/usr/lib/x86_64-linux-gnu/libecm.a
/usr/lib/x86_64-linux-gnu/libecm.so
/usr/share
/usr/share/doc
/usr/share/doc/libecm1-dev
/usr/share/doc/libecm1-dev/AUTHORS
/usr/share/doc/libecm1-dev/NEWS.gz
/usr/share/doc/libecm1-dev/README.gz
/usr/share/doc/libecm1-dev/README.lib.gz
/usr/share/doc/libecm1-dev/changelog.Debian.gz
/usr/share/doc/libecm1-dev/changelog.gz
/usr/share/doc/libecm1-dev/copyright
/usr/share/doc/libecm1-dev/examples
/usr/share/doc/libecm1-dev/examples/Makefile
/usr/share/doc/libecm1-dev/examples/ecmfactor.c