Solution (source code)

= Solution

Set $N=3^j$. At $p=1/2$, first use the <Russo-Seymour-Welsh theorem> to produce, with probability bounded below independently of $N$, two separated open crossings from left to right and a closed crossing between them. Explore the interface separating the lower open cluster from the adjacent closed cluster until it reaches the opposite macroscopic boundary. The explored interface supplies two alternating arms, while fresh RSW crossings in the unexplored regions supply the other two.

Repeat this construction in the geometrically separated scale bands
$$
3^k\leq r\leq3^{k+1},
\qquad k=2,\ldots,j-1.
$$
The <domain Markov property of a percolation exploration> leaves unrevealed sites with their original independent critical law. RSW and the <Harris-FKG inequality> therefore give a uniform conditional probability $c>0$ that the required open and closed connections occur in each band. On that event the exploration identifies a site having four alternating arms to the four sides of $W_N$, hence a pivotal site for $E_N$.

Choose the candidates in disjoint scale bands, so successful bands give distinct pivotal sites. If $Y_k$ indicates success at scale $k$, then
$$
N_{\mathrm{piv}}(E_N)\geq\sum_{k=2}^{j-1}Y_k,
\qquad
\mathbb E_{1/2}Y_k\geq c.
$$
Thus
$$
\left.\frac d{dp}\mathbb P_p(E_N)\right|_{p=1/2}
=\mathbb E_{1/2}N_{\mathrm{piv}}(E_N)
\geq c(j-2)\geq c'j
$$
for $j\geq2$, after adjusting the positive constant. This is the required logarithmic-in-$N$ lower bound.