2 ms·
In fact, I'd argue that the collision rate per image pair is overestimating the collision rate. It's the flip side of the birthday paradox. We don't care that a
by dhosek 5y ago
In fact, I'd argue that the collision rate per image pair is overestimating the collision rate. It's the flip side of the birthday paradox. We don't care that any two images have the same hash, we care about any image having the same hash as one in the set that we're testing against.
- SilasX 5y ago>We don't care that any two images have the same hash, Why not?
- snet0 5y agoBased on the pigeonhole principle alone, it will always be the case that collisions exist. The size of the digest is very likely smaller than the size of any given image.
- SilasX 5y agoHow is that relevant to whether “per image” or “Per image pair” is the right metric? Heck, how is it relevant to anything given that hash functions avoid collisions in practice, even given the pigeonhole principle?