Consistent hashing in Go

Consistent hashing is a special kind of hashing such that when a hash table is resized and consistent hashing is used, only K/n keys need to be remapped on average, where K is the number of keys, and n is the number of slots. Source: https://en.wikipedia.org/wiki/Consistent_hashing

Blogs:

• https://medium.com/@sent0hil/consistent-hashing-a-guide-go-implementation-fe3421ac3e8f
• https://dev.to/kevwan/consistent-hash-in-go-3aob