Claude Found Seed-indpendent collisions in most popular hash functions | Hacker News - But Better

Claude Found Seed-indpendent collisions in most popular hash functions thomasahle.com

How often do chosen inputs collide? Reproducible examples, machine-checked collision bounds, and the speed of fast hash functions.

6 points•thomasahle•11 days ago•0 comments•

#hash #functions #hash functions #seed #claude #indpendent #popular #collisions

0 comments

No comments yet.

Related stories

Lobsters Interview with Susam
Lobsters · 86 points · about 1 year ago
Does this mean it's fine to use Claude subscriptions with third party harnesses?
Hacker News · 4 points · 13 days ago
Adversarial examples for fast hash functionsthomasahle.com
Hacker News · 1 points · 10 days ago
Adversarial examples for fast hash functionsthomasahle.com
Lobsters · 9 points · 10 days ago
Getting the most out of Opus 5.5 in Claude and Claude Code / claude.devclaude.dev
Hacker News · 2 points · 7 days ago
Show HN: use-citations – Claude Code skill for citation backed answersgithub.com
Hacker News · 1 points · 8 days ago