Hashes can sometimes be cached, if there is plenty of space in the data composition where The crucial element is stored; caching the result of comparisons (a binary operation) is commonly impractical. However, comparisons can reward from shortcutting: if keys frequently vary within the first handful of bytes, a negative comparison can be extremely