
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
YouTube Video
https://youtu.be/6q15ytIOE3U
Speaker
Dr. Leemon Baird  CoFounder & Chief Scientist  Hedera Hashgraph
Abstract
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.
Be the first to like this
Be the first to comment