ความทนทานต่อความผิดพลาดของไบเซนไทน์

Abstract

While several consensus algorithms exist for the Byzantine Generals Problem, specifically as it pertains to distributed payment systems, m...

Introduction

...continue to make progress). We then analyze the requirements on UNL overlap and Byzantine node thresholds that are sufficient to maintain these guarantees. Finally, we p...

Definition of Consensus

... or individuals. A server may be correct (following the protocol faithfully) or Byzantine (behaving arbitrarily, possibly maliciously). **Ledger.** The ledger is the co...

Existing Consensus Algorithms

Several consensus algorithms have been proposed to solve the Byzantine Generals Problem in distributed systems. We review the most relevant approaches...

Ripple Protocol Consensus Algorithm

...he remaining servers. As long as the active servers satisfy the UNL overlap and Byzantine threshold requirements, the algorithm will reach consensus correctly. This tole...

Formal Analysis of Convergence

The correctness of RPCA depends on two conditions: the fraction of Byzantine nodes within each server's UNL, and the degree of overlap between the UNLs of d...

Unique Node Lists

...selection are derived from the safety analysis. Two conditions must hold: 1. **Byzantine threshold:** Fewer than 20% of the nodes in any server's UNL should be Byzantin...

Simulation Code

...idation. The simulation framework allows precise control over network topology, Byzantine behavior patterns, message latency distributions, and UNL configurations. The ...

Discussion

...cipants. RPCA requires that servers choose UNLs with sufficient overlap and low Byzantine fractions — assumptions that involve trust in the competence and honesty of spe...

Conclusion

...sus in a matter of seconds while maintaining provable safety guarantees against Byzantine failures. The formal analysis demonstrates that the algorithm's correctness de...

References

Lamport, L., Shostak, R., and Pease, M. (1982). "The Byzantine Generals Problem." *ACM Transactions on Programming Languages and Systems*, 4(3...

Abstract

...de a Proof of Stake consensus algorithm, PoH can reduce messaging overhead in a Byzantine Fault Tolerant replicated state machine, resulting in sub-second finality times...

Outline

...rates with a Proof of Stake consensus algorithm. The consensus mechanism, Tower BFT, uses PoH as a cryptographic clock to implement time-based lockouts that grow e...

Proof of Stake Consensus

Solana uses a Proof of Stake consensus mechanism called Tower BFT that is specifically designed to leverage the temporal guarantees provided by P...

Conclusion

...f the architecture produces a system with several distinctive properties. Tower BFT provides fast finality through exponentially increasing lockouts anchored to ve...