According to Quanta, the paper demonstrates that for Krapivin's hash table method, the time required for worst-case queries and insertions is proportional to (log x)2, which is much faster than ...

Making fast hash tables in programming, which don't cause collision trouble, is one of computing's holy grails. Facebook thinks it's created a good one.