Claude Fable Breaks Multiple Fast Hash Functions in a Day
A Normal Computing researcher reported using Claude Fable to break several mainstream fast hash functions in a single day. His blog post argues that passing statistical tests does not guarantee resistance to adversarially chosen inputs.
2026-09-20 ~ 2026-09-20 · 2 related posts
- Claude Fable breaks top SMHasher hash functions in a day, security drops from 64 bits to zero — thomasahle · 2026-09-20
- Adversarial examples for fast hash functions: how Claude Fable broke SMHasher favorites — thomasahle · 2026-09-20