Fig. 8From: Multi-hop Byzantine reliable broadcast with honest dealer made practicalMulti-shortest policy, message complexity and broadcast latency, passive Byzantines, bounded channels, n=100, f = ⌊(k−1)/2⌋Back to article page