/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 orlp.net
The World's Smallest Hash Table | orlp.net
| | danlark.org
Optimizing 128-bit Division - Experimental chill
2.7 parsecs away

Travel
| | When it comes to hashing, sometimes 64 bit is not enough, for example, because of birthday paradox -- the hacker can iterate through random $latex 2^{32}$ entities and it can be proven that with some constant probability they will find a collision, i.e. two different objects will have the same hash. $latex 2^{32}$ is around...
| | ticki.github.io
Designing a good non-cryptographic hash function ยท
2.6 parsecs away

Travel
| | These are my thoughts on designing fast, high-quality non-cryptographic hash functions.
| | randorithms.com
Minimal perfect hash functions - Randorithms
1.9 parsecs away

Travel
| | If you want to observe a hash function in the wild, all you need to do is look under the hood of the nearest key-value store. Hashing is a fundamentally simp...
| | gcc.godbolt.org
Compiler Explorer
18.8 parsecs away

Travel
| int main() { return std::move(0); }