Blockchain CAP Theorem Allows User-Dependent Adaptivity and Finality
Suryanarayana Sankagiri, Xuechao Wang, Sreeram Kannan, Pramod, Viswanath

TL;DR
This paper introduces a blockchain protocol that allows individual users to choose between finality and adaptivity, enabling personalized confirmation preferences while maintaining system consistency and validity.
Contribution
It presents a novel checkpointed longest chain protocol that supports user-dependent finality and adaptivity, combining features of classical and longest-chain protocols.
Findings
Supports user-specific confirmation rules
Ensures that finalized blocks are on a single chain
Allows clients to choose between finality and adaptivity
Abstract
Longest-chain blockchain protocols, such as Bitcoin, guarantee liveness even when the number of actively participating users is variable, i.e., they are adaptive. However, they are not safe under network partitions, i.e., they do not guarantee finality. On the other hand, classical blockchain protocols, like PBFT, achieve finality but not adaptivity. Indeed, the CAP theorem in the context of blockchains asserts that no protocol can simultaneously offer both adaptivity and finality. We propose a new blockchain protocol, called the checkpointed longest chain, that offers individual users the choice between finality and adaptivity instead of imposing it at a system-wide level. This protocol's salient feature is that it supports two distinct confirmation rules: one that guarantees adaptivity and the other finality. The more optimistic adaptive rule always confirms blocks that are marked…
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.
