Let's say someone creates a fraudulent block and finds a nonce that solves the hash puzzle. This block is broadcasted, its hash easily verified, and it's added to the blockchain. What prevents a miner from hearing this block and adding it to its blockchain such that it uses the hash of this fraudulent block as the previous hash field in the new block it is trying to solve? Couldn't this then create the longest blockchain at a fork and thus become accepted?

When do mining nodes give up on a certain block? Once a block with the correct nonce is found for a given previous block, don't all other nodes mining a block with the same previous node have to start over?

  • What do you mean by a fraudulent block? Commented Jan 7, 2018 at 7:41
  • A block that contains an incorrect or malicious transaction.
    – flyinghigh
    Commented Jan 7, 2018 at 7:43

2 Answers 2


A miner could create a block with an incorrect transaction, but this wouldn't be accepted by the honest nodes in the network. The honest nodes would attempt to validate the transaction, fail and then not propagate the block to other nodes.

  • What is an example of someone trying to modify a transaction (and then embarking on the impossible task of redoing PoW for every subsequent node). In this case, the change is something validated and thus the need for PoW?
    – flyinghigh
    Commented Jan 7, 2018 at 7:58
  • 1
    PoW does not really matter here. Blocks are verified before PoW even comes into play. If an invalid block is produced, nodes simply ignore it. Then, PoW is used to find the most-work chain out of the set of valid blocks. Commented Jan 7, 2018 at 9:05
  • Then what is an example of a valid block that is trying to overtake a legitimate blockchain, but won't be added because it would have to redo immense amounts of PoW.
    – flyinghigh
    Commented Jan 7, 2018 at 21:19

Every full node independently validates that each block is following all consensus rules of Bitcoin. Therefore, a block with invalid transactions would simply not be accepted by any full node, and thus would quickly be forgotten by the whole network.

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.