Apr 3, 2025

Also just made the secondary hash function (used by the sieve), independent of the primary in the case of non-point hashing (so like tx/block hashes and links). That was already complete for point hashing. This primarily advantages the header table, as it has a [[9][23]] bit split for [[sieve][link]], where the sieve is pointless if the hashes are not independent. Also made sure that both hashes stick to the lowest order bytes where possible, to avoid block hash zeros, and overlap minimally when the key space is limited.