Post
Topic
Board Altcoin Discussion
Re: Proof-of-stake can never scale without blowing up, because PoS isn't trustless
by
kiklo
on 14/07/2016, 04:31:04 UTC
Longest chain with the most difficulty Wins in PoS or PoW is not rocket science ,
Checkpoints are PoS or PoW , also not rocket science.


Which part of the prior rebuttal (quoted below) did you not read and are now pretending I never wrote?

Do I need to quote the part of the OP that explains why PoS can't provide a mathematical verification of the time ordering of block events? Are you that lazy that you are incapable of finding that portion of the OP?

Your statement is a PoS history has no verifiable longest chain , actually it is the same as PoW , in that the Longest Chain with the most difficulty wins and normally will be the true chain.

Checkpoints are not verifiable math. They are adhoc social trust. The entire point is that PoS is not trustless, because nothing can be verified about time with math. Please go back and re-read the OP, because you've not understood the OP.

Really then why don't you modify and destroy a blockchain by placing a fake block into a PoS Block Chain and prove your ridiculous point.

Oh, You Can't because you are full of SHIT!!!



Some coins use checkpoint servers or issue checkpoints in the wallet updates.
This actually gives those coins a protection from history attacks.
And it can be done by PoS or PoW coins, example : monero >https://github.com/monero-project/bitmonero/blob/master/src/cryptonote_core/checkpoints.cpp

In other words PoS is just as trustworthy as PoW, since they can both use or not use checkpoints.

Nope. See what I wrote above.

A properly designed PoW block chain with sufficient hashrate doesn't need checkpoints.
And neither does a properly design PoS block chain .
So you have no point.