| Key | Value |
|---|---|
| FileName | ./usr/lib/mips64el-linux-gnuabi64/libtommath.so.1.2.0 |
| FileSize | 132960 |
| MD5 | 11B79C32C3451751E5BD939321EF6665 |
| SHA-1 | 6618C5D547467939631AAC9152513DF459FA621B |
| SHA-256 | 335B8F9C392AE018C2CAC7A617C50EEBAA918282EA807839962F48B4317F1423 |
| SSDEEP | 1536:KVJczNseQgYecIr3NjUEUqyOShhw3QNH8W1sZ1b3XCpSNeTZMvH7UVkh3XsC2k71:McyzrJ11Ab3HcVM9pcC2oQgq |
| TLSH | T1EAD3E7D6FB489E57E4D3CF30883693B7076CAC6352518627BA5C1E553E8F6460F8288B |
| hashlookup:parent-total | 1 |
| hashlookup:trust | 55 |
The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 65976 |
| MD5 | F150A6FFA5BD049C0240CDA7FCBA6C14 |
| PackageDescription | multiple-precision integer library [runtime] LibTomMath is a C language library that provides a vast array of highly optimized functions for number theory; including: . * Simple Algebra (Addition, Subtraction, Multiplication, Division) * Digit Manipulation (shift, binary AND/OR/XOR) * Modular Reduction (Barrett, Montgomery, DR, 2k) * Number Theory - Greatest Common Divisor - Least Common Multiple - Jacobi Symbol Computation - Multiplicative Inverse - Modular Exponentiation - Fermat & Miller-Rabin Primality Tests * Miscellaneous - Root finding over Z - Pseudo-random integers - Signed & Unsigned comparisons - Karatsuba and Toom-Cook multiplication algorithms - Fast Comba based Multiplier, Squaring and Montgomery routines . This package contains the library needed to run programs that use LibTomMath. |
| PackageMaintainer | Debian Rakudo Maintainers <pkg-rakudo-devel@lists.alioth.debian.org> |
| PackageName | libtommath1 |
| PackageSection | libs |
| PackageVersion | 1.2.0-6 |
| SHA-1 | 953333B5C9CC071FA06B208207BB0DA330C32486 |
| SHA-256 | D8149A1051CFBB851DFA6AB5D56121044C484EC111444EB4AEF23B7E2E12ABE5 |