## Comment: Re:Some background facts (Score 1) 221 221

This isn't quite correct- factoring isn't known to be NP-Hard (and so proving it's in P wouldn't necessarily prove P=NP).

I never said it was. What I said is that factoring is in NP (not NP-hard), so if it's *not* in P, then it must be the case that P!=NP.

On the other hand, as you said, if it turns out that factoring is in P, then it's still possible that P!=NP (i.e., there may be another problem that is in NP but not in P).