Hashes can sometimes be cached, if there is enough place in the information composition where the key is saved; caching the result of comparisons (a binary operation) is usually impractical. Alternatively, comparisons can reward from shortcutting: if keys generally differ within the main number of bytes, a unfavorable comparison can be very fast.Th