Our great sponsors
-
quantificationOfConsensusProtocolSecurity
A methodology and application for quantifying the security of cryptocurrency consensus protocols.
-
ValidatedProofOfStake
A pure proof of stake cryptocurrency consensus protocol that uses block validators and minter punishments without lock-in stake.
-
SurveyJS
Open-Source JSON Form Builder to Create Dynamic Forms Right in Your App. With SurveyJS form UI libraries, you can build and style forms in a fully-integrated drag & drop form builder, render them in your JS app, and store form submission data in any backend, inc. PHP, ASP.NET Core, and Node.js.
Very true. However, the situation is worse for PoW. I did quite a bit of work on this subject and found that the best case scenario for PoW is that 0.625% of the supply of bitcoin would be required to buy out enough miners for a 51% attack. Even requiring a few % of the total supply for an attack on a PoS chain would be a substantial improvement in blockchain security. However, while PoW has strict limitations on how much security can be profitably created via mining (because of the high costs of mining), PoS is much less limited in that regard because the low costs of minting mean far more coins can be put towards profitably minting.
Coins like Peercoin and Nxt have a system where each coin has a probability each second of granting the ability to mint a block. So those are a couple that don't have that kind of orphan preventing dynamic. Its the ones that use randomly chosen committees that preven orphans. Not that PoS and Nxt are very good - neither solve the nothing at stake problem. This is one that does solve the nothing at stake problem but has a similar random dynamic that doesn't prevent orphans.