Algorithm 5From: Timing analysis of leader-based and decentralized Byzantine consensus algorithmsA round implementation for Byzantine faults with n>3t (code of process p)Back to article page