Hashes can sometimes be cached, if there is more than enough home in the info construction where the key is saved; caching the results of comparisons (a binary operation) is frequently impractical. Conversely, comparisons can reward from shortcutting: if keys generally differ within the 1st handful of bytes, a destructive comparison can be very qui