NOT KNOWN FACTS ABOUT CBD HASH KOPEN

Hashes can sometimes be cached, if there is ample room in the information structure where the key is stored; caching the result of comparisons (a binary operation) is usually impractical. On the other hand, comparisons can reward from shortcutting: if keys typically differ within the primary several bytes, a destructive comparison can be very fast.