In Grover's algorithm we have the solution superposition $|\omega\rangle$ and the non-solution superposition $|s'\rangle$ (containing all non-solutions). Furthermore, we rotate our starting equal-superposition state $|s\rangle$ (where all states have equal probability) towards $|\omega\rangle$ during the algorithm.
It is clear that in a typical scenario, the number of solutions is a lot smaller than the number of elements and therefore $|s\rangle$ is a lot 'closer' to $|s'\rangle$ than to $|\omega\rangle$ (i.e. $\langle s |s' \rangle \gg \langle s | \omega \rangle$).
So the question is: is there no way we can rotate towards $|s' \rangle$ instead of rotating towards $| \omega \rangle $, as this would take a lot fewer steps?
Obviously, knowing the non-solutions is equivalent to knowing the solutions themselves.
Even though the search algorithm is already optimal (i.e. such a circuit cannot exist probably), it is not clear at all to me why we cannot construct a circuit that does this opposite rotation. Is there some intuition behind that?