Say, I want to erase the record of a transaction by changing a block. Can I go back to that block and find a new block and nonce combination that makes the same hash?

Is it a case that finding such a new combination is computationally hard or is it actually impossible?

1 Answer 1


One of the main properties of a hash algorithm is collision resistance. If you would find an identical hash with two different datasets, then we would speak of a hash collision.

This is extremely unlikely to happen. The mathematical chance that a sha256 collision would happen is smaller then the actual chance that the universe will implode in this moment.


  • Thank you for your reply. I understand that one of the basic principle of a hash is that it should be infeasible to find two messages that give the same hash. Am I then correct in saying that it is computationally feasible to find a nonce that fits the requirements of the hash in bitcoin but it is computationally not feasible to find a message nonce combination that fits a given hash? Nov 25, 2016 at 7:47
  • Also, is there a chance that a given message has no possible nonce exists that produces the right hash value or is it only a matter of time before such a nonce is found? Nov 25, 2016 at 7:57
  • The collision resistance result in the behavior that you won't find a nonce that would result in the same hash when changing other data in the block (example: remove a tx). The hash of a block does always go over the complete header (not only the nonce). The assumption is hash(X) != hash(Y) regardless if X=none or X=nonce||moredata. Nov 25, 2016 at 9:55

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.