Be the first to like this
Dr. Leemon Baird | Co-Founder & Chief Scientist | Hedera Hashgraph
Dr. Leemon Baird will present an introduction to how mathematical proofs can be checked by a computer, and how this can be useful in projects where security and correctness is important. These formal methods can increase our confidence that a consensus algorithm is truly Asynchronous Byzantine Fault Tolerant (aBFT), or that a given program correctly implements that algorithm. Examples will be shown from the proofs that have been developed for the Hashgraph consensus algorithm, using the Coq Proof Assistant.