Parents (Total: 15)
The searched file hash is included in 15 parent files which include package known and seen by metalookup. A sample is included below:
Key |
Value |
MD5 | 585CEFD234A73E4799748D993842797E |
PackageArch | aarch64 |
PackageDescription | primesieve is a program that generates primes using a highly optimized
sieve of Eratosthenes implementation. primesieve can generate primes
and prime k-tuplets up to 2^64. |
PackageMaintainer | Fedora Project |
PackageName | primesieve |
PackageRelease | 2.fc32 |
PackageVersion | 7.5 |
SHA-1 | 6502452639A9CB3D19F5F7B4757736F86344752B |
SHA-256 | 1AF87B9C3C500F3B9168914F5A18C4D6E995869B9B33085B8CAF339F61B20C20 |
Key |
Value |
MD5 | 6DF60F397BC02159518370A66F4C545B |
PackageArch | armv7hl |
PackageDescription | primesieve is a program that generates primes using a highly optimized
sieve of Eratosthenes implementation. primesieve can generate primes
and prime k-tuplets up to 2^64. |
PackageMaintainer | Fedora Project |
PackageName | primesieve |
PackageRelease | 6.fc33 |
PackageVersion | 7.5 |
SHA-1 | F3603BFD3AC3211E67F49B2A3ED29E402689C911 |
SHA-256 | A9595418FDD622F66D92E9F0667F5BFDE09760F87A319CED577887FC14CDB7A3 |
Key |
Value |
MD5 | 94E07F2E12434800060D9E4431A64FBC |
PackageArch | s390x |
PackageDescription | primesieve is a command-line program that generates primes using the
sieve of Eratosthenes algorithm. It can generate primes and prime
k-tuplets (twin primes, prime triplets, ...) up to 2^64 and find the
nth prime. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | primesieve |
PackageRelease | bp153.1.17 |
PackageVersion | 7.5 |
SHA-1 | 8C7BE250A0A100F75A5CA7BEA744B71AB7EF6A26 |
SHA-256 | 87B50C7EDC84D9DE85DBFBBC8CD6FD40C70C4E1700333E20AED820056A020702 |
Key |
Value |
MD5 | 9A95B4A99DB1B4EE08066963653DB125 |
PackageArch | armv7hl |
PackageDescription | primesieve is a program that generates primes using a highly optimized
sieve of Eratosthenes implementation. primesieve can generate primes
and prime k-tuplets up to 2^64. |
PackageMaintainer | Fedora Project |
PackageName | primesieve |
PackageRelease | 2.fc32 |
PackageVersion | 7.5 |
SHA-1 | 3CB527D8585E484C9F3E8423EF28B58A95FF47B2 |
SHA-256 | A4B3A3C2454D4AFB1BFECA1521C6DB15530EE500C50DE1D2C075A1BE312AF174 |
Key |
Value |
MD5 | 2B357A359AA141E04925752981347F05 |
PackageArch | x86_64 |
PackageDescription | primesieve is a command-line program that generates primes using the
sieve of Eratosthenes algorithm. It can generate primes and prime
k-tuplets (twin primes, prime triplets, ...) up to 2^64 and find the
nth prime. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | primesieve |
PackageRelease | bp153.1.17 |
PackageVersion | 7.5 |
SHA-1 | DAB5075EEE6103B829D9FB88AD1EB7D7AB13442B |
SHA-256 | 3F865338B08F61F2227922BEC5441EEC2DCE18291BEED295F429771309D008EE |
Key |
Value |
MD5 | AE7B81992FDD1802287C9AACA7D9F590 |
PackageArch | aarch64 |
PackageDescription | primesieve is a program that generates primes using a highly optimized
sieve of Eratosthenes implementation. primesieve can generate primes
and prime k-tuplets up to 2^64. |
PackageMaintainer | Fedora Project |
PackageName | primesieve |
PackageRelease | 6.fc33 |
PackageVersion | 7.5 |
SHA-1 | 115291FD6346FC968B32996675EF5214EBED1651 |
SHA-256 | 2E606C6283E80B17E6A600CAFFFA6440240318091EDD4EECC9E6D95AC6F6280E |
Key |
Value |
MD5 | 5CB55E03B9A2B9309D6B6E69FA98BBCB |
PackageArch | i586 |
PackageDescription | primesieve is a free software program and C/C++ library that generates primes
using a highly optimized sieve of Eratosthenes implementation. It counts the
primes below 10^10 in just 0.45 seconds on an Intel Core i7-6700 CPU (4 x
3.4GHz). primesieve can generate primes and prime k-tuplets up to 2^64. |
PackageMaintainer | joequant <joequant> |
PackageName | primesieve |
PackageRelease | 3.mga8 |
PackageVersion | 7.5 |
SHA-1 | E984F1E528A29BA029CE5299EC1156FF1C694BC8 |
SHA-256 | 6C9C216D22CF65E5A7EA0CBAA580E3EA953FEA71F307853F4D92D5A0EC4AE5A7 |
Key |
Value |
MD5 | A864F39F77EE8EE8C3DDA6C1CE58C004 |
PackageArch | x86_64 |
PackageDescription | primesieve is a program that generates primes using a highly optimized
sieve of Eratosthenes implementation. primesieve can generate primes
and prime k-tuplets up to 2^64. |
PackageMaintainer | Fedora Project |
PackageName | primesieve |
PackageRelease | 6.fc33 |
PackageVersion | 7.5 |
SHA-1 | 5E80889407B6E7623FB1114A66439C0C34AB645A |
SHA-256 | 4CE68ADD5CAE24C33BC2C6CC0287FDC14330AAEFB791564E4ABBC55A685AA0B1 |
Key |
Value |
MD5 | 49D4CA1A247BF0A0CDAEDBC7AC799432 |
PackageArch | x86_64 |
PackageDescription | primesieve is a command-line program that generates primes using the
sieve of Eratosthenes algorithm. It can generate primes and prime
k-tuplets (twin primes, prime triplets, ...) up to 2^64 and find the
nth prime. |
PackageName | primesieve |
PackageRelease | lp151.35.2 |
PackageVersion | 7.5 |
SHA-1 | 2AE5876EC1175AB9AC7D08DE1D3CF2AF36DE1A9D |
SHA-256 | D3A7B92FC98169631703DE9345F8C189F59CD88195442CA36D3899BC4F76C7D7 |
Key |
Value |
MD5 | 19F038F80533229121E74A8B3BAF00A6 |
PackageArch | x86_64 |
PackageDescription | primesieve is a command-line program that generates primes using the
sieve of Eratosthenes algorithm. It can generate primes and prime
k-tuplets (twin primes, prime triplets, ...) up to 2^64 and find the
nth prime. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | primesieve |
PackageRelease | lp152.1.3 |
PackageVersion | 7.5 |
SHA-1 | 89CA2C3A80C11E06434ABD291956994F5B4F3227 |
SHA-256 | D2AEA3C5F73DB85705DDFD650E9E14BB275B81E24DA28B6C714CFCE5E46D2660 |
Key |
Value |
MD5 | 121C66926349760BB55A6ECC7DA781A2 |
PackageArch | armv7hl |
PackageDescription | primesieve is a free software program and C/C++ library that generates primes
using a highly optimized sieve of Eratosthenes implementation. It counts the
primes below 10^10 in just 0.45 seconds on an Intel Core i7-6700 CPU (4 x
3.4GHz). primesieve can generate primes and prime k-tuplets up to 2^64. |
PackageMaintainer | joequant <joequant> |
PackageName | primesieve |
PackageRelease | 3.mga8 |
PackageVersion | 7.5 |
SHA-1 | E6E51E8DED6D7090018ED8195435AA5F202E32D3 |
SHA-256 | BB6E5922674223DFE22EA552E3E45D7EDA238D7E49658BD4F136A2D88BFBEA30 |
Key |
Value |
MD5 | C79FE949983BEA1BED65D639FC03504B |
PackageArch | aarch64 |
PackageDescription | primesieve is a free software program and C/C++ library that generates primes
using a highly optimized sieve of Eratosthenes implementation. It counts the
primes below 10^10 in just 0.45 seconds on an Intel Core i7-6700 CPU (4 x
3.4GHz). primesieve can generate primes and prime k-tuplets up to 2^64. |
PackageMaintainer | joequant <joequant> |
PackageName | primesieve |
PackageRelease | 3.mga8 |
PackageVersion | 7.5 |
SHA-1 | 5CD8EB4F37EFEBEAEF430B1A6FD7EDA04A0B2922 |
SHA-256 | 21AEF0BD112E0A6DED46BC76217E667E61B022B9E13236EA5FE44AF139A63B81 |
Key |
Value |
MD5 | BAF5CDC9C0495A73796E09F90214143A |
PackageArch | x86_64 |
PackageDescription | primesieve is a program that generates primes using a highly optimized
sieve of Eratosthenes implementation. primesieve can generate primes
and prime k-tuplets up to 2^64. |
PackageMaintainer | Fedora Project |
PackageName | primesieve |
PackageRelease | 2.fc32 |
PackageVersion | 7.5 |
SHA-1 | E4002493F35D501AF941235A7FBF700D16C793C5 |
SHA-256 | E9F278797E2F5BCB752E077A75712CEFEC61FAAAD01FBC3431B8D86F5C22252F |
Key |
Value |
MD5 | CC3F2CA45753EF5EA1E1688B81A7760E |
PackageArch | x86_64 |
PackageDescription | primesieve is a command-line program that generates primes using the
sieve of Eratosthenes algorithm. It can generate primes and prime
k-tuplets (twin primes, prime triplets, ...) up to 2^64 and find the
nth prime. |
PackageName | primesieve |
PackageRelease | 35.22 |
PackageVersion | 7.5 |
SHA-1 | 1EF9D4BA0740A9781CE86FDBB5FF2227981719F8 |
SHA-256 | 780C6997D41B73617338A736C153C8049EC590D17599D3ECA1D99424EC7F2009 |
Key |
Value |
MD5 | 036C0B2A9F1952CD3A7B0F936CC1511A |
PackageArch | x86_64 |
PackageDescription | primesieve is a free software program and C/C++ library that generates primes
using a highly optimized sieve of Eratosthenes implementation. It counts the
primes below 10^10 in just 0.45 seconds on an Intel Core i7-6700 CPU (4 x
3.4GHz). primesieve can generate primes and prime k-tuplets up to 2^64. |
PackageMaintainer | joequant <joequant> |
PackageName | primesieve |
PackageRelease | 3.mga8 |
PackageVersion | 7.5 |
SHA-1 | 4157C321913A9416D2946B8FEF52FC22E564D9C8 |
SHA-256 | 3E4F33D06E20DD475D382188BE1CE6BC18D24D0F297FA75C9BD8C3E94A296C86 |