E-Ink News Daily

Back to list

Adversarial examples for fast hash functions

Research using Claude Fable analyzed popular fast hash functions and found that most have adversarial inputs causing performance at least 20 bits below theoretical expectations. Some published collision proofs were found to contain errors, while others were formally verified in Lean, highlighting real-world security risks from hash collisions.

Background

Fast non-cryptographic hash functions like xxHash, HighwayHash, and aHash are widely used in production for hash tables and data integrity, but they often lack rigorous collision resistance guarantees compared to cryptographic hashes.

Source
Lobsters
Published
Sep 21, 2026 at 03:14 AM
Score
7.0 / 10