We will introduce projection analysis - a new technique to analyze gossip
protocols that are based on random linear network coding. The analysis reduces
the problem of spreading k messages via network coding to understanding how one
message floods the network. This drastically simplifies prior results and allows
to show that network coded gossip achieves ''perfectly pipelined'' convergence
times of O(T + k), where T is the time it takes to disseminate one message. The
analysis is extremely simple yet applies and extends to a wide variety of
network settings.