000233596 001__ 233596
000233596 005__ 20190617200532.0
000233596 037__ $$aREP_WORK
000233596 245__ $$aWhy You Can't Beat Blockchains: Consistency and High Availability in Distributed Systems
000233596 269__ $$a2017
000233596 260__ $$barxiv$$c2017
000233596 300__ $$a16
000233596 336__ $$aWorking Papers
000233596 520__ $$aWe study the issue of data consistency in highly-available distributed systems. Specifically, we consider a distributed system that replicates its data at multiple sites, which is prone to partitions, and which is expected to be highly available. In such a setting, strong consistency, where all replicas of the system apply synchronously every operation, is not possible to implement. However, many weaker consistency criteria that allow a greater number of behaviors than strong consistency, are implementable in distributed systems. We focus on determining the strongest consistency criterion that can be implemented in a distributed system that tolerates partitions. We show that no criterion stronger than Monotonic Prefix Consistency (MPC) can be implemented. MPC is the consistency criterion underlying blockchains.
000233596 6531_ $$aBlockchains
000233596 6531_ $$aconsistency
000233596 6531_ $$adistributed systems
000233596 6531_ $$ahigh availability
000233596 6531_ $$areplication
000233596 6531_ $$aMPC
000233596 700__ $$aGirault, Alain
000233596 700__ $$aGössler, Gregor
000233596 700__ $$0240335$$g105326$$aGuerraoui, Rachid
000233596 700__ $$0249522$$g201293$$aHamza, Jad
000233596 700__ $$aSeredinschi, Dragos-Adrian$$g233424$$0247459
000233596 8564_ $$uhttps://arxiv.org/abs/1710.09209$$zURL
000233596 8564_ $$uhttps://infoscience.epfl.ch/record/233596/files/1710.09209.pdf$$zPreprint$$s220583$$yPreprint
000233596 909C0 $$xU10407$$0252114$$pDCL
000233596 909CO $$ooai:infoscience.tind.io:233596$$qGLOBAL_SET$$pworking$$pIC
000233596 917Z8 $$x233424
000233596 937__ $$aEPFL-WORKING-233596
000233596 973__ $$aEPFL
000233596 980__ $$aWORKING