Hello,

I’ve red the article “Cuckoo Cycle: a memory bound graph-theoretic proof-of-work” but haven’t understand sentence:“The number of trimming rounds, which can be set with option -n, defaults to 1+(B+3)*(B+4)=2, which was determined empirically to achieve a load close to 50%.”

I think that it’s possible to estimate number of trimming rounds to achieve a (some) load using binomial distribution. And it should be more precious than empirically data.

Or may be I don’t understand something?