Home▸Algorithms & AI▸Byzantine Fault Tolerant Consensus (PBFT)

Byzantine Fault Tolerant Consensus (PBFT)

Interactive 3D PBFT simulator: watch a ring of nodes run the pre-prepare / prepare / commit three-phase protocol, inject Byzantine (equivocating) faulty nodes, and see live whether the 2f+1 quorum still reaches safe consensus.

Algorithms & AI3DAdvanced60 FPS📱 Mobile-adapted⇄ 2D version

Distributed systems that must keep working even when some participants lie, crash, or send contradictory messages rely on Byzantine fault tolerant consensus. This simulator renders a ring of replica nodes running the classic PBFT three-phase protocol — pre-prepare, prepare, commit — with animated message pulses travelling node to node. A configurable subset of nodes is marked Byzantine and, when equivocation is enabled, broadcasts conflicting votes to different peers rather than a single consistent message, exactly the attack the protocol's 2f+1-out-of-N≥3f+1 quorum rule is designed to survive. Push the faulty count past the safety bound and watch honest replicas fail to reach a matching commit quorum in real time.

⚙ Under the hood

Watch a ring of replica nodes run the PBFT pre-prepare/prepare/commit protocol in real time, inject Byzantine nodes that equivocate, and see whether the 2f+1-out-of-N quorum still reaches safe consensus.

distributed systemsconsensusbyzantine fault tolerancepbftalgorithmsnetworking

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install