https://hackerpaper.kaipfister.de/p/2502.15539/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=43284484urn:hackerpapers:mention:2502.15539:43284484Thu, 06 Mar 2025 19:58:15 GMT<p>For Java, C++, and Rust there is also https://sux.di.unimi.it/ maintained by Sebastiano Vigna, a professor from Italy. Together with his student (I also helped a bit), he wrote a paper about RecSplit, a minimal perfect hash function (MPHF) algorithm I have invented: https://arxiv.org/abs/1910.06416 - that algorithm uses around 1.56 bits per key. But it is quite slow. In January 2020 I presented the paper at a conference, that was right before the pandemic. The algorithm with the least memory usage (and much faster as well) is now Consensus-RecSplit: https://arxiv.org/abs/2502.05613 - it can…</p><p><a href="https://hackerpaper.kaipfister.de/p/2502.15539/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS