#hash #fingerprint #api-bindings

umash

Idiomatic API for the umash hash/fingerprint function

7 releases (4 breaking)

0.6.1 Jan 19, 2025
0.6.0 Oct 5, 2024
0.5.0 Oct 5, 2024
0.4.1 Oct 10, 2021
0.1.2 May 10, 2021

#480 in Algorithms

Download history 647/week @ 2024-11-16 77/week @ 2024-11-23 269/week @ 2024-11-30 160/week @ 2024-12-07 69/week @ 2024-12-14 50/week @ 2024-12-21 95/week @ 2024-12-28 138/week @ 2025-01-04 154/week @ 2025-01-11 244/week @ 2025-01-18 168/week @ 2025-01-25 494/week @ 2025-02-01 188/week @ 2025-02-08 349/week @ 2025-02-15 181/week @ 2025-02-22 119/week @ 2025-03-01

863 downloads per month
Used in 2 crates

MIT license

26KB
327 lines

umash-rs: a rust API for UMASH

Build Status crates.io

UMASH is a family of fast hash / fingerprinting functions with collision bounds. This crate builds on x86-64 (with CLMUL) and little-endian aarch64 (with VMULL). The UMASH family of functions is defined independently of hardware specific features, so computes the same values on both architecture.

See https://github.com/backtrace-labs/umash for more details.


lib.rs:

UMASH is an almost-universal family of hash functions. Each Params struct defines a specific hash function; when the parameters are generated pseudorandomly, the probability that two different inputs of up to s bytes collide (for an independently generated set of parameters) is at most ceil(s / 4096) 2^-55 for the 64-bit hash. The 128-bit fingerprint reduces that probability to less than 2^-70 for inputs of 1 GB or less.

See the reference repo for more details and proofs.

Dependencies

~155–630KB
~13K SLoC