Separating complexity classes of LCL problems on grids

We study the complexity of locally checkable labeling (LCL) problems on ${\mathbb{Z}}^n$ from the point of view of descriptive set theory, computability theory, and factors of i.i.d. Our results separate various complexity classes that were not previously known to be distinct and serve as counterexamples to a number of natural conjectures in the field.