Under the auspices of the Computational Complexity Foundation (CCF)
We prove that any monotone switching network solving directed connectivity on $N$ vertices must have size $N^{\Omega(\log N)}$
