Normal crystals (also known as Stembridge crystals) are commonly used to establish the Schur positivity of symmetric functions, as their characters are sums of Schur polynomials. In this paper, we develop a combinatorial framework for a novel family of objects called normal square root crystals, which are closely related to symmetric Grothendieck functions, the $K$-theoretic analogue of Schur functions. Among other applications, this tool leads to a new proof of Buch's combinatorial rule for the multiplication of symmetric Grothendieck functions. The definition of a normal square root crystal, originally formulated by the first two authors, largely mirrors that of normal crystals. Our main result is to show that the character of such a crystal is always a sum of symmetric Grothendieck polynomials. The proof relies on an unexpected connection between the raising operators for our crystals and the Hecke insertion algorithm developed by Buch, Kresch, Shimozono, Tamvakis, and Yong.