To be clear, my claim of \mathrm{Var}[\frac{k-1}{H_{(k)}}] \approx \frac{n^2}{k-2} is for the case where k is fixed, before the experiment is conducted. I don’t know if it remains when k becomes dependent on the experiment (as is the case in the “use largest-hash block among those beating the lowest target” approach).