Hashes can sometimes be cached, if there is plenty of home in the data framework where The real key is saved; caching the result of comparisons (a binary operation) is often impractical. On the other hand, comparisons can gain from shortcutting: if keys typically vary within the very first several bytes, a damaging comparison can be extremely quick