You're missing my point, which is that the existence of cryptographically secure hashing functions is not equivalent to P != NP. So even if someone were to prov

You're missing my point, which is that the existence of cryptographically secure hashing functions is not equivalent to P != NP. So even if someone were to prove that there are no secure hashing functions (which you would be fine with so long as reversal takes a long time in real life), this would not necessarily resolve P versus NP. I would suggest you read more about one-way functions and how theoretical cryptography relates to complexity theory, but you don't seem to take mathematical inquiry very seriously. Again, it's not a problem, but you should consider it a prerequisite for having serious discussions about P versus NP if you insist on relating it to hashing.