Hashes can sometimes be cached, if there is ample space in the information construction where The important thing is stored; caching the result of comparisons (a binary operation) is frequently impractical. Then again, comparisons can benefit from shortcutting: if keys usually differ within the first number of bytes, a destructive comparison can be