In the immortal words of a cryptographic folk hero, if H(x, y) produces a good random number, H(x, y, z) will produce a number at least as good.
Perhaps you missed where I mentioned a constant "budget of bits." Your second h(x,y,z) is implicitly using more bits in the calculation, rather than "sharing" with x.
In other words, these are the two functions that should be compared:
h(content, very_random_bits(32)) h(content, very_random_bits(16) + slightly_random_bits(16))
Perhaps you missed where I mentioned a constant "budget of bits." Your second h(x,y,z) is implicitly using more bits in the calculation, rather than "sharing" with x.
In other words, these are the two functions that should be compared: