Is the lonely runner a proxy for the overloaded server in a load balancer using consistent hashing?
Or are the pictures just similar?
Or are the pictures just similar?
You don't have any smooth movement in consistent hashing. And you can pick your inputs carefully, instead of worrying about the worst case like in the linked conjecture.
Btw, you might like https://en.wikipedia.org/wiki/Rendezvous_hashing