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