A Fast, Minimal Memory, Consistent Hash Algorithm · HackerPapers discussions

A Fast, Minimal Memory, Consistent Hash Algorithm — mentioned by cyberpunk

Fri, 18 Sep 2026 20:49:41 GMT

Anyone have an idea how it behaves differently from google's jump hash algorithm? The cool thing about google's one is it's so short I can include it in a HN comment: int32_t JumpConsistentHash(uint64_t key, int32_t num_buckets) { int64_t b = 1, j = 0; while (j < num_buckets) { b = j; key = key * 2862933555777941757ULL + 1; j = (b + 1) * (double(1LL << 31) / double((key >> 33) + 1)); } return b; } https://arxiv.org/pdf/1406.2294

Paper and discussion history. A mention is not an endorsement.

A Fast, Minimal Memory, Consistent Hash Algorithm — mentioned by T0pH4t

Mon, 20 May 2024 14:18:44 GMT

There is also jump consistent hashing https://arxiv.org/pdf/1406.2294

Paper and discussion history. A mention is not an endorsement.

A Fast, Minimal Memory, Consistent Hash Algorithm — mentioned by pixelpoet

Sun, 13 Mar 2022 23:38:44 GMT

Worth noting that this library is by the extraordinary genius Eric Veach, whose PhD thesis marked the beginning of modern rendering, besides also developing the core of Google's AdSense, and co-inventing jump consistent hash: https://arxiv.org/abs/1406.2294

Paper and discussion history. A mention is not an endorsement.

A Fast, Minimal Memory, Consistent Hash Algorithm — mentioned by orasis

Thu, 28 Oct 2021 17:39:45 GMT

I hadn’t heard of the “Jump Consistent Hashing” algorithm that this article uses. The original paper is much more informative than the article: https://arxiv.org/abs/1406.2294

Paper and discussion history. A mention is not an endorsement.

A Fast, Minimal Memory, Consistent Hash Algorithm — HN submission

Sat, 23 Mar 2019 11:41:59 GMT

A Fast, Minimal Memory, Consistent Hash Algorithm (2014)

46 points; 5 discussion replies on HN. Paper and source history. A submission is not an endorsement.

A Fast, Minimal Memory, Consistent Hash Algorithm — mentioned by alexgartrell

Tue, 27 Jun 2017 00:43:47 GMT

You're kind of right. You can also use something like jump consistent hash [0] which only requires you to have a consistent ordering of the hosts where you're sending the information. We (Facebook) use something similar for our caches. It requires a linear array of hosts but you've already got that if you're load balancing. [0] https://arxiv.org/abs/1406.2294

Paper and discussion history. A mention is not an endorsement.

A Fast, Minimal Memory, Consistent Hash Algorithm — HN submission

Thu, 19 Mar 2015 08:41:42 GMT

A Fast, Minimal Memory, Consistent Hash Algorithm [pdf]

31 points; 4 discussion replies on HN. Paper and source history. A submission is not an endorsement.

A Fast, Minimal Memory, Consistent Hash Algorithm — HN submission

Sun, 15 Mar 2015 20:37:02 GMT

A Fast, Minimal Memory, Consistent Hash Algorithm

129 points; 26 discussion replies on HN. Paper and source history. A submission is not an endorsement.

A Fast, Minimal Memory, Consistent Hash Algorithm — HN submission

Tue, 05 Aug 2014 11:46:41 GMT

A Fast, Minimal Memory, Consistent Hash Algorithm

121 points; 22 discussion replies on HN. Paper and source history. A submission is not an endorsement.