Hashes can sometimes be cached, if there is sufficient space in the data framework where the key is stored; caching the results of comparisons (a binary operation) is frequently impractical. Then again, comparisons can profit from shortcutting: if keys frequently differ within the initial few bytes, a negative comparison can be very quick.Are you p