Having read the basics of mining and having also readthis about SHA-256:SHA256 (Probabilisticprobabilistic?) partial preimage possible? and http://jheusser.github.io/2013/02/03/satcoin.htmlSAT solving - An alternative to brute force bitcoin mining
, I have the following question:
wouldn'tWouldn't it be better to select a random nonce instead of increment itincrementing the first by one? This way, the miner would make use of the birthday attack. Which, which would make the probabilities of finding it higher (for a given number of trials).
I'm not sure that my understanding is correct, so maybe my question sounds stupid.