Hashes can sometimes be cached, if there is adequate home in the information framework where the key is stored; caching the result of comparisons (a binary operation) is frequently impractical. Alternatively, comparisons can gain from shortcutting: if keys normally vary within the first couple bytes, a damaging comparison can be quite speedy.hashma