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?