Let us consider an application context in which, in any execution, at least (t + 1) correct processes always propose the same value. Design an algorithm reducing multivalued Byzantine consensus to...

Let us consider an application context in which, in any execution, at least (t + 1) correct processes always propose the same value. Design an algorithm reducing multivalued Byzantine

consensus to binary Byzantine consensus inn which the value decided by the correct processes

is always a value proposed by one of them (hence, unlike the algorithm described in Fig. 19.6,

⊥ can never be decided). This reduction, suited to the model BAMPn,t[t <>

use a constant number of communication steps, and O(n2) messages.

Solution in [326].