We study the persistent homology of an Erdős–Rényi random clique complex filtration on n vertices. Here, each edge e appears independently at a uniform random time , and the persistence of a cycle is defined as , where and are the birth and death times of . We show that if is fixed, then with high probability the maximal persistence of a k-cycle is of order .