Adversarial examples for fast hash functions
Summary
Thomas Ahle surveys adversarial inputs to fast hash functions, comparing provable (universal) guarantees with heuristic approaches and detailing common multicollision patterns. The piece highlights security implications for hash-based data structures and DoS resistance, includes references to Lean proofs and verified results, and suggests directions for further research and discussion with hash maintainers.