Poly-logarithmic adaptive algorithms require revealing primitives

The main implication of these results is that the step complexity of adaptive algorithms depends on the revealing power of the primitives used. Even conditional primitives that allow to solve consensus for any number of processes, like compare&swap and LL/SC, do not improve the step complexity of adaptive algorithms.