Consistent hashing collisions?

Question

Probably an implementation detail of consistent hashing, IIUC, under ideal conditions, with N servers and K hash functions, we could expect to see NK evenly distributed nodes on the hash ring.

but what if the hash of my servers collide with each other?

ignore them? probably won't work? in the extreme case, all K hashes of my server could be overshadowed by others?
some sort of collision resolution? with my limited hashtable knowledge, it has to be some kind of OpenAddressing?

Consider rendezvous hashing instead: en.wikipedia.org/wiki/Rendezvous_hashing — Matt Timmermans
– Matt Timmermans, Commented Nov 13, 2021 at 2:46
thanks! looks like rendez vous hashing has no collision, huh? Although it's a bit off topic, I am seeking more insights into the consistent hashing implementation — watashiSHUN
– watashiSHUN, Commented Nov 14, 2021 at 3:03

Zack Light · Accepted Answer · 2024-08-19 05:07:42Z

0

If you use SHA-256 as the hashing function, the probability of getting hash collision is too small (less than the number of atoms in the universe) to actually give you a collision in practice.

answered Aug 19, 2024 at 5:07

Zack Light

3624 silver badges12 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Consistent hashing collisions?

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related