Tendermint : Consensus without Mining

By Jae Kwon. 2014

511 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Ekiden: A Platform for Confidentiality-Preserving, Trustworthy, and Performant Smart Contracts (2018, neutral): “There are no current public deployments of Tendermint for comparison.”
Converging blockchain and next-generation artificial intelligence technologies to decentralize and accelerate biomedical research and healthcare (2015, background): “Under these conditions, the algorithm provides safety and liveness as defined in [74], with safety not depending on partial synchronicity.”
A Byzantine Fault-Tolerant Ordering Service for the Hyperledger Fabric Blockchain Platform (2017, methodology): “13 Tendermint [17] implements the BFT protocol designed by Buchman et. al.”
SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies (2015, background): “In Tendermint [66], participation in mining requires depositing coins in a time-locked bond account, during which they cannot be moved.”
Hybrid Consensus: Efficient Consensus in the Permissionless Model (2016, background): “We stress that this lower bound does not rule out approaches that rely on additional trust assumptions such as proofs-of-stake [11,38,49,50].”
A Survey of Blockchain Technology Applied to Smart Cities: Research Issues and Challenges (2019, background): “Mechanisms such as PoS, DPoS and some BFT-related algorithms (e.g., PBFT, Tendermint and Ripple) have been presented.”
Survey of consensus protocols on blockchain applications (2017, background): “Though the concept of asymptotic security was included in the tendermint consensus algorithm [5] proposed earlier, SCP’s flexible trust lets it stand different from the previously proposed consensus protocols [15].”
A Survey and Evaluation of the Potentials of Distributed Ledger Technology for Peer-to-Peer Transactive Energy Exchanges in Local Energy Markets (2019, unknown): “A variant of PoS and BFT protocols is the Tendermint protocol [80], which is a private one.”
Proof-of-Stake Consensus Mechanisms for Future Blockchain Networks: Fundamentals, Applications and Opportunities (2019, methodology): “Similar to Algorand, Tendermint has high transaction throughputs, e.g., up to 800 Tx/s, and low transaction confirmation time, e.g., 1 second on average [31], due to the blocks being immediately finalized.”
Casper the Friendly Finality Gadget (2017, methodology): “Repurposing BFT algorithms for proof of stake was ﬁrst introduced by Tendermint[7], and has modern inspirations such as [8].”
An Overview of Blockchain Technology: Architecture, Consensus, and Future Trends (2017, background): “As for PBFT, Ripple and Tendermint, there is no mining in consensus process.”
A Survey of Distributed Consensus Protocols for Blockchain Networks (2019, methodology): “In Tendermint, although block proposers are determined based on PoS, all validators have the equal weight in the consensus process.”
Blockchain challenges and opportunities: a survey (2018, unknown): “Tendermint (Kwon, 2014) is a byzantine consensus algorithm.”
The Honey Badger of BFT Protocols (2016, unknown): “assumptions involving the underlying currency itself [32, 32, 35, 37] to bootstrap faster BFT protocols, by selecting a random committee to perform BFT in every different epoch.”
SoK: Consensus in the Age of Blockchains (2017, background): “One such system is Tendermint [88], where a miner’s voting power is proportional to the amount of coins they have locked.”
Applications of Blockchains in the Internet of Things: A Comprehensive Survey (2019, methodology): “Subsequently, Sieve maintains consensus in state-changes to the blockchain as was the case in PBFT. 2) Tendermint: Tendermint [63] is a Byzantine Fault Tol-erant consensus algorithm, which, similar to PBFT, provides an n ≥ 3 f + 1 fault tolerance.”
Demystifying Incentives in the Consensus Computer (2015, background): “Since the Nakamoto consensus protocol ﬁrst appeared[1], numerous works have investigated alternative consensus algorithms [33, 34, 35, 36].”