# What complexity class results would be implied by a proof of the existence of one way functions

What complexity class results would be implied by a proof of the existence of one way functions. (Apart from the obvious $$P \neq NP$$)

I thik it would imply $$P \neq UP$$, but what else?

• The Wikipedia article One-way function says that the existence of such one-way functions is still an open conjecture. In fact, their existence would prove that the complexity classes P and NP are not equal, thus resolving the foremost unsolved question of theoretical computer science. The converse is not known to be true, i.e. the existence of a proof that P≠NP would not directly imply the existence of one-way functions. – Pål GD Jun 14 '20 at 18:51
• I think the question is answered completely already from the Wikipedia article. One-way function: Theoretical implications of one-way functions. – Pål GD Jun 14 '20 at 18:56
• That doesn't answer my question at all. – blademan9999 Jun 14 '20 at 19:04
• Please edit your question to show your research, summarize what you've found, and ask a more specific question (and make clear what exactly the question is and why the existing resources don't answer it). – D.W. Jun 14 '20 at 21:15
• – D.W. Jun 14 '20 at 21:44