How does Proof of Stake prevents dishonest behaviour compared to PoW?

by Gerard Bosch   Last Updated February 14, 2018 19:27 PM

I know that in Proof of Work (PoW) once a node has found the solution (the nonce) they announce it to the network. Then the rest of the nodes can easily verify the correctness of the block hash and append it to the chain.

But in case the solution is not correctly verified, the block is finally not appended to the longest chain and therefore the dishonest block is discarded.

I know that in case of PoS, the dishonest node would lose the stake, but,

How does this procedure works in the case of Proof of Stake (PoS)?

I mean how is the validity of a block checked and how the bad node lose the stake?

Related Questions

Validation methods beside POW etc

Updated April 18, 2018 14:27 PM

How does Proof of Burn work?

Updated June 27, 2017 02:27 AM

Brief observation of various Consensus Algorithms

Updated February 13, 2018 13:27 PM