Hashes can sometimes be cached, if there is enough space in the data composition where The important thing is saved; caching the results of comparisons (a binary operation) is commonly impractical. On the flip side, comparisons can gain from shortcutting: if keys typically vary within the 1st couple of bytes, a unfavorable comparison can be extreme