(

) Prove that, in protocol Committees, for any 1 > r > 0 and c > 0, there exists an assignment of n entities to k = O(n2) committees such that for all choices of f < n/(3 +

c) faulty entities, at most O(r k) committees are faulty, and each committee has size s = O(log n).