In order to ensure that each correct processes disposes of the same information, it is necessary to solve consensus. Thus, any partially-synchronous algorithm that tolerates \(f\)  byzantine failures among \(3f+1\)  processes can be used, such as [1]}, [2]} or [3]}. This consensus component has an external consensus validity [4]} where a proposed value \(v\)  is valid if it satisfies the predefined predicate denoted valid(v). Values that do not verify it are discarded.
