Hashes can sometimes be cached, if there is enough place in the info framework where the key is stored; caching the results of comparisons (a binary operation) is often impractical. However, comparisons can reward from shortcutting: if keys normally differ within the primary several bytes, a destructive comparison can be very fast."Dreams" – an i