Byzantine Fault Tolerant Consensus (PBFT)

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.