A Tendermint Light Client
Sean Braithwaite, Ethan Buchman, Ismail Khoffi, Igor Konnov, and Zarko Milosevic, Romain Ruetschi, Josef Widder

TL;DR
This paper introduces a Tendermint light client protocol that efficiently verifies blockchain state by reducing data download and signature verification, formalized with proofs and model checking.
Contribution
It formalizes the Tendermint dynamic fault model and proposes a novel light client protocol with verified safety and liveness properties.
Findings
Significantly reduces data download for blockchain verification
Decreases computational load by minimizing signature checks
Ensures safety and liveness through formal proofs and model checking
Abstract
In Tendermint blockchains, the proof-of-stake mechanism and the underlying consensus algorithm entail a dynamic fault model that implies that the active validators (nodes that sign blocks) may change over time, and a quorum of these validators is assumed to be correct only for a limited period of time (called trusting period). The changes of the validator set are under control of the blockchain application, and are committed in every block. In order to check what is the state of the blockchain application at some height h, one needs to know the validator set at that height so that one can verify the corresponding digital signatures and hashes. A naive way of determining the validator set for height h requires one to: (i) download all blocks before h, (ii) verify blocks by checking digital signatures and hashes and (iii) execute the corresponding transactions so the changes in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsElectrochemical sensors and biosensors · Epilepsy research and treatment · Attention Deficit Hyperactivity Disorder
