Hashes can sometimes be cached, if there is ample place in the data composition where The main element is stored; caching the result of comparisons (a binary operation) is frequently impractical. Conversely, comparisons can gain from shortcutting: if keys typically differ within the initial number of bytes, a damaging comparison can be very rapidly