OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems Sang-Min Choia , Jiho Parka , Quan Nguyena , Kiyoung Jangb , Hyunjoon Cheonb , Yo-Sub Hanb , Byung-Ik Ahna a

First Page		Document Content
Date: 2018-10-24 09:53:18 Cryptocurrencies Computing Concurrent computing Fault-tolerant computer systems Distributed computing Distributed algorithms Theory of computation Cryptography Byzantine fault tolerance Blockchain Consensus Proof-of-stake		OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems Sang-Min Choia , Jiho Parka , Quan Nguyena , Kiyoung Jangb , Hyunjoon Cheonb , Yo-Sub Hanb , Byung-Ik Ahna a Add to Reading List Source URL: fantom.foundation Download Document from Source Website File Size: 854,72 KB Share Document on Facebook

	THE SWIRLDS HASHGRAPH CONSENSUS ALGORITHM: FAIR, FAST, BYZANTINE FAULT TOLERANCE LEEMON BAIRD MAY 31, 2016 SWIRLDS TECH REPORT SWIRLDS-TR DocID: 1veqU - View Document
	Appears in the Proceedings of the Third Symposium on Operating Systems Design and Implementation, New Orleans, USA, FebruaryPractical Byzantine Fault Tolerance Miguel Castro and Barbara Liskov Laboratory for Compu DocID: 1uPp4 - View Document
	Power Fault Tolerance Technical Report (WIP) Protocol Labs July 27, 2017 Abstract Byzantine Fault Tolerance (BFT) accounts for faults as the number of faulty nodes and is thus cumbersome to apply to many modern decentral DocID: 1tHZO - View Document
	Byzantine Fault Tolerance Raymond Cheng CSE452 DocID: 1sMnO - View Document
	Practical Byzantine Fault Tolerance Castro and Liskov SOSP 99 Why this paper? DocID: 1sGJD - View Document