In this paper we show that iterated multiplication over a group has constant-communication protocols if and only if the
group is nilpotent, thus giving a new characterization of nilpotency based on communication
complexity.