Loading...

Tag trends are in beta. Feedback? Thoughts? Email me at [email protected]

Hashed sorting is typically faster than hash tables

How I Built a Hash Join 2x Faster Than DuckDB with 400 Lines of Code

my first blog post: building a simple hash map

Commit hash pinning in GitHub Actions: secure, but at a cost

rapidhash: a new fastest, portable, general-purpose hash function

Fastest hash for lookups, released

p-fast trie: lexically ordered hash map

Bypass PostgreSQL catalog overhead with direct partition hash calculations

An easy-to-implement, arena-friendly hash map

python_sri - A Subresource Integrity hash generator

derive_hash_fast: Over 2x faster hashing than #[derive(Hash)]

SIMD within a register: How I doubled hash table lookup performance

Nine consecutive 1s in SHA-256 hash

Efficiency of a sparse hash table

Hash table resizing is slow (O(n)), so I ran an experiment to see if it's a bigger problem than hash

Faster Hash Tables

Proof-of-History Timestamping In Rust Using Various Hash Functions

The probability of a hash collision (2022)

comphash - A very lightweight Zig package offering a zero-cost compile-time hash map

New Moderate Linux Flaw Allows Password Hash Theft Via Core Dumps in Ubuntu, RHEL, Fedora

Cache Conscious Hash Maps

New high-quality hash measures 71GB/s on M4

Need a simple hash function

Functional hash tables explained

What a Difference a Faster Hash Makes

Pippip_AES_Tri_XZ: Fastest Hash for Latin Wordlists with Top Dispersion

A5HASH 5.16: 128-bit hash version update: now much faster than rapidhash and wyhash on Zen5 (48GB/s) and Apple Silicon (32GB/s)

How can I get the integer ID from std.hash.autoHash for a string?

Why hash tables are so fast (Explained with visuals and GIFs)

Consistent Hash Ring

More →