Fig. 13From: Multi-hop Byzantine reliable broadcast with honest dealer made practicalMulti-shortest policy, omniscient Byzantine faults. n=100,f=⌊(k−1)/2⌋, bounded channelsBack to article page