{"schema_version":1,"metadata":{"branch":"release","release":"7.9","architecture":"amd64","generated_at":"2026-09-09T04:04:02.361425+00:00","source_url":"https://cdn.openbsd.org/pub/OpenBSD/7.9/packages/amd64/sqlports-7.54.tgz","source_sha256":"2de00144847bf9da3a365be982f101dbb55d591ed7a915ea94984a16ab0e0404","package_count":12059,"source_kind":"sqlports"},"package":{"name":"p5-Math-Prime-Util-0.74","path":"math/p5-Math-Prime-Util","url":"/packages/release/math/p5-Math-Prime-Util/","comment":"utilities related to prime numbers, including fast sieves","homepage":"https://metacpan.org/release/Math-Prime-Util","maintainer":"The OpenBSD ports mailing-list <ports@openbsd.org>","description":"A module for number theory in Perl. This includes prime sieving,\nprimality tests, primality proofs, integer factoring, counts /\nbounds / approximations for primes, nth primes, and twin primes,\nrandom prime generation, and much more.\n\nThis module is the fastest on CPAN for almost all operations it\nsupports. This includes Math::Prime::XS, Math::Prime::FastSieve,\nMath::Factor::XS, Math::Prime::TiedArray, Math::Big::Factors,\nMath::Factoring, and Math::Primality (when the GMP module is\navailable). For numbers in the 10-20 digit range, it is often orders\nof magnitude faster. Typically it is faster than Math::Pari for\n64-bit operations.\n\nAll operations support both Perl UV's (32-bit or 64-bit) and bignums.\nIf you want high performance with big numbers (larger than Perl's\nnative 32-bit or 64-bit size), you should install Math::Prime::Util::GMP\nand Math::BigInt::GMP. This will be a recurring theme throughout\nthis documentation -- while all bignum operations are supported in\npure Perl, most methods will be much slower than the C+GMP alternative.\n\nThe module is thread-safe and allows concurrency between Perl threads\nwhile still sharing a prime cache. It is not itself multi-threaded.\nSee the Limitations section if you are using Win32 and threads in\nyour program. Also note that Math::Pari is not thread-safe (and\nwill crash as soon as it is loaded in threads), so if you use\nMath::BigInt::Pari rather than Math::BigInt::GMP or the default\nbackend, things will go pear-shaped.\n\nTwo scripts are also included and installed by default:\n * primes.pl displays primes between start and end values or\n             expressions, with many options for filtering (e.g.\n             twin, safe, circular, good, lucky, etc.). Use --help\n             to see all the options.\n * factor.pl operates similar to the GNU factor program.\n             It supports bigint and expression inputs.\n","package_architecture":"amd64","stem":"p5-Math-Prime-Util","readme":null,"dependencies":[{"path":"math/p5-Math-Prime-Util-GMP","type":"runtime","package_spec":"STEM->=0.50","url":"/packages/release/math/p5-Math-Prime-Util-GMP/"},{"path":"math/p5-Math-Prime-Util-GMP","type":"test","package_spec":"STEM->=0.50","url":"/packages/release/math/p5-Math-Prime-Util-GMP/"}],"reverse_dependencies":{"count":2,"url":"/packages/data/c9/c91ee9a5699bcc537116a8317a1744707daadfd9ee1ec5a02c8e7d0dd1a871fb.json"},"categories":["math","perl5"],"flavors":[],"only_for_architectures":[],"not_for_architectures":[]}}