3
2
I understand how generating a SHA-256 hash containing any specified sequence requires lots of guessing and checking. The longer the specified sequence, the more rarely that it will appear.
And I understand how inserting random nonces into a block until its hash happens to begin with a certain number of 0s is a computationally expensive and ultimately random process, which demonstrates proof of work.
What I’m wondering is: why zeroes, and why leading?
Could mining work just as feasibly if the challenge were to produce a hash with, say, ends in a certain number of Fs, or has the digits 314159265358979... starting at index 32?
Or is there a technical reason why miners’ goal is to produce a hash which begins with 0s, and not any other character at any other location in the hash?
Sensical! So if I know a target has
nleading zeroes, that's shorthand for saying that the actual specific target lies somewhere between[ 16^(63-n), 16^(64-n) ), yeah? – Jacob Ford – 2017-08-09T20:10:38.8201I'd have said
[ 2^(255-n)-1, 2^(256-n)-1 ), but besides that yeah. – Murch – 2017-08-09T20:52:50.790