[openmethod] On the unreasonable efficiency of fast_perfect_hash

From: Joaquin M López Muñoz (joaquinlopezmunoz_at_[hidden])
Date: 2025-05-11 19:00:54

Some days ago we discussed the fact that the perfect hashing machinery
of candidate Boost.OpenMethod is apparently at odds with the theoretical
probability of finding a viable function by chance (i.e. using brute force).

I've taken a closer look at this issue and wrote a small article explaining
why Boost.OpenMethod's fast_perfect_hash is so exceptionally
successful:

https://github.com/joaquintides/perfect_range_hash

I hope the analysis is of interest to those puzzling over this.

Joaquin M Lopez Munoz