Alexandria Library

A curated collection of awesome articles

Here are some ressources related to Hashing, Bloom filter, Games. Hoping you will find learning material, alternative tools or just some interesting stuff.

Home > Programming, Machine Learning, Quan... > Cryptography, Algorithms, Programmi... > Cryptography, Hashing, Security, Bl... > Hashing, Bloom filter, Games

Articles

Fibonacci Hashing: An optimization that the world forgot (2018)
See discussion (63 comments, 204 points) - Archive
The Smallest Hash Table
See discussion (39 comments, 192 points) - Archive
Simple, Fast, and Scalable Reverse Image Search
See discussion (31 comments, 129 points) - Archive
Vectors are over, hashes are the future
See discussion (38 comments, 172 points) - Archive
Bloom Filters: More than a space-efficient hashmap
See discussion (53 comments, 173 points) - Archive
Show HN: 128-bit, roughly-ordered, URL-safe UUIDs
See discussion (137 comments, 205 points) - Archive
How Rainbow Tables Work
See discussion (28 comments, 124 points) - Archive
Sattolo's Algorithm (2017)
See discussion (20 comments, 100 points) - Archive
Bloom filters debunked: Dispelling 30 Years of bad math with Coq
See discussion (126 comments, 472 points) - Archive
When Bloom filters don't bloom
See discussion (73 comments, 227 points) - Archive
Fast Perfect Hashing
See discussion (41 comments, 138 points) - Archive
Use perfect hashing, instead of binary search, for keyword lookup
See discussion (111 comments, 328 points) - Archive
String Matching Based on Compile Time Perfect Hashing in Zig
See discussion (4 comments, 84 points) - Archive
Fletcher's Checksum
See discussion (11 comments, 87 points) - Archive
Prospecting for Hash Functions
See discussion (14 comments, 116 points) - Archive
Fibonacci Hashing: The Optimization That the World Forgot
See discussion (75 comments, 405 points) - Archive
Mapping the internet with Hilbert curves
See discussion (29 comments, 218 points) - Archive
Why Is It Taking 20 Minutes to Mine This Bitcoin Block?
See discussion (113 comments, 258 points) - Archive
Optimizing hash tables: hiding the hash code
See discussion (70 comments, 130 points) - Archive
Show HN: How to store a set of four 5-bit values in one 16-bit value
See discussion (140 comments, 188 points) - Archive
Show HN: HyperLogLog intersections
See discussion (16 comments, 88 points) - Archive
Bloom Filters for the Perplexed
See discussion (45 comments, 259 points) - Archive
Brief Introduction To General Purpose Hash Functions
See discussion (22 comments, 97 points) - Archive
Robin Hood Hashing should be the default hash table implementation (2013)
See discussion (53 comments, 220 points) - Archive
Perfect Hashes and faster than memcmp
See discussion (18 comments, 86 points) - Archive
A Fast, Minimal Memory, Consistent Hash Algorithm
See discussion (26 comments, 129 points) - Archive
Improving Redis CRC performance
See discussion (38 comments, 112 points) - Archive
Invertible Bloom Lookup Tables (2011)
See discussion (24 comments, 92 points) - Archive
Perceptual Image Hashing
See discussion (34 comments, 104 points) - Archive
A Fast, Minimal Memory, Consistent Hash Algorithm
See discussion (22 comments, 121 points) - Archive
Why Bloom filters work the way they do (2012)
See discussion (6 comments, 99 points) - Archive
1MB Sorting Explained
See discussion (8 comments, 96 points) - Archive
Why Bloom filters work the way they do
See discussion (7 comments, 95 points) - Archive
Damn Cool Algorithms: Fountain Codes
See discussion (62 comments, 306 points) - Archive
Smaller than Bloom filters
See discussion (16 comments, 119 points) - Archive
Scrambling eggs for Spotify with Knuth's Fibonacci hashing
See discussion (51 comments, 151 points) - Archive
A visual interactive guide to Bloom filters
See discussion (54 comments, 286 points) - Archive
Binary vector search is better than FP32 vectors
See discussion (29 comments, 137 points) - Archive
The simple beauty of XOR floating point compression
See discussion (68 comments, 282 points) - Archive
Automated integer hash function discovery
See discussion (42 comments, 272 points) - Archive
Exact binary vector search for RAG in 100 lines of Julia
See discussion (23 comments, 180 points) - Archive
vu128: Efficient variable-length integers
See discussion (33 comments, 93 points) - Archive
Show HN: B-field, a novel probabilistic key-value data structure (`rust-bfield`)
See discussion (36 comments, 153 points) - Archive
Overflow in consistent hashing (2018)
See discussion (15 comments, 81 points) - Archive