On one of the possibilities of sharpening estimates for the delay of a parallel adder

A nontrivial lower bound to the delay of a parallel adder over the classical basis $\textrm B_0=\{\&,\lor,{^-}\}$ is obtained with the additive remainder term of order $\log\log\log n$.