ObviousPenguin

easy to verify, but hard to construct

As some might be aware, this is basically the description of the complexity class NP from the infamous P vs NP problem.

However, we shouldn't get too excited - as of right now, we have no reason to believe that there are polynomial-time quantum algorithms for any of the NP-complete problems (i.e., quantum computers won't be solving P vs NP anytime soon, despite how quantum computation is presented in popular culture).

What story were you most scared of publishing? Are there any pieces that you've written that have never been published out of fear?