PolyXOR takes 128-bit hash speed crown; new work shows adversarial collisions in fast hashes
thomasahle · x · 2026-09-29
Thomas Ahle (Normal Computing) published "Adversarial examples for fast hash functions" as Orson Peters' PolyXOR takes the #1 128-bit spot. Key points:
- Passing statistical tests doesn't bound collisions on attacker-chosen inputs, even with a secret seed.
- Fast hashes like xxHash (60 GB/s) and komihash trade adversarial robustness for speed.
- The post formalizes b-bit universality (collision prob ≤ L·2^-b) and explores the fastest provably universal hash.
- Claude Fable was used to analyze a broad set of SMhasher hashes; code and data are public.
More from Research
- LLMs Learn Verb Meanings via Syntax, Not Co-occurrence, Study Finds — neuranna · 2026-09-29
- AgentDynEx: Nudging Mechanics and Dynamics of Multi-Agent Simulations at HCOMP 2026 — windx0303 · 2026-09-29
- Creative Writing Benchmark update: 56 models, 102,592 judgments, Opus 5.5 near top — zero0_one1 · 2026-09-29
- Light Field Primitives: differentiable primitives replace dense ray databases for real-time novel view synthesis — zhenjun_zhao · 2026-09-29
- VkVIO: First cross-platform GPU-accelerated VIO using vendor-agnostic Vulkan — zhenjun_zhao · 2026-09-29
- TrackEverything: 3D de-duplication breaks long-horizon dense point tracking trade-off — zhenjun_zhao · 2026-09-29