Theoretical Analysis on Block Time Distributions in Byzantine Fault-Tolerant Consensus Blockchains

被引:0
|
作者
Fujihara, Akihiro [1 ]
机构
[1] Chiba Inst Technol, Grad Sch Engn, 2-17-1 Tsudanuma, Narashino, Chiba 2750016, Japan
基金
日本学术振兴会;
关键词
Blockchain; Byzantine fault tolerance; block time; mathematical model; data analysis; Gumbel distribution;
D O I
10.1109/Blockchain62396.2024.00056
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Some blockchain networks employ a distributed consensus algorithm featuring Byzantine fault tolerance. Notably, certain public chains, such as Cosmos and Tezos, which operate on a proof-of-stake mechanism, have adopted this algorithm. While it is commonly assumed that these blockchains maintain a nearly constant block creation time, empirical analysis reveals fluctuations in this interval; this phenomenon has received limited attention. In this paper, we propose a mathematical model to account for the processes of block propagation and validation within Byzantine fault-tolerant consensus blockchains, aiming to theoretically analyze the probability distribution of block time. First, we propose stochastic processes governing the broadcasting communications among validator nodes. Consequently, we theoretically demonstrate that the probability distribution of broadcast time among validator nodes adheres to the Gumbel distribution. This finding indicates that the distribution of block time typically arises from convolving multiple Gumbel distributions. Additionally, we derive an approximate formula for the block time distribution suitable for data analysis purposes. By fitting this approximation to real-world block time data, we demonstrate the consistent estimation of block time distribution parameters.
引用
收藏
页码:378 / 385
页数:8
相关论文
共 50 条
  • [31] ComChain: A blockchain with Byzantine fault-tolerant reconfiguration
    Vizier, Guillaume
    Gramoli, Vincent
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2020, 32 (12):
  • [32] THE CONSENSUS PROBLEM IN FAULT-TOLERANT COMPUTING
    BARBORAK, M
    MALEK, M
    DAHBURA, A
    COMPUTING SURVEYS, 1993, 25 (02) : 171 - 220
  • [33] Fault-Tolerant Consensus in Directed Graphs
    Tseng, Lewis
    Vaidya, Nitin H.
    PODC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2015, : 451 - 460
  • [34] Network topology and fault-tolerant consensus
    Sakavalas, Dimitris
    Tseng, Lewis
    Synthesis Lectures on Distributed Computing Theory, 2019, 9 (01): : 1 - 151
  • [35] DRBFT: Delegated randomization Byzantine fault tolerance consensus protocol for blockchains
    Zhan, Yu
    Wang, Baocang
    Lu, Rongxing
    Yu, Yong
    INFORMATION SCIENCES, 2021, 559 : 8 - 21
  • [36] An Efficient and Scalable Byzantine Fault-Tolerant Consensus Mechanism Based on Credit Scoring and Aggregated Signatures
    Tong, Shihua
    Li, Jibing
    Fu, Wei
    IEEE ACCESS, 2024, 12 : 10393 - 10410
  • [37] Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned Blockchain
    Feng, Libo
    Zhang, Hui
    Chen, Yong
    Lou, Liqi
    APPLIED SCIENCES-BASEL, 2018, 8 (10):
  • [38] BAMcast - Byzantine Fault-Tolerant Consensus Service for Atomic Multicast in Large-scale Networks
    Ribeiro, Marcelo
    Silva, Xavier
    Lung, Lau Cheuk
    Magnabosco, Leandro Quibem
    Rech, Luciana de Oliveira
    2013 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS (ISCC), 2013,
  • [39] An Efficient and Scalable Byzantine Fault-Tolerant Consensus Mechanism Based on Credit Scoring and Aggregated Signatures
    Tong, Shihua
    Li, Jibing
    Fu, Wei
    IEEE Access, 2024, 12 : 10393 - 10410
  • [40] Convergence Rate Analysis of a Fault-Tolerant Distributed Consensus Algorithm
    Haseltalab, Ali
    Akar, Mehmet
    2015 54TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2015, : 5111 - 5116