Note: I realize that there is a disclaimer that states the possibility of errors, and thus have come here to ask for an explanation.
On the segment of
Proof Of Work, it is stated
To prove you did some extra work to create a block, you must create a hash of the block header which does not exceed a certain value. For example, if the maximum possible hash value is 2256 − 1, you can prove that you tried up to two combinations by producing a hash value less than 2255.
In the example given above, you will produce a successful hash on average every other try.
I don't quite understand this. Is there not a huge gap between 2
255 and 2
256-1? If you tried up to
only two combinations (I'm assuming this is a hash value of 2
256 and 2
256-1) then how would you be able to produce a successful hash every other try?
I'm not too huge on hashing so a layman explanation for that including this would also help. My thought so far on how it would work is that you're given a random value <=2
256.
The only other logical explanation I might have is that they mean that you would produce a successful hash on average every other try if the target was 2
255.