DORA: Distributed Oracle Agreement with Simple Majority
Prasanth Chakka, Saurabh Joshi, Aniket Kate, Joshua Tobkin, David Yang

TL;DR
DORA introduces a distributed oracle agreement protocol that leverages close proximity of source values and a state machine replication service to achieve efficient consensus with only a simple majority, enhancing scalability and fault tolerance.
Contribution
The paper presents a novel asynchronous protocol for oracle agreement that requires only a simple majority, utilizing agreement distance and cluster coherence for improved efficiency.
Findings
Can tolerate up to 50% Byzantine nodes.
Small oracle networks can operate securely with fewer nodes.
Effective cluster formation enables high fault tolerance.
Abstract
Oracle networks feeding off-chain information to a blockchain are required to solve a distributed agreement problem since these networks receive information from multiple sources and at different times. We make a key observation that in most cases, the value obtained by oracle network nodes from multiple information sources are in close proximity. We define a notion of agreement distance and leverage the availability of a state machine replication (SMR) service to solve this distributed agreement problem with an honest simple majority of nodes instead of the conventional requirement of an honest super majority of nodes. Values from multiple nodes being in close proximity, therefore, forming a coherent cluster, is one of the keys to its efficiency. Our asynchronous protocol also embeds a fallback mechanism if the coherent cluster formation fails. Through simulations using real-world…
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
TopicsDistributed systems and fault tolerance
