  We consider distributed algorithms in the realistic scenario where
distributed message passing is operated via circuits. We show that within this
setting, modal substitution calculus MSC captures the expressive power of
circuits. The translations between circuits and MSC-programs are linear in both
directions. Furthermore, we show that the colouring algorithm based on
Cole-Vishkin can be specified via logarithmic size programs.
