This report addresses the problem of identifying a threshold for propagation connectivity in random hypergraphs as specified in [berke09]. 
In that paper we gave upper and lower bounds for the threshold that left a gap of a factor (\log n)(\log\log n)^2. 
Unfortunately there is some uncertainty regarding a detail in the lemma that was used to provide the upper bound. 
Here we provide a simpler alternative lemma and a corresponding upper bound that is slightly less tight but still <<1/n for the edge probability.