consistent hashing

Modulo is a math operation that finds the remainder when one integer is divided by another. In writing, it is frequently abbreviated as mod, or represented by the symbol %. Examples 11 mod 4 = 3, because 11 divides by 4 (twice), with 3 remaining. 25 mod 5 = 0, because 25 divides by 5 (five times), with 0 remaining. 3 mod 2 = 1, because 3 divides by 2 (once), with 1 remaining. 5 mod 2 = 1, because all odd numbers yield a remainder of 1 when divided by 2.

Virtual Nodes?