NHacker Next
  • new
  • past
  • show
  • ask
  • show
  • jobs
  • submit
▲Collisions in Hash Functions (collisions.zksecurity.xyz)
rurban 8 minutes ago [-]
In smhasher I'll add a CollisionProver soon, which reverses each hash and runs it through a solver for a couple of minutes to find the likelyness of collisions automatically. Which is relevant if you use them for only a couple of bits in a hash table.
Heathcorp 4 hours ago [-]
This website is ridiculous.
SV_BubbleTime 3 hours ago [-]
Claude Design you think?
davesque 3 hours ago [-]
Seems likely. Lot of web design looking like this with this font suggests LLM assisted design to me.
userbinator 2 hours ago [-]
[dead]
cmgriffing 2 hours ago [-]
One of my favorite niches for hashing is in a/b testing where you expect and want collisions, particularly in a deterministic way.
Dylan16807 3 hours ago [-]
So "pinning" a byte just makes it get listed on one random line? And it doesn't show anything about how the collision happens in the rounds, it's just the two inputs rendered in ~ultra fancy wobble vision~ and the final hash?
what 2 hours ago [-]
Yes. And most of the examples don’t actually collide. They just have the same intermediate result at some point in the hashing process, but the final hash is different.
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact
Rendered at 06:25:50 GMT+0000 (Coordinated Universal Time) with Vercel.