Hashes can sometimes be cached, if there is plenty of area in the information construction where The real key is stored; caching the result of comparisons (a binary operation) is often impractical. Conversely, comparisons can advantage from shortcutting: if keys generally differ within the first number of bytes, a destructive comparison can be quit