We consider tautologies formed from a pseudo-random number generator, defined in Kraj\'{\i}\v{c}ek \cite{Kra99} and in Alekhnovich et.al. \cite{ABRW}. We explain a strategy of proving their hardness for EF via a conjecture about bounded arithmetic formulated in Kraj\'{\i}\v{c}ek \cite{Kra99}. Further we give a purely finitary statement, in a form of a ... more >>>