Suppose we know $2p\in(0,1)$ fraction of the bits of $PQ$ exactly where $P$ and $Q$ are primes is it possible to identify $p$ fraction of bits in each of $P,Q$ with certainty in polynomial time?