Preprint
Abstract
The presented work continues the line of recent distributed computing communityefforts dedicated to the theoretical aspects of blockchains. This paper is the rst tospecify blockchains as a composition of abstract data types all together with a hierarchyof consistency criteria that formally characterizes the histories admissible for distributedprograms that use them. Our work is based on an original oracle-based constructionthat, along with new consistency deffnitions, captures the eventual convergence processin blockchain systems. The paper presents as well some results on implementability ofthe presented abstractions and a mapping of representative existing blockchains fromboth academia and industry in our framework.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- On Trees, Chains and Fast Transactions in the Blockchain2019
- Formalizing and Implementing Distributed Ledger ObjectsACM SIGACT News, 2018
- Practical byzantine fault tolerance and proactive recoveryACM Transactions on Computer Systems, 2002
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982