alternative, improved implementation of fingerprinting-based MPHF in Rust

[beling]

Hello,

I just wanted to let you know that I am both developing an alternative, open-source (MIT, Apache 2) implementation of the same algorithm as boomphf uses, and doing research leading to its improvement (I managed to reduce the size to 2.1 bits/key, for example). My implementation is available here:
https://github.com/beling/bsuccinct-rs
https://docs.rs/ph/latest/ph/

I have previously announced this on the quite popular Reddit /r/rust and published a research paper in the ACM Journal of Experimental Algorithmics, but just in case, I decided to write here as well.
My paper includes benchmarks (performed with my mphf_benchmark program) that also take into account boomphf.

I hope you will find this information useful and maybe it will lead to some collaboration in the future.

Best regards
Piotr Beling