https://hackerpaper.kaipfister.de/p/2104.10402/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=40446321urn:hackerpapers:mention:2104.10402:40446321Wed, 22 May 2024 20:47:49 GMT<p>Very interesting and I&#x27;ll have to read more to understand how it fully works, but _initially_ the space requirements doesn&#x27;t seem too impressive? Am I missing something here? Is my calculation/assumption completely off? Maybe the solution here is more flexible? One alternative approach for many of these problems is to start with a perfect minimal hash function which hashes your key into a unique number [0, N) and then have a packed array of size N where each element is of a fixed byte size. To look up the value you first use the hash function to get an index, and then you look up in the…</p><p><a href="https://hackerpaper.kaipfister.de/p/2104.10402/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS