Hashes can sometimes be cached, if there is enough area in the information composition where The real key is stored; caching the result of comparisons (a binary operation) is frequently impractical. Then again, comparisons can benefit from shortcutting: if keys normally differ within the first number of bytes, a damaging comparison can be very fast… Read More