If you can't solve this, you will literally never make it in crypto
If you can't solve this, you will literally never make it in crypto
Robert Gonzalez
Evan Nelson
On the left N is not equal to 1 and P not equal to 0.
On the right P is either 0 or N is 1.
Evan Peterson
>The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified (technically, verified in polynomial time) can also be solved quickly (again, in polynomial time).
Yeah, ok user.
Leo Howard
All async crypto is based on this.
Angel King
Solving a difficult CS problem vs throwing $100 into bitcoin in 2011. Seems pretty comparable to me.
Juan Bennett
Most stupid answer ever. Kys
Henry Jones
kek
Joseph Brooks
>difficult CS problem
More like the fundamental problem in CS
Matthew Lee
If you solved it crypto would crash to 0
Literally no one makes it if you can solve it
Aaron Ortiz
the answer is P
Liam Adams
Based and redpilled
Jason Nguyen
It's a cylinder with p being the other end
Camden Reed
It's about being able to compute vs verify solutuon in polynomial time. It's already solved. The remaining NP problems can be verified in polynomial time but not always solved in polynomial time regardless of the algorithm. faggots
Nathaniel Hall
>t. tfw to inteligent
Hunter Brooks
You wrong. Is unsolved. Look. Is not solved.... the problem persists of NP vs P. Noob. Kek. Ass.
Isaac Peterson
Easy, P =/= NP.
Ayden Bailey
Tfw no idea what this means but have already made it
Gavin Cruz
Wrooooong, its P =/= NP = P
Colton Young
The problem persists in the same way that we haven't calculated every digit of pi or counted to infiniti. ass fag
Charles Howard
If this were solved crypto would be literally wiped out
William Thompson
P ≈ NP
Robert Parker
Crypto would the least of my concerns for getting wiped