and turns out this little advantage this weakness in circuits of the algorithm is uncovered is already enough to start proving the lower bounds alright so that's it that's the first intuition for why is such an implication should even hold the second intuition is that faster circuits set algorithms show a strength of faster than to the N algorithm so they saw some tasks that you didn't think could be done namely find an input which makes the circuit print one it does it faster than to the end so there's some nice algorithm that can