News for hackers. Stuff that matters.
Re:Modern Minimal Perfect Hashing: A Survey by tmyklebu on Saturday June 14, 2025 @10:01PM (#44280072)
Yeah, that was just a search.

There are 2^32 multipliers; call them m. For a bit in m*x to be useful, it must be zero for 16 symbols and one for 16 symbols. Call those bits "useful bits." Try every multiplier; for each multiplier, compute all the useful bits (usually not many) and try all masks with 5 useful bits.

Re:Modern Minimal Perfect Hashing: A Survey by mananaysiempre on Monday June 16, 2025 @04:56AM (#44287733)
> For a bit in m*x to be useful, it must be zero for 16 symbols and one for 16 symbols.

Ahh brilliant, thanks!