Formalizing nakamoto-style proof of stake
SE Thomsen, B Spitters - 2021 IEEE 34th Computer Security …, 2021 - ieeexplore.ieee.org
Fault-tolerant distributed systems move the trust in a single party to a majority of parties
participating in the protocol. This makes blockchain based crypto-currencies possible: they
allow parties to agree on a total order of transactions without a trusted third party. To trust a
distributed system, the security of the protocol and the correctness of the implementation
must be indisputable. We present the first machine checked proof that guarantees both
safety and liveness for a consensus algorithm. We verify a Proof of Stake (PoS) Nakamoto …
participating in the protocol. This makes blockchain based crypto-currencies possible: they
allow parties to agree on a total order of transactions without a trusted third party. To trust a
distributed system, the security of the protocol and the correctness of the implementation
must be indisputable. We present the first machine checked proof that guarantees both
safety and liveness for a consensus algorithm. We verify a Proof of Stake (PoS) Nakamoto …
Formalizing Nakamoto-Style Proof of Stake
S Eller Thomsen, B Spitters - arXiv e-prints, 2020 - ui.adsabs.harvard.edu
Fault-tolerant distributed systems move the trust in a single party to a majority of parties
participating in the protocol. This makes blockchain based crypto-currencies possible: they
allow parties to agree on a total order of transactions without a trusted third party. To trust a
distributed system, the security of the protocol and the correctness of the implementation
must be indisputable. We present the first machine checked proof that guarantees both
safety and liveness for a consensus algorithm. We verify a Proof of Stake (PoS) Nakamoto …
participating in the protocol. This makes blockchain based crypto-currencies possible: they
allow parties to agree on a total order of transactions without a trusted third party. To trust a
distributed system, the security of the protocol and the correctness of the implementation
must be indisputable. We present the first machine checked proof that guarantees both
safety and liveness for a consensus algorithm. We verify a Proof of Stake (PoS) Nakamoto …
Showing the best results for this search. See all results
