[libmath-prime-util-gmp-perl] branch master updated (c535bce -> 69fe022)
gregor herrmann
gregoa at debian.org
Mon Sep 15 18:57:49 UTC 2014
This is an automated email from the git hooks/post-receive script.
gregoa pushed a change to branch master
in repository libmath-prime-util-gmp-perl.
from c535bce update changelog
new fe0eb54 Add debian/upstream/metadata
new 46d5936 Update debian/changelog
adds b8f83ef Initial commit
adds f4fb924 Initial checkin with miller_rabin code
adds e663641 Strong Lucas pseudoprime, is_prime, is_prob_prime
adds 2ea0125 Fix memory leaks with mpz objects
adds 043ca86 Return 2 for def prime
adds 75f604c Move code to .c file, add next_prime, prev_prime, rudimentary factoring
adds 4af8a8f Add HOLF and P-1, fix for general factor
adds dcaf45b small GMP performance enhancements
adds 9df68c5 More factoring code
adds fb4be1c Speedup for p-1
adds 618584c Fix prototypes
adds e7c83a6 Factoring speedups
adds 60a01f0 Very small factor changes
adds 44d8c49 Stage 2 for p-1
adds c253d31 Factor breaks composite factors now, p-1 second stage improved a lot
adds 524a3f0 add primes method, write most of the documentation
adds 7478d0c Add tests, update for impending release
adds 75c8dca Factoring update
adds 9b182ac Add Devel::CheckLib, so we'll only try to install if they have GMP
adds 16a8ce6 Update date
adds 751cbc3 Rewrite factoring tests
adds 0cf21ff Update for v0.03
adds 1a5b820 Fix issue with 5.6.2 64-bit
adds 23eab8e Add lcm to XS
adds 281048f Changes for pedantic ansi compiling
adds f02910f Turn on debug for the p-1 factoring, in vain attempt to see why CPAN testers are seeing failures that I cannot duplicate
adds bded09f Uninit variable
adds f5a8b72 Update Changes for 0.03
adds f66dd57 Add prime_count
adds 1057c6f Don't include stdint on MS compilers
adds 29d0fed Remove commented out dependencies on Math::Big*
adds d60d39d Add primorial and consecutive_integer_lcm functions
adds e2e2bff Make primorial and pn_primorial match MPU.
adds cfb5662 Fix typo in internal next_small_prime function. Broke primorial.
adds b8ecc71 Fix HOLF issue with perfect sqrts, add simple perfect power factoring test
adds d1b7b20 Make factor() test for perfect powers, add ability to call trial division
adds 2a759f2 Make ..._factor functions test for 2/3/5/7 divisibility first.
adds 0290cad Add quick Pocklington primality test and make is_prime() call it
adds a41db9d Add basic ECM factoring
adds 152b265 Run a bit more initial p-1
adds 85110d3 Add BLS primality test, is_provable_prime, some factor adjustments, enhancements to SQUFOF
adds b22814d Complete rewrite of p-1 factoring
adds 300103f Fix compiler warnings
adds f5809e1 Another p-1 optimization, doubles speed of stage 1
adds 1d775b3 Efficiently precalc the first 20 differences, simplify lazy calculations
adds 816de4a Small p-1 change
adds 842016f Try out Travis CI
adds f625bb8 Remove Perl 5.8 from Travis
adds b3e479a Rewrite consecutive_integer_lcm to not use sqrt or log
adds 8f7a903 Cleanup for impending CPAN release
adds 011be36 Add a couple more files to .gitignore
adds 8e176bf Add AKS test
adds 93b725e 7000 tests -> 2 is_deeply tests. Big speedup on slow systems, same testing.
adds 964f77b Speedup affine ECM
adds 8efa28f Small prime iterator
adds 950d634 Update for release
adds be57e34 Fix 1-byte memory overflow
adds 0fe050f Add small factoring, setup for next release
adds 22ed092 Handle Math::BigInt inputs a little better
adds 6cedd44 Speedups for factoring
adds 20a368f Update documentation
adds ae9fef4 M-R with large bases
adds 1c1a75d Travis-CI seems to have changed
adds f385d5a Final changes for release
adds 32a7bfd Split out ECM, add QS (SIMPQS from old FLINT)
adds 9ae5307 Some QS tuning
adds 600bee8 Factoring speedups (QS and mix)
adds 867ead1 Restructuring QS
adds 9e7ebae Update KS, round 1
adds 7fb5f16 Redo K-S algorithm, part 2
adds dfb1ce7 Add simple is_prime functionality
adds 3ea2aea New ECM code
adds efd935e Compilation cleanup
adds 308fcc7 More code cleanup
adds c48db03 Only use primes for K-S multipliers
adds 228814f Fix compile warnings
adds 11c7e04 Adjust firstprimes; compilation cleanup; a couple memory issues
adds 53b61fe Update docs
adds 41b3918 Change factoring mix
adds 6ed4ae1 Convert SIMPQS to New/Safefree
adds b0c1227 Small updates
adds 9a4a806 Switch to non-normalized for stage 1. A little slower.
adds 9368184 Adjust mix -- remove pbrent, add tiny ECM
adds e0c1648 QS returns multiple factors, adjust factor and BLS75 factoring mix
adds 6b74dd3 Use native int factoring for small values in BLS75 test
adds da7c36c Speed up primality proofs
adds ed69138 More primality proving rework
adds 69e4f44 Code cleanup
adds 347753f Turn on random seeding for ECM
adds 2eae133 A little code cleanup
adds 63799de Update for release
adds 857458b Code cleanup
adds bac4a89 Add PRAC as alternative EC multiplication
adds 824af7a Minor cleanup
adds 5b30035 Update for release
adds dc920ae Start moving some functions to utility.c
adds 8e5fb76 Verbose > 2 printing for p-1, ecm, and qs. QS does trialdiv to 1000.
adds 4ff885f Add Cornacchia and modified Cornacchia
adds 232f2a1 Code cleanup
adds 94bd0d7 Add return of n-1 primality proof to is_provable_prime
adds 0f78927 Update version
adds 0bbe99b Adjust primality proof return
adds 55b0d00 Updates to primality proving
adds 0db66a3 Fix for 32-bit machines
adds 65a4832 Huge AKS speedup: binary segmentation for polynomial multiplication
adds 297bb58 AKS: More accurate log2n => smaller r => fewer loops => slightly faster
adds 78e83df Revert a change in mpz_order
adds 5139fd4 Constify some tables
adds dc3915b Add support (turned off) for BLS75 theorem 7
adds 5e0bf1f Start of function to return Hilbert polynomials
adds b80cfc5 Fix preliminary hilbert polys, minor speedup for really big AKS values
adds e69027f Lots of HCPs, needs more storage efficiency work
adds 81a3819 Much better HCP storage method, verify and add a value from SAGE
adds 2d80bdf Export affine multiply
adds cb06950 Add commented out AKS helper function
adds ec0cf6c Big updates to utility,c to add many new functions (internal C+GMP)
adds fde3a7f Change BLS proof to take effort int instead of boolean.
adds db855bc ECPP implementation
adds 5344215 Minor ecpp update
adds fdc1457 Primality proof returns for ECPP
adds d44349c Callee responsible for proof memory allocation
adds 540083a Put BLS75 into its own file
adds 7cc8950 Redo is_prime / is_provable_prime with ECPP and random MRs
adds 75430eb Add spell checker to release testing
adds 114c913 Add is_nminus1_prime(). Spelling fixes
adds 057a1db ECPP: make stage 1 and 2 factoring lighter (faster but less factoring). Big speedup for small sizes.
adds f09faf5 Add a simple test for AKS, N-1, and ECPP
adds baa0206 Comment changes
adds d3dcff5 Perl 5.8.8 and earlier croak on newSVpv with null argument
adds adcb484 typo in manifest
adds f251a3d Updates for release
adds d234d9f Turn on BLS75 theorem 7
adds f267cfb Fix a T7 hang, use QS earlier on small inputs
adds e5e0724 Fix polyz_print. Don't croak if no roots found
adds 0398e60 Small p-1 stage 2 speedup (only mod b every 4 primes)
adds 96a8518 Add big poly data to xt directory
adds 4362af2 Change ECPP to factor all with backtracking
adds 80ce899 ECPP FAS fixes for factoring harder at step 0
adds 38a49d2 Lower is_prime opportunistic proof effort
adds 78cdb77 Actually commit the pseudoprime and is_prime effort code
adds d975027 Faster is_prob_prime (faster composite check, rewrite of Lucas)
adds 24e61c0 Small changes to fix issues found on Win32
adds f44e938 Update class poly file
adds 90e22fd Updates for release
adds ae6a416 Update Changes for release
adds 95d1c03 Minor updates ahead of release
adds e0123d0 Some tweaks to is_prime number of tests, and streamline strong Lucas a little
adds 5ab738c Braces. Important.
adds d28e5bf Update Lucas test docs and tests
adds 69e99e2 Add standard and extra strong lucas prp tests
adds 54db4d8 Enable making a standalone ECPP
adds cc8f751 Plug memory leak for new standard Lucas test
adds 059efd5 Tweaks for ECPP
adds 08276b8 Some ECPP speedups and options
adds 847eea4 Add script to create standalone ECPP directory
adds c05fb9e Small speedups for class poly functions
adds 601c896 ECPP tweaks
adds 65d4fab typo fix
adds 30b7c97 Merge pull request #2 from dsteinbrunner/patch-1
adds f1e32b0 ECPP with n-1 shortcut needs to print something when verbose
adds 7c4d535 Small changes for p-1 performance
adds e5366fb Updates for release
adds 2584a94 Add FU pseudoprime
adds 57a8582 Trial division for ecpp via giant gcds
adds 2cb534d Add general Lucas sequence code, rearrange Lucas tests to combine and use it.
adds 797d310 Add BLS75 theorem 3 and 15 tests for n-1 and n+1 support
adds 497a566 Add integrated n-1 and n+1 tests. Still needs a lot of work.
adds 4a5a59f Document the Frobenius-Underwood pseudoprime function
adds d669ef2 Speedup for large composites in is_prob_prime
adds 6592808 For n+1 proof, send back p and q, not just d
adds 37359ac Bump version number
adds d06385b Add lucas_sequence
adds 0bea773 Fix documentation typo
adds 5aea03f Add very simple p+1 factoring, is_prime does fewer extra M-R tests
adds abb8d18 Use a little p+1 and pbrent
adds 9c449b5 Wrap gcd init inside init-status test
adds e016269 Add some degree 18 and 20 polys, and a few 21 and 23 also
adds cfbc610 Start changing certificates to new text format
adds 45ce991 Update Lucas tests
adds d563cb6 Add 'almost extra-strong' Lucas test
adds 66d73d0 Bump up prime iterator sizes slightly
adds aa9ff16 Sort factors largest to smallest. Reduces number and provides consistency.
adds 49535a6 Switch to extra strong BPSW. Clean up primality proofs.
adds 7ed27d6 Add Lucas D search limit, move perfect square test into D search
adds eb2904d Small ECPP change
adds 9824032 Much better p+1 factoring (10x faster), use in ECPP.
adds 942f633 Optimize extra strong Lucas test
adds 0cbf0c9 Add tests for various Lucas prp tests
adds 234f432 Proof updates
adds 04f864e Don't limit degrees as early with big numbers
adds bd5bd2e Add todo info about missing ECPP discriminants
adds 5c56f97 Add more polys. Complete through degree 17.
adds 1f2c8ca ECPP updates including text certificate verifier
adds 456270b Certificate verifier, primo converter.
adds 72214e2 Remove debugging GMP disable, doh
adds fa1ff2b More primality proof adjustments
adds c660529 More efficient poly root finding
adds 824d00c Make sqrtmod do verification of result
adds ad35e38 Certificate verifier now does Primo and MPU formats
adds 3afdcaf Updates for cert verifier
adds 68ff118 Add tentative Weber root conversion for D%3=0,D%8=7 case
adds 72bff63 Base 10 is the default, don't spit it out in every cert
adds 2a358dd ECPP updates
adds a83c10a Add GMP-ECPP cert convert script
adds 654688e Update todo file
adds a59a4e0 Add C+GMP verifier for Primo and MPU
adds 3b52e4a Weber roots with D%3=0 and D%8 = {1,2,5,6,7}
adds d7ed615 Speedup for pn_primorial
adds 760b50d Merge
adds 5418538 Updates for proofs
adds e6d775f Add projective code (defined out)
adds eba1f7a Grammarian Pod Checker fixes
adds de0ea9d Fix UV / GMP UI mismatch issue with primorial optization
adds 6235422 ECPP updates for release
adds bb21aef Update Changes for release
adds 6584408 Fix small certs
adds 8a7418b Fix broken tests to match fixed code
adds 01b634d Updates for release
adds 7912873 Reformatted as per CPAN::Changes::Spec
adds df0eaed Merge pull request #3 from neilbowers/master
adds e0accea factoring commands should return F,R instead of R,F
adds 8aa6441 Trim ecpp.c and modify poly degree heuristics
adds 409527f Extra compositeness tests, and Q composite doesn't imply N composite
adds f5835b3 Expand constants to allow huge proofs, add comments about projective
adds f2f5157 Use degree 5 minimum degree instead of 4 when trimming
adds c461b75 Some more thoughts on projective EC (not compiled on by default)
adds 84896a9 Comment about crypto use of random primes
adds 3b05faf Add documentation for each proof type
adds 2eafd5b Some more comments added to ECPP documentation
adds f200d1a Allow different ECM B2, might speed up ECPP
adds 5b47bfb cert v0.91
adds 5c1a1bb Add bigger gcd for 200+ bit prob primes, speed up pn_primorial
adds 92bd5ce Slightly deeper ECPP poly search
adds 46a5ab2 Test string for divisibility by 2,3,5 before converting to GMP
adds 0c0b583 Fix string test and disable for pseudoprimes
adds eec050d Initial treesieve + redo is_prob_prime trial
adds b427ed2 Next round of tree sieve changes
adds 3bbd3d4 Speedup large primorials and cilcms.
adds 081624a Double up multiplies in pn_primorial
adds 1e2cbe9 Clean up start of trial_factor
adds 2288c5c trial_factor no longer does a probable prime test
adds b4ab600 Merge branch 'master' of github.com:danaj/Math-Prime-Util-GMP
adds 34f81c9 Next set of changes for tree sieve
adds f78f8ac Revert "Next set of changes for tree sieve"
adds 7b868f1 Next set of changes for tree sieve
adds aabb48e Swapped limit and primary limit meant we made the aux sieve every segment
adds d39c5ec Update version; adjust standalone ECPP files including a set of simple tests
adds 7818dd7 Add 2013 to date. About time :)
adds 3a39a01 Use dynamic size for treesieve
adds 1f0a9bc Add miller_rabin_random
adds 52d0b66 Use floor(2*sqrt(n)) instead of 2*floor(sqrt(n)) in verify
adds 3120f03 Sort m's by size for performance
adds 2ab0c5f Use mpz_swap
adds 21be65b More robust parsing and output tweaks
adds 1912ae8 Mention skipped bad lines in verbose mode
adds 3ea4676 Add return codes to standalone ECPP
adds 52f3b6d Repeated factors could cause problems in BLS75 minimization
adds 8d047ac Add bpsw option to usage text
adds 6242b5d Merge branch 'master' of https://github.com/danaj/Math-Prime-Util-GMP
adds 89b1df1 Updates for release
adds 6d3594f Update Devel::CheckLib to 1.01
adds b0d8c24 Merge branch 'master' of github.com:danaj/Math-Prime-Util-GMP
adds 681c1bc Merge branch 'master' of https://github.com/danaj/Math-Prime-Util-GMP
adds e0a309c Update documentation
adds d9d6931 factor in scalar context; miller_rabin_random should return only 0 or 1
adds 75be6a5 Update Changes date for release
adds 5013fa8 Fix verbose output for n+1
adds a4dbe0a Update meta spec
adds f0741aa Only use TEST_REQUIRES with new enough MM
adds cb5aa48 Delete TEST_REQUIRES after merging
adds 9c5796a Remove testing code
adds 93e54de Update resources
adds 9654ed1 Fix memory leak
adds c4363ce Add partitions function
adds 5d1ab5e Export partitions, bump version to 0.16
adds 67e89ee Have factor do QS earlier for 100-159 bit numbers
adds 44b6865 Merge branch 'master' of github.com:danaj/Math-Prime-Util-GMP
adds 88de29a Document partitions
adds be363dd Add tests for partitions()
adds 36c6a5d Fixes for is_aks_prime
adds b350a55 Merge branch 'master' of https://github.com/danaj/Math-Prime-Util-GMP
adds 22f8034 Minor updates for release
adds 20b14a9 Add verify_primegap script
adds 734b33a fix decl after statement
adds 0ea02ae Fix spelling error (RT 91561)
adds 38604e8 Primo now allows S=1 in ECPP proofs
adds 44ac43c Fix for word boundary problem in trial factor
adds 5b21fbf Shortcut for iterator isprime
adds e047087 Add gcd, lcm, kronecker
adds ff74fb5 Add a few more gcd/lcm/kronecker tests
adds 55115a6 Documentation for gcd lcm kronecker
adds 9d48aeb Update date
adds d600b37 Small changes
adds 5e3f698 Add is_bpsw_prime documentation
adds ce3f9d8 5.6.2 has XSRETURN_IV but no XSRETURN_UV. What a POS.
adds 56353cc Fix unsigned long isqrt for places where unsigned long != UV
adds f4542da Add another factoring test, get ready for release
adds 1ca5c6c Add improved AKS parameters
adds 8777e8f Fix AKS overflow in log
adds 5904ae7 Adjust AKS r/s tradeoff for larger values
adds 7f1dfa5 Add is_power
adds 417b577 Add exp_mangoldt
adds 99021cf Small performance changes for poly roots
adds b644217 Documentation and add stage 1 ECM for degree <= 2
adds 688920f More small ecpp performance tweaks
adds 73ca4ab ECPP initial root speedup
adds 2fae943 ECPP: Better initial trial division
adds e59abd3 Add another big pseudoprime
adds 16780fe ECPP: Bring back stage 0
adds 8dccfaf AKS, remove unused variables, use prime r for v6 test (perf and simplicity)
adds 9572927 Comment ECPP changes in Changes file
adds d00b031 ECPP: make polyz_div perform mod n
adds af3c61c ECPP: performance updates
adds f422985 Remove unused variable
adds 4551460 ECPP: check all factors for a discriminant and select smallest. Smaller proofs, maybe faster, maybe slower.
adds c643b5d Use Weber polys for more values, reduces overall size
adds 4bab21d Add a few small degree 22/24 polys to big set
adds 5c91ac8 Fix large poly coefficient truncation
adds 9490896 Don't do both m/q pairs at once for larger numbers
adds ae5021d Update class polys with latest tiny file
adds 13e068e Update big ECPP class poly table
adds 2c94f0b Update README for standalone ECPP
adds 62222d8 Merge branch 'master' of github.com:danaj/Math-Prime-Util-GMP
adds 3eccca7 Adjust BLS75 factoring -- 70+ digit numbers do some more ECM before QS; do QS on larger numbers
adds 928059c ECPP changes for 1.03, step 1
adds 8dcdcba ECPP changes for 1.03, step 2
adds 4ee5508 Update TODO
adds 3d11f99 Merge branch 'master' of github.com:danaj/Math-Prime-Util-GMP
adds f218f15 Add changes text
adds 4ca75e9 Don't do QS for numbers over 90 digits -- too much memory
adds 88538e5 Add some text to Changes
adds 4e4d61b Fix is_prime shortcut test for divisibility by 2 and 5
adds d59060f cast signed comparisons
adds 4008711 ECPP: min degree a little larger, hard min of 7 instead of 6
adds 06ed51a Update to next release
adds 17f4f0e Update for release
adds 9dbfb06 Add valuation, invmod, and is_pseudoprime
adds d405476 Go back to /40 for minH
adds e39966e Add binomial function
adds 0f1f767 binomial tests and docs
adds 3d903d6 Simplify negative k code
adds d9c3272 Split is_prob_prime second gcd from 20k into 10k or 40k. Speedup for 128-4000 bit inputs
adds 4f7832b Clean up next/prev_prime; handle multiples of 7/11/13/17/19/23 natively
adds 7406767 Tiny speedup for is_prob_prime
adds cf73006 TODO note about power tests in factoring
adds 6747ae5 Fix iterator for very large inputs, raise sizes slightly
adds 7db230e Comment out PP from benchmark
adds c580385 Don't do the Fermat pretest in ECPP factoring primality tests
adds 0d1a15a Add gcdext and vecsum
adds b824ad2 Update version number
adds 603ff77 Update release date
adds 36342c5 UL -> UVCONST for gcd_ui pretest
adds 82e13e0 Wrap a 64-bit test number in quotes
adds d0f08b3 Bump version number
adds bdc6167 Move factor loop out of XS.xs and into factor.c
adds 257b751 Do our own trial factoring
adds 4069aaa Prevent hang if B1 is very low
adds 049b9c0 Make qs_factor exportable
adds 084832b Have HOLF return 0 if the gcd resulted in no factor
adds b243842 Merge all specific factor routines in XS.xs
adds 59499ac Alloc 10 factors at a time; don't use mpz_remove in trial loop
adds 6e15511 Add moebius
adds d9e54ba Reduce some overhead in factor loop
adds 9a0f415 Add ranged moebius and liouville
adds 74759bf Add Euler totient and Jordan totient
adds f69745a Tests and documentation for moebius,liouville,totient,jordan_totient
adds b82092a Add carmichael_lambda
adds a005b81 Add znorder
adds c582f1a Fix compiler warnings
adds ee78263 Add znprimroot
adds 8ca2ebe Note testing of primality pre-tests
adds 4acc6d7 Fix factoring mpz_get_ui issue
adds 72028f2 Update description
adds 45e33f9 Update README description
adds faf50f8 use UL instead of UVCONST for GMP ui func
adds 78f3044 Fix spelling and Paul Zimmermann's name
adds 55265a1 standalone ecpp expression parsing
adds 74646f5 Change 64-bit UL to two multiplied 32-bit ULs
adds 37c79bf Update to standalone ecpp
adds b43d565 Make standalone ecpp version 1.04
adds af3b6b1 Fat comma isn't fat if left arg begins with a digit
adds b11f112 Bump version number
adds f7af018 Imported Upstream version 0.23
new 2751216 Merge tag 'upstream/0.23'
new df7e5e5 Update debian/changelog
new 69fe022 releasing package libmath-prime-util-gmp-perl version 0.23-1
The 5 revisions listed above as "new" are entirely new to this
repository and will be described in separate emails. The revisions
listed as "adds" were already present in the repository and have only
been added to this reference.
Summary of changes:
Changes | 31 ++
MANIFEST | 6 +
META.json | 4 +-
META.yml | 4 +-
Makefile.PL | 1 +
README | 9 +-
TODO | 21 +-
XS.xs | 511 +++++++-------------
debian/changelog | 11 +-
debian/upstream/metadata | 5 +
ecm.c | 4 +-
ecpp.c | 31 +-
examples/vcert.c | 2 +-
factor.c | 571 +++++++++++++++++++++++
factor.h | 18 +
gmp_main.c | 10 +-
lib/Math/Prime/Util/GMP.pm | 100 +++-
t/19-moebius.t | 205 ++++++++
t/93-release-spelling.t | 2 +-
xt/create-standalone.sh | 20 +-
xt/expr-impl.h | 125 +++++
xt/expr.c | 1107 ++++++++++++++++++++++++++++++++++++++++++++
xt/expr.h | 142 ++++++
23 files changed, 2534 insertions(+), 406 deletions(-)
create mode 100644 debian/upstream/metadata
create mode 100644 factor.c
create mode 100644 factor.h
create mode 100644 t/19-moebius.t
create mode 100644 xt/expr-impl.h
create mode 100644 xt/expr.c
create mode 100644 xt/expr.h
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-gmp-perl.git
More information about the Pkg-perl-cvs-commits
mailing list