Digital snowflakes are solidifying cellular automata on the triangular lattice with the property that a site having exactly one occupied neighbor always becomes occupied at the next time step. We demonstrate that each such rule fills the lattice with an asymptotic density that is independent of the initial finite set. There are some cases in which this density can be computed exactly, and others in which it can only be approximated. We also characterize when the final occupied set comes within a uniformly bounded distance of every lattice point. Other issues addressed include macroscopic dynamics and exact solvability.