If I’m not mistaken, this is more generalizable as Silly HashMap Algorithm Idea, which is probably a worthy pursuit. The idea is to find the minimal meaningful key with the highest likelihood of resolving to the correct value. Compression is meaningless to the former but valuable for the latter.