Fig. 6From: Multi-hop Byzantine reliable broadcast with honest dealer made practicalState of the art vs our protocol, message complexity. Random regular network, unbounded channels, f = ⌊(k−1)/2⌋ all correct. a k=3. b k=5Back to article page