For the tables that have a sha hash (or a point .... hash:index) as the natural key (search key), the hashmap's hash function doesn't do math on the sha hash, it just takes the low order bytes from the sha hash in the length it requires. all that is necessary for a hashmap hash function is evenness, and sha satisfies this, apart from high order bytes in header hashes.