We study the concept of
\emph{propagation connectivity} on random 3-uniform hypergraphs.
This concept is inspired by a simple linear time algorithm for solving instances of certain constraint satisfaction problems.
We derive upper and lower bounds
for the propagation connectivity threshold, and point out some algorithmic implications.