We study the fundamental problem of distributed clock synchronization in a basic
probabilistic communication setting. We consider a synchronous fully-connected network of
n agents, where each agent has a local clock, that is, a counter increasing by one modulo T
in each round. The clocks have arbitrary values initially, and they must all indicate the same
time eventually. We assume a pull communication model, where in every round each agent
receives an ℓ-bit message from a random agent. We devise several fast synchronization …