We study the maximum dimension d=d(n,p) for which an Erdos-Renyi G(n,p) random graph is d-rigid. Our main results reveal two different regimes of rigidity in G(n,p) separated at the critical probability p_c where the graph's minimum degree exceeds half its average degree. We find that if p