Hashes can sometimes be cached, if there is sufficient place in the data structure where the key is stored; caching the result of comparisons (a binary operation) is usually impractical. Conversely, comparisons can profit from shortcutting: if keys normally differ within the 1st number of bytes,