Main theorem: 3-majority reaches consensus in O(log n) rounds w.h.p. #
Glues growth_phase1 (10 rounds) to the three saturation stages
(saturation_stage2a, 2b, 2c; T2a n + 2 rounds total) via the same
expList-conditioning idiom the push protocol's Main.lean uses to glue
its own two phases (prNotAllInformed_le).
Main theorem: 3-majority reaches consensus in 10 + T2a n + 2 = O(log n)
rounds, with failure probability bounded by an explicit, n-dependent
constant that → 0 as n → ∞. Combines growth_phase1 (10 rounds) with
saturation_2a2b2c (T2a n + 2 rounds) exactly as the push protocol's
prNotAllInformed_le combines its own two phases.
Consensus with high probability: starting from an initial
opinion-1 majority of at least 60%, and for n large enough
(log n ≥ 30 suffices), 3-majority reaches full consensus within
10 + T2a n + 2 = O(log n) rounds with probability at least 1 - 500/n.