Are the problems PRIMES, FACTORING known to be P-hard?
PRIMES is known to be hard for $\mathsf{TC^0}$.  See my paper with Saks and Shparlinski, "A Lower Bound for Primality" in JCSS 62 (2001).  No improvement on that front since then.