  In our paper, we apply additive-combinatorial methods to study the
distribution of the set of squares $\mathcal{R}$ in the prime field. We obtain
the best upper bound on the number of gaps in $\mathcal{R}$ at the moment and
generalize this result for sets with small doubling.
