Hashes can sometimes be cached, if there is adequate place in the information composition where the key is saved; caching the result of comparisons (a binary operation) is often impractical. Then again, comparisons can profit from shortcutting: if keys normally differ within the initial couple bytes, a unfavorable comparison can be extremely rapidl