Hashes can sometimes be cached, if there is enough space in the info composition where The real key is saved; caching the result of comparisons (a binary operation) is commonly impractical. On the other hand, comparisons can reward from shortcutting: if keys normally vary within the very first n