in random constraint satisfaction problems, first and second moment methods are used to yield upper and lower bounds for the threshold of edge density for existence of solutions. in random hypergraph 2-coloring, achlioptas and moore obtain a lower bound using a standard second moment method based on the paley-zygmund inequality. coja-oghlan and zdeborova later use an enhanced second moment method involving the hamming geometry of the set of colorings to improve the lower bound up to a so-called condensation transition. we adapt their methods and setup to a subshift of finite type over a sofic group and show results analogous to the aforementioned, exploiting the combination of phenomena that occur at densities between the standard and enhanced second moment thresholds to conclude that there exists an interesting example of a topological dynamical system having two different positive sofic entropies relative to two different sofic approximations. this is joint work with dylan airey and lewis bowen.