We introduce a new procedure for generating the binomial random graph/hypergraph models, referred to as online sprinkling. As an illustrative application of this method, we show that for any fixed integer k ≥ 3, the binomial k-uniform random hypergraph H n,p contains N := (1 − o(1)) ( n−1 k−1 ) p edge-disjoint perfect matchings, provided p ≥ log C n nk−1 , where C := C(k) is an integer dependin...