Finally uploaded "Adaptive Hashing: Faster Hash Functions with Fewer Collisions" to arXiv for better visibility:

https://arxiv.org/abs/2602.05925

I’ve polished the presentation, fixed typos, and moved to a more readable format than the original ACM version. #HashTables #DataStructures #CommonLisp

2026-01-01_hashmap-merge.md

GitHub Gist: instantly share code, notes, and snippets.

Gist
🎩 Oh, the riveting world of hash tables, where "cute" and "power-of-two" collide in an epic saga of nerdy delight! 🌈 Meanwhile, mere mortals feign interest as they scroll past yet another "smorgasbord" of bits and bytes in search of the meaning of life—or at least a cat meme. 🐱
https://www.corsix.org/content/my-favourite-small-hash-table #hashTables #nerdCulture #techHumor #programmingLife #catMemes #epicSaga #HackerNews #ngated
My favourite small hash table

Hashed sorting is typically faster than hash tables

Benchmarks and theoretical explanation of why and when hashed radix sort beats hash tables.

Reiner’s webpage and articles.
#Undergraduate Disproves 40-Year-Old Conjecture, Invents New Kind of #HashTable
A young computer scientist and two colleagues show that searches within data structures called #hashtables can be much faster than previously deemed possible.
https://www.wired.com/story/undergraduate-upends-a-40-year-old-data-science-conjecture/
https://archive.ph/2Tl3q
Undergraduate Disproves 40-Year-Old Conjecture, Invents New Kind of Hash Table

A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

WIRED
🚀🚀 Behold, the groundbreaking #rediscovery of Fibonacci Hashing! 🌟 So revolutionary, even the author admits they hadn’t heard of it before—despite being a hash table "expert." 🤔 Who knew that integer modulo had a long-lost cousin everyone ignored? 😂
https://probablydance.com/2018/06/16/fibonacci-hashing-the-optimization-that-the-world-forgot-or-a-better-alternative-to-integer-modulo/ #FibonacciHashing #HashTables #IntegerModulo #TechNews #HackerNews #ngated
Fibonacci Hashing: The Optimization that the World Forgot (or: a Better Alternative to Integer Modulo)

I recently posted a blog post about a new hash table, and whenever I do something like that, I learn at least one new thing from my comments. In my last comment section Rich Geldreich talks about h…

Probably Dance
Undergraduate Upends a 40-Year-Old Data Science Conjecture | Quanta Magazine

A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

Quanta Magazine
Undergraduate Upends a 40-Year-Old Data Science Conjecture | Quanta Magazine

A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

Quanta Magazine

Amazing.

"[I]n the midst of his tinkering, Krapivin realized that he had invented a new kind of hash table, one that worked faster than expected — taking less time and fewer steps to find specific elements. [...] “You didn’t just come up with a cool hash table,” [Kuszmaul] remembers telling Krapivin. “You’ve actually completely wiped out a 40-year-old conjecture!”"

https://www.quantamagazine.org/undergraduate-upends-a-40-year-old-data-science-conjecture-20250210/

#Mathematics #HashTables

Undergraduate Upends a 40-Year-Old Data Science Conjecture | Quanta Magazine

A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

Quanta Magazine
Guile Scheme SRFI-125 packaging attempt

Guile Scheme SRFI-125 packaging attempt. GitHub Gist: instantly share code, notes, and snippets.

Gist