[tylerchr]

I undertook a similar endeavor a while back. My solution[1] rested on the observation that you don’t need to have a B-tree to do a binary search; one need only be able to calculate the correct byte offset of the Nth hash. With some optimizations, this approach produced a 9.9GB file with similarly fast lookups.

[1]: https://github.com/tylerchr/pwnedpass/blob/master/README.md#...

[fwip]

It looks like the link to your blog post is broken (at the bottom of the README).

[tylerchr]

Awkward! Thanks for the tip. I added a copy of that post to the repo and fixed the link.