I'm reading the example of the simple proof of work algorithm from here: https://www.oreilly.com/library/view/mastering-bitcoin/9781491902639/ch08.html#pow_example_outputs
In that example, the
nonce always starts from ZERO and incrementally going to the
for nonce in xrange(max_nonce): hash_result = hashlib.sha256(str(header)+str(nonce)).hexdigest() # check if this is a valid result, below the target if long(hash_result, 16) < target: print "Success with nonce %d" % nonce print "Hash is %s" % hash_result return (hash_result,nonce)
In the real world of bitcoin mining, do you always start from the LAST NONCE and incrementally go up to find the correct HASH?
Because I don't see it makes sense if you start from ZERO again to solve the next math puzzle