Collision Atlas

Two inputs.
One digest.

A hash function turns any input into a short fingerprint. No two inputs should get the same one. Here are 123 pairs that do, and you can run every one.

When a hash gets broken, you usually hear a claim and a number like 263. That's hard to check. A collision is easy: hash both inputs and look.

15 pairs break full hash functions, including MD5 and SHA-1. The other 108 use weakened or modified versions. The SHA-256 and SHA-3 examples do not break the full hashes.

  • Moveread bytes
  • Clickpin a byte
  • Holdpull the pair apart
  • Dragturn it
  • Releaselet them collide
  • Tappin a byte
  • Press and dragpull the pair apart
Both hash to this · ABsame in both
Inputs
Bytes that differ
Bits flipped

Credit

Credit and notes

Credit

Source