https://curiouscoding.nl/categories/note/Recent content in Note on CuriousCodingHugoenWed, 14 Oct 2026 00:00:00 +0200https://curiouscoding.nl/posts/phastr-and-ptrhash/Wed, 14 Oct 2026 00:00:00 +0200https://curiouscoding.nl/posts/phastr-and-ptrhash/<div class="ox-hugo-toc toc"> <div class="heading">Table of Contents</div> <ul> <li><a href="#bucket-placement" >Bucket placement</a></li> <li><a href="#bumping" >Bumping</a> <ul> <li><a href="#query-speed" >Query speed</a></li> <li><a href="#space-usage" >Space usage</a></li> <li><a href="#construction-speed" >Construction speed</a></li> <li><a href="#overview" >Overview</a></li> </ul> </li> <li><a href="#conclusion" >Conclusion</a></li> <li><a href="#ideas-for-improving-ptrhash" >Ideas for improving PtrHash</a> <ul> <li><a href="#levels" >Levels</a></li> </ul> </li> </ul> </div> <!--endtoc--> <p>Sebastiano Vigna just preprinted <a href="https://github.com/vigna/sux-rs" class="external-link" target="_blank" rel="noopener">PHastR</a> (<a href="#citeproc_bib_item_6">Vigna 2026</a>), a new, faster version of PHast and PHast+ (<a href="#citeproc_bib_item_1">Beling and Sanders 2025</a>, <a href="#citeproc_bib_item_2">n.d.</a>). In the evaluations, it is a direct improvement over PHast+:</p> <ul> <li>slightly smaller,</li> <li>2\(\times\) to \(3\times\) faster to build,</li> <li>faster queries.</li> </ul> <p>This is a quick note comparing the PHast line of work to <a href="https://github.com/RagnarGrootKoerkamp/ptrhash" class="external-link" target="_blank" rel="noopener">PtrHash</a>.</p>