2 problems

Disagreement-detection lower-bound conjecture. If the $k$ initial values are not identical, at least one node can detect this only after at least

Communication lower-bound conjecture. In order to achieve agreement on $l$ bits, at least