| Key | Value |
|---|---|
| FileName | ./usr/lib/mipsel-linux-gnu/libtommath.so.1.1.0 |
| FileSize | 104884 |
| MD5 | D5DBB291CDB907BD46E680DEA6A60CFF |
| SHA-1 | 08A9F75A04487B6AA1BF647CD2CCB1E182BA061F |
| SHA-256 | 3B5C206F6E0B283530F484D128C54B6DD2699436EC804696A2183B829B3E9536 |
| SSDEEP | 3072:S+dheEkpU8Lb9ZvHhbxGLELVyhIhS4qHutvYn3HXn8/B+Oeu+MOCzUsLsuoQqC9c:fdheEkpjb9ZvHhbxGLELVyhIhS4U8vYj |
| TLSH | T1FEA3F852AF182FA3DAD7CC300D7D93E258ADEC0F02D6E60AB0BC8D5A7E516145A974C7 |
| 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 | 55652 |
| MD5 | 64839FCD32838BE6D7FBE5EE93C1793D |
| 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.1.0-3 |
| SHA-1 | 5358F6F1AEAFAD41FD427B67444204E5B35D5A30 |
| SHA-256 | D6DCE4F79CBB4C0A4725716FE446548A656B590C4F3E9EA630634BA7EEA849A4 |