Highest Random Weight in Elixir
The article discusses the concept of Highest Random Weight (HRW) hashing in Elixir, highlighting its simplicity and stateless nature compared to traditional consistent hashing methods like ExHashRing. While HRW offers ease of use and avoids state management, it has a performance drawback with larger node lists due to its linear time complexity. The author provides benchmarks and comparisons between HRW and ExHashRing, noting that for smaller node counts, the performance difference is minimal.
- ▪HRW hashing is simpler and stateless compared to consistent hashing methods like ExHashRing.
- ▪ExHashRing is faster and more efficient with larger node counts, while HRW performs better with fewer nodes.
- ▪The basic HRW implementation uses a scoring function to determine the highest value for node assignment.
2 outlets in our directory ran this story, first to last over 19 hours. All of the coverage we found sits in one bucket: centre. That one-sidedness is itself worth noticing.
- ▪ Highest random weight in Elixir — Reddit
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | jola.dev |
| Canonical URL | https://jola.dev/posts/highest-random-weight-in-elixir |
| Publication time | Fri, 22 May 2026 09:27:23 +0000 |
| Retrieval time | 2026-05-22T09:32:01.321Z |
| Last seen | 2026-05-22T09:32:01.321Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | ps6CTweeXym7 · 2 stories |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Highest Random Weight in Elixir May 21, 2026 15 min read elixir hrw oss Consistent hashing is a common building block for distributed Elixir and enables fairly low complexity and high value design patterns, like the distributed rate limiter or cache. I’ve written about it before. The most common way of assigning keys to nodes, ensuring that any node participating in the cluster can figure out which node owns the given key, is Discord’s ExHashRing. This is an incredibly battle-tested and reliable library with excellent performance characteristics, and I’ve only had good experiences with it. That said, it does have a downside. You have to start and manage the ring processes.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at jola.dev.
Discussion
0 commentsMore from jola.dev
