Hashes can sometimes be cached, if there is ample space in the info construction where the key is stored; caching the results of comparisons (a binary operation) is frequently impractical. Conversely, comparisons can gain from shortcutting: if keys generally differ within the very first several