Why don’t passwords prove P != NP?

Pardon my ignorance on the matter but,

Verifying passwords = Polynomial (linear)

Guessing passwords = Exponential

Since each guess has nothing to do with one another, exponential time is best possible time (but verifiable in linear time).