HackerPapers

arXiv:1809.00554cs.DC

YAC: BFT Consensus Algorithm for Blockchain

Fedor Muratov, Andrei Lebedev, Nikolai Iushkevich, Bulat Nasrulin, Makoto Takemiya

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Consensus in decentralized systems that asynchronously receive events and which are subject to Byzantine faults is a common problem with many real-life applications. Advances in decentralized systems, such as distributed ledger (i.e., blockchain) technology, has only increased the importance of finding performant and secure solutions to consensus of state machine replication in decentralized systems. YAC is a practical decentralized consensus algorithm, that solves the problems of inefficient message passing and strong leaders that occur in classical Byzantine fault tolerant consensus algorithms. The algorithm is open source and currently is used to provide Byzantine fault tolerant consensus for the Hyperledger Iroha blockchain project. We provide proofs of safety and liveness, as well as empirical results showing that our algorithm can scale to dozens of validating peers.

arXiv comments
Journal reference
DOI
Subjects
cs.DCDistributed, Parallel, and Cluster Computing

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Nov 2021 to Nov 2021.

Comments linking this paper, per year.

Discussed in comments1 thread

    • > Why does it need a blockchain? Because it is federated, and no single entity should own and control the data. > What kind of blockchain will it use? I am thinking of Hyperledger Iroha. Any other suggestion, most welcome. > Public or private? Federated > What will be the…

      bsldldView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.