I only recently learned about rendezvous hashing, an alternative to consistent hashing, and I ended up doing a little deep dive and then I wrote a small library for Elixir. For node counts <20 it performs as well as ExHashRing on my machine, although a bit slower if you want to sort and deduplicate the node list.
The library contains a few variations on the classic algorithm, including weighted nodes, and a skeleton data structure that brings the complexity to O(log n), plus a version where you can control distribution if you know all the keys up front.
