This is an automated email from the git hooks/post-receive script. gregoa pushed a change to branch master in repository libmath-prime-util-perl.
from a38799e Prepare changelog for release adds fa74ade Handle is_power with small negative arguments in XS adds 5a8c520 Fix PP is_power with -1 adds b8defbc Change PP Bernoulli method to Seidel from Brent-Harvey adds b706dd7 Small redo of PP LambertW code adds 5611c4b _bernoulli_seidel() minor improvements adds f08b1a6 Merge pull request #17 from trizen/patch-1 adds a3c6203 Style update for PP bernoulli adds f503722 minor precedence fix in _bernoulli_seidel() adds 0756ee1 Merge pull request #18 from trizen/patch-2 adds 4569f07 Rewrite of LambertW code, both C and PP adds aa4025e Code style; docs for LambertW adds 2900e5a LambertW accuracy near branch point adds 877de3f Fix RiemannZeta PP post-process of GMP result adds 56a1b0a Use GMP LambertW if possible adds dde2af3 Tune AKS params for 33-64 bit inputs adds 79baae9 Add clang support for uint128 adds bc2c0a6 Use Montgomery math for sqrtmod, is_primitive_root, and p-1 factor adds 9f568dc Make sure we don't use Mont math on even modulus adds 5449f12 Make primes.pl use twin_primes function adds 72409b7 Handle some chinese() cases that overflowed before adds 79cc545 Switch to Bytes::Random::Secure::Tiny adds d1b1154 Add is_pillai adds b38b02d chinese goes directly to GMP adds e70c13d Tests for zero modulus on chinese adds 94d44c1 Sort chinese moduli with Shell sort adds f78f427 Export inverse_li including PP, docs, tests, etc. adds 7781bfc Merge branch 'master' of https://github.com/danaj/Math-Prime-Util adds 1d33460 Add is_semiprime adds b87b51f is_semiprime in GMP, minor typo in test output adds 5f4437c Use MPU::GMP random primes functions adds 292acfe Use GMP version number to select random prime package adds aa6b665 Remove unused variables adds 9943888 is_mersenne_prime got pushed out of XS case adds 8601866 Use GMP random strong and maurer primes if possible adds 0614278 Add tests for is_pillai function adds 94104c3 Comment about Axler 2017 lower prime count bound adds 0b8a0b8 PP powmod and mulmod will try GMP adds 45abc87 Update for new GMP random prime functionality adds 03fe49d Update version number adds f8a3f22 Small speedup for is_carmichael adds 9f8cad2 Timing on new AWS machine adds 177439f Merge branch 'master' of https://github.com/danaj/Math-Prime-Util adds d10d096 Fixes for portability and PP adds 5b9a861 Back out PP nth_prime_approx change to use inverse_li adds 487519a Better Lucky primes and clusters adds 2d3c45d Slightly faster is_pillai adds ff76dba Comment change adds 41da581 Update for release adds 2bb4c96 Comment updates adds 96e996d Add internal double-word to string function adds 41db589 Use our own 128-bit return for vecsum adds e896215 Add faster prime sum adds fc3dd06 Uninitialized variable in 128-bit string return adds b424333 Remove warnings for unused variables in conditional code adds dbb675e Speed up is_pillai for composites (early 0 detection) adds 92cefeb Add prime restriction to forpart adds 0c9d9fc Update ppport adds 5973939 Add PP prime sum, fix result of both versions adds 1469de3 Speed up cluster sieve a bit adds ac70c9d Formatting adds 8d8b67c Update Mersenne number milestones adds 86c7e9b is_primitive_root needs two args adds fa26948 Merge branch 'master' of https://github.com/danaj/Math-Prime-Util adds e1083a1 Update large prime count bounds with Axler 2017 adds 79bc25e Ramanujan primes, finer nth upper limit adds 6d2f11b Faster ramanujan prime count adds 581e2d0 Ramanujan prime loops use segmented sieve for big memory savings adds 683737b ramanujan prime count updates adds 6fe8473 Move some thread logic to its own include file adds 870ffb0 Skip a big semiprime test if not using GMP adds 5ab9003 Add random functions. Massive changes. adds ac276b1 Move random_nbit_prime and random_ndigit_prime to XS adds 2e1b289 mismatched ifdef adds c447ead Make tests pass on 32-bit adds 73af71c Perl_seed didn't exist in 5.6 adds 74e7978 Remember thread context for seed adds e02d4d3 standalone compilation was skipping the test for uint64_t adds 7276b91 Remove debugging comments adds 9efdd2d Move random_proven_prime and random_strong_prime into XS adds 6fe0f68 Call urandomm from PP code if possible adds d9d8862 Move remaining random primes functions to XS adds fbee461 Remove RandomPrimesGMP -- not needed any more adds 996f6e0 cleanup release tests adds 2f59acd Update timings in RandomPrimes comments adds f8b63ce Latest Ramanujan prime limits adds 9b9b4f2 ChaCha20 csprng in C and Perl adds 9a50177 More options to have uint64_t adds 5caab75 memtile is a little more generic adds 90c1892 Ramanujan prime updates adds 9b191a1 Fix for odd substr behavior adds 313b11d Add but don't use new ChaCha core adds 2f4cb6c Switch to new simple ChaCha20 adds 088c0c6 Update docs for ChaCha20 adds 0893e8b Fixes for 32-bit adds 3e789be More 32-bit fixes adds ad5eb3f Updates for PP ChaCha and drand adds 6d6f8c9 Consistent ChaCha20 for C and Perl adds 8fbb22d ChaCha20 PP random_bytes fix adds 1d9238d Consistent srand on 32-bit machines adds b275051 Consistency for ISAAC, more float changes adds 28d8630 Add support for quadmath to drand. adds 734a458 Previous PP drand change broken arguments. Fix adds c9d7572 Instead of NV size and USE_QUADMATH, use NVMANTBITS for drand behavior adds 7b071b1 Look for PERL_VERSION to decide if we're compiling as part of Perl or not adds 83970db Simplify ChaCha irand/irand64/random_bytes code adds 852cde0 Revert STANDALONE change adds 8109017 Stateful testing for rand adds d76e27f More drand updates adds b124bf8 Endian update for PP ChaCha20 adds b7841d0 Speedup PP testing on super slow machines adds d894145 Optimizations for PP ChaCha adds f9d0eb4 Update benchmarks and PPFE selection of RNG adds 9b09a12 fix old seed_csprng to csrand. Enable rand tag test. adds 92ed8bd Remove old comments in rand tag test adds aee71c4 Fix seeding alignment differences on 32-bit and 64-bit adds 070bae6 Release testing and add 6 new ramanujan prime functions adds fe33395 Bump version number adds 3fdbe68 Move RNGSeed to Entropy adds 3fe1774 Add entropy_bytes adds 42d4357 Split util.c into 3 pieces adds 42645ac math.h defines fro functions used adds b490e33 32-bit issues with some of the PP functions adds b477b57 Bump requested GMP version adds 7c456ce Merge branch 'master' of https://github.com/danaj/Math-Prime-Util adds 8937e4a Change RNGSeed to Entropy in MANIFEST adds 46476eb Perl.h's U8TO32_LE doesn't wrap ptr in parens adds e058076 Redo how we find math.h functions adds 3dc5277 Speed up PP is_semiprime adds 2a03f2d is_semi test faster but still slow on 32-bit PP, so trim adds 92272e6 PP next_prime prev_prime, inline bigint primality test adds def9e6d Fix some warnings adds 74cfe5c Redo small Pi to help quadmath not depend on sprintf adds 1d08ddd Comments about drand adds 0bd8c05 Move spigot Pi algorithm to util. Use it in Pi(). adds 87044a3 Compatibility for Perl 5.6 and old GMP code adds 5ec0f2a Add entropy_bytes to release tests adds 705d979 Run t/34 core rand detection on 32-bit adds a10215f miller_rabin_random broken out and better catching of negative number of bases adds abd3ac8 Bump version number adds 856efdb We should be fine with MPU::GMP 0.44 adds 937fbd4 Change inverse_li to Halley adds 0cfb90c Don't call GMP miller_rabin_random for older versions adds 3630474 Bump version adds f1a864f If GMP returns undef, we pass it through unchanged adds 530470c Rewrite of LogarithmicIntegral and inverse_li adds de426ee Support Math::BigInt::Lite adds bfa3b19 New version of inverse R used in nth_prime_approx adds 9c4306b Use our rand calls, especially urandomm, for our xt and bench files adds 3f6eab7 Use inverse_li instead of Cipolla for PP nth_prime_approx adds adb663c Faster convergence for inverse_li adds 2b95490 Internal: remove _XS_ prefix from Ei,Li,RiemannR adds 420019b Make sure tests pass for all non-bigint object inputs adds d97e4fc Merge branch 'master' of https://github.com/danaj/Math-Prime-Util adds 19de863 Internal: Rename _XS_prime_count to segment_prime_count, add prime_count adds bd9a409 Internal: Rename _XS_*_pi functions adds c95d8f8 Rename private XS interface functions for prime count algorithms adds d6410b4 inverse Riemann R: slightly better accuracy adds c48dd97 Internal: Change _XS_is_prime to is_prime adds ff34fc3 Build and test fixes from test reports for v0.64 adds fd7b4b1 Use binary search for trimming ramanujan_primes adds 2001bae Adjust segment / LMO tradeoff in prime_count adds 53b0079 Work around Math::BigInt::Lite issue adds cfe6b3a Lock-free prefix for cache optimization in next_prime etc. adds 621bdf3 Make sure we turn on dynamic config adds acf9c0d Fix sum_primes, tune nth_prime_upper, more Ramanujan bounds adds f88a5c5 Deprecate irand and primeinc adds e7c32d1 Update some benchmarks adds 50db1c0 Update last double-checked Mersenne adds a909e94 Updates to large Ramanujan prime bounds adds 241aed5 Bump version number adds 8ed057c Make PP inverse_R function private adds 6476853 Prep for release adds 797a833 New upstream version 0.65 new 798ce7f Updated version 0.65 from 'upstream/0.65' new 94054a0 Update debian/changelog new a859519 Update years of upstream and packaging copyright. new 896af81 Add API changes to debian/NEWS. new e7cf1f7 Update (build) dependencies. new cc1b551 Declare compliance with Debian Policy 4.0.0. new 775bb4d releasing package libmath-prime-util-perl version 0.65-1 The 7 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 | 151 +++ MANIFEST | 25 + META.json | 33 +- META.yml | 28 +- Makefile.PL | 33 +- README | 6 +- TODO | 32 +- XS.xs | 513 +++++--- aks.c | 6 +- bench/bench-drand.pl | 92 ++ bench/bench-factor-extra.pl | 22 +- bench/bench-factor-semiprime.pl | 22 +- bench/bench-irand.pl | 72 ++ bench/bench-is-prime.pl | 7 +- bench/bench-isprime-bpsw.pl | 20 +- bench/bench-mp-nextprime.pl | 2 +- bench/bench-mp-prime_count.pl | 9 +- bench/bench-pp-isprime.pl | 40 +- bench/bench-primecount.pl | 54 +- bench/bench-random-bytes.pl | 103 ++ bench/factor-gnufactor.pl | 22 +- bin/primes.pl | 141 +-- cache.c | 87 +- chacha.c | 316 +++++ chacha.h | 14 + cpanfile | 4 +- csprng.c | 343 ++++++ csprng.h | 36 + debian/NEWS | 15 + debian/changelog | 10 + debian/control | 8 +- debian/copyright | 4 +- examples/fibprime-mce.pl | 2 + factor.c | 17 +- isaac.c | 146 +++ isaac.h | 13 + lehmer.c | 64 +- lehmer.h | 8 +- lib/Math/Prime/Util.pm | 648 ++++++---- lib/Math/Prime/Util/ChaCha.pm | 317 +++++ lib/Math/Prime/Util/ECAffinePoint.pm | 4 +- lib/Math/Prime/Util/ECProjectivePoint.pm | 4 +- lib/Math/Prime/Util/Entropy.pm | 185 +++ lib/Math/Prime/Util/ISAAC.pm | 267 ++++ lib/Math/Prime/Util/MemFree.pm | 4 +- lib/Math/Prime/Util/PP.pm | 686 ++++++++--- lib/Math/Prime/Util/PPFE.pm | 167 ++- lib/Math/Prime/Util/PrimalityProving.pm | 4 +- lib/Math/Prime/Util/PrimeArray.pm | 4 +- lib/Math/Prime/Util/PrimeIterator.pm | 4 +- lib/Math/Prime/Util/RandomPrimes.pm | 293 +---- lib/Math/Prime/Util/ZetaBigFloat.pm | 4 +- lib/ntheory.pm | 30 +- lmo.c | 13 +- lmo.h | 2 +- montmath.h | 2 + ppport.h | 366 ++++-- primality.c | 11 +- prime_nth_count.c | 983 +++++++++++++++ prime_nth_count.h | 22 + ptypes.h | 38 +- ramanujan_primes.c | 447 +++++++ ramanujan_primes.h | 19 + random_prime.c | 91 ++ random_prime.h | 12 + sieve.c | 14 +- sieve_cluster.c | 34 +- t/02-can.t | 30 +- t/04-inputvalidation.t | 4 +- t/11-ramanujanprimes.t | 40 +- t/13-primecount.t | 12 +- t/14-nthprime.t | 15 +- t/16-randomprime.t | 46 +- t/17-pseudoprime.t | 2 +- t/19-moebius.t | 26 +- t/24-partitions.t | 23 +- t/26-pillai.t | 21 + t/31-threading.t | 23 +- t/34-random.t | 244 ++++ t/35-cipher.t | 51 + t/35-rand-tag.t | 54 + t/80-pp.t | 2 +- t/81-bignum.t | 7 +- t/92-release-pod-coverage.t | 12 +- t/93-release-spelling.t | 14 +- threadlock.h | 76 ++ util.c | 1957 ++++++++---------------------- util.h | 67 +- xt/check-nth-bounds.pl | 49 + xt/make-chacha20-inner.pl | 56 + xt/make-script-test-data.pl | 2 +- xt/pari-totient-moebius.pl | 6 +- xt/primality-aks.pl | 5 +- xt/primality-proofs.pl | 21 +- xt/test-bpsw.pl | 28 +- xt/test-factor-mpxs.pl | 20 +- xt/test-factor-yafu.pl | 20 +- xt/test-nextprime-yafu.pl | 4 +- xt/totient-range.pl | 6 +- 99 files changed, 7121 insertions(+), 3017 deletions(-) create mode 100644 bench/bench-drand.pl create mode 100644 bench/bench-irand.pl create mode 100644 bench/bench-random-bytes.pl create mode 100644 chacha.c create mode 100644 chacha.h create mode 100644 csprng.c create mode 100644 csprng.h create mode 100644 isaac.c create mode 100644 isaac.h create mode 100644 lib/Math/Prime/Util/ChaCha.pm create mode 100644 lib/Math/Prime/Util/Entropy.pm create mode 100644 lib/Math/Prime/Util/ISAAC.pm create mode 100644 prime_nth_count.c create mode 100644 prime_nth_count.h create mode 100644 ramanujan_primes.c create mode 100644 ramanujan_primes.h create mode 100644 random_prime.c create mode 100644 random_prime.h create mode 100644 t/26-pillai.t create mode 100644 t/34-random.t create mode 100644 t/35-cipher.t create mode 100644 t/35-rand-tag.t create mode 100644 threadlock.h create mode 100644 xt/check-nth-bounds.pl create mode 100644 xt/make-chacha20-inner.pl -- Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git _______________________________________________ Pkg-perl-cvs-commits mailing list Pkg-perl-cvs-commits@lists.alioth.debian.org http://lists.alioth.debian.org/cgi-bin/mailman/listinfo/pkg-perl-cvs-commits