Hacker News new | past | comments | ask | show | jobs | submit login

One field that relies on unproven but assumed true mathematical conjectures is cryptography. Provably secure crypto usually assumes that P != NP (it also incorporates further assumptions such as the intractability of integer factorization).



Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: