Polynomial constraints go brrrr (STARKs with high school math part 2)
Last time we had the following constraints for our automata: * \(C_0 = \frac{S(0) - q_0}{X-0}\) * \(C_1 = \frac{\prod_{q \in F}{S(n-1) - q}}{X - (n-1)}\) where n is the number of steps and \(F\) the accepting states * \(C_2 = \frac{\text{step