How Does Blockchain Security Dictate Blockchain Implementation?
Andrew Lewis-Pye, Tim Roughgarden

TL;DR
This paper investigates how the fundamental design choices of permissionless blockchain protocols, such as user selection methods, influence their security properties and capabilities like certificate production.
Contribution
It provides a theoretical framework linking security features of blockchain protocols to their user selection mechanisms, establishing which properties are inherent to proof-of-work and proof-of-stake systems.
Findings
Certificates are impossible in proof-of-work protocols.
Proof-of-stake protocols naturally produce certificates.
Security notions are formally defined and compared.
Abstract
Blockchain protocols come with a variety of security guarantees. For example, BFT-inspired protocols such as Algorand tend to be secure in the partially synchronous setting, while longest chain protocols like Bitcoin will normally require stronger synchronicity to be secure. Another fundamental distinction, directly relevant to scalability solutions such as sharding, is whether or not a single untrusted user is able to point to *certificates*, which provide incontrovertible proof of block confirmation. Algorand produces such certificates, while Bitcoin does not. Are these properties accidental? Or are they inherent consequences of the paradigm of protocol design? Our aim in this paper is to understand what, fundamentally, governs the nature of security for permissionless blockchain protocols. Using the framework developed in (Lewis-Pye and Roughgarden, 2021), we prove general results…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
