Hashes can sometimes be cached, if there is enough room in the data framework where the key is saved; caching the result of comparisons (a binary operation) is commonly impractical. Then again, comparisons can benefit from shortcutting: if keys frequently vary within the main couple bytes, a detrimental comparison can be quite quick.Do you think yo