some way to solve it faster than the obvious self what is the obvious algorithm just try every possible input to the circuit okay so here we're leveraging the fact that there's a finite number of inputs so the circuit has a finite number of bits coming in so you could just if it's got n bits coming in there to the impossibility is just try them all see if any of them make this thing print one okay so we can answer this something faster this obvious brute-force search our okay we and maybe this is an interesting