We show that every graph $G$ on $n$ vertices with $δ(G) \geq (1/2+\varepsilon)n$ is spanned by a complete blow-up of a cycle with clusters of nearly uniform size $Ω(\log n)$. The proof is based on a recently introduced approach for finding vertex-spanning substructures via blow-up covers.