A Provably Secure Proof-Of-Stake Blockchain Protocol
I don&#x27;t know why this paper needs to introduce so much already common terminology.<p>&quot;Corrupt&quot; is a re-org
&quot;stable transactions&quot; are confirmed transactions<p>&quot;Function maxvalid(C, C). Returns the longest chain from C ∪ {C} that does not fork from C
more than k blocks.&quot;<p>This is the recipe for partitioning consensus. All you need to do is broadcast to anyone a lower-work chain and they will be on their own fork.<p>This is easy to do during a new sync in which the node has been offline for more than k blocks, or with a little more work you could stake grind and partition the network at the tip.<p>The former problem is covered in section 3.2.<p>Generally the nothing at stake problem will result in the problem of requiring some trusted source to not lie, regardless of the implementation, see <a href="https:&#x2F;&#x2F;download.wpsoftware.net&#x2F;bitcoin&#x2F;pos&#x2F;" rel="nofollow">https:&#x2F;&#x2F;download.wpsoftware.net&#x2F;bitcoin&#x2F;pos&#x2F;</a>