Hashes can sometimes be cached, if there is ample area in the info construction where the key is stored; caching the result of comparisons (a binary operation) is usually impractical. Alternatively, comparisons can benefit from shortcutting: if keys frequently differ within the first couple bytes, a destructive comparison can be extremely rapidly.R