pith. sign in

arxiv: 1902.07895 · v1 · pith:TVSWGOMFnew · submitted 2019-02-21 · 💻 cs.DC · cs.GT

Rationals vs Byzantines in Consensus-based Blockchains

classification 💻 cs.DC cs.GT
keywords byzantineequilibriumblockchainsprocesseswhenacceptedblocksrational
0
0 comments X
read the original abstract

In this paper we analyze from the game theory point of view Byzantine Fault Tolerant blockchains when processes exhibit rational or Byzantine behavior. Our work is the first to model the Byzantine-consensus based blockchains as a committee coordination game. Our first contribution is to offer a game-theoretical methodology to analyse equilibrium interactions between Byzantine and rational committee members in Byzantine Fault Tolerant blockchains. Byzantine processes seek to inflict maximum damage to the system, while rational processes best-respond to maximise their expected net gains. Our second contribution is to derive conditions under which consensus properties are satisfied or not in equilibrium. When the majority threshold is lower than the proportion of Byzantine processes, invalid blocks are accepted in equilibrium. When the majority threshold is large, equilibrium can involve coordination failures , in which no block is ever accepted. However, when the cost of accepting invalid blocks is large, there exists an equilibrium in which blocks are accepted iff they are valid.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Composable Game-Theoretic Framework for Blockchains

    cs.GT 2025-04 unverdicted novelty 7.0

    Introduces the first compositional game-theoretic framework for blockchains using cross-layer games and cross-application composition to analyze incentive compatibility and reveal vulnerabilities in composed systems.