REVIEW 2 cited by
YAC: BFT Consensus Algorithm for Blockchain
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 2 Pith papers
-
A blockchain-based user-centric emission monitoring and trading system for multi-modal mobility
A blockchain-based carbon token system for passenger trips was built and tested on one day of travel data, showing which demographic groups use more emissions tokens.
-
Blockchain in Environmental Sustainability Measures: a Survey
A broad survey classifying blockchain applications for environmental sustainability by objective, feature, framework, and challenge, with no new experimental results.
Discussion (0). Continue with ORCID to comment.