Who Needs Consensus? A Distributed Monetary System Between Rational Agents via Hearsay

04/15/2021
by   Yanni Georghiades, et al.
0

We propose a novel distributed monetary system called Hearsay that tolerates both Byzantine and rational behavior without the need for agents to reach consensus on executed transactions. Recent work [5, 10, 15] has shown that distributed monetary systems do not require consensus and can operate using a broadcast primitive with weaker guarantees, such as reliable broadcast. However, these protocols assume that some number of agents may be Byzantine and the remaining agents are perfectly correct. For the application of a monetary system in which the agents are real people with economic interests, the assumption that agents are perfectly correct may be too strong. We expand upon this line of thought by weakening the assumption of correctness and instead adopting a fault tolerance model which allows up to t < N/3 agents to be Byzantine and the remaining agents to be rational. A rational agent is one which will deviate from the protocol if it is in their own best interest. Under this fault tolerance model, Hearsay implements a monetary system in which all rational agents achieve agreement on executed transactions. Moreover, Hearsay requires only a single broadcast per transaction. In order to incentivize rational agents to behave correctly in Hearsay, agents are rewarded with transaction fees for participation in the protocol and punished for noticeable deviations from the protocol. Additionally, Hearsay uses a novel broadcast primitive called Rational Reliable Broadcast to ensure that agents can broadcast messages under Hearsay's fault tolerance model. Rational Reliable Broadcast achieves equivalent guarantees to Byzantine Reliable Broadcast [7] but can tolerate the presence of rational agents. To show this, we prove that following the Rational Reliable Broadcast protocol constitutes a Nash equilibrium between rational agents and may therefore be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/26/2019

Byzantine Fault Tolerant Vector Consensus with Anonymous Proposals

In this paper, we introduce the anonymous proposer vector consensus prob...
research
08/05/2019

Scalable Byzantine Reliable Broadcast (Extended Version)

Byzantine reliable broadcast is a powerful primitive that allows a set o...
research
08/16/2022

Rational Uniform Consensus with General Omission Failures

Generally, system failures, such as crash failures, Byzantine failures a...
research
01/17/2020

Dynamic Byzantine Reliable Broadcast [Technical Report]

Reliable broadcast is a powerful primitive guaranteeing that, intuitivel...
research
11/30/2020

Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker

Threshold guards are a basic primitive of many fault-tolerant algorithms...
research
07/31/2022

Learning to generate Reliable Broadcast Algorithms

Modern distributed systems are supported by fault-tolerant algorithms, l...
research
05/27/2021

PAC: Practical Accountability for CCF

Permissioned ledger systems execute transactions on a set of replicas go...

Please sign up or login with your details

Forgot password? Click here to reset