Come on. P vs. NP isn't "Computer Science's biggest mystery". That would be naming functions.

For real though, I feel like "mystery" is the wrong word here.

Mystery requires a certain level of intrigue to me. "P=NP?" is, at its heart, a pretty straightforward yes-or-no question that would not be difficult to explain in not-fully-rigorous-but-gets-at-the-essentials level to a bright middle schooler.

It's just one where we don't know the answer. But not every unanswered question meets the criteria for a mystery!

I think a good example that gets at the essence to me is Fermat's Last Theorem.

FLT, to me, is a proper mystery. But not because of the actual theorem. (Wiles' 1993 proof is generally accepted.)

The mystery was not "is this true or not". The mystery was "what was the truly marvelous proof that Fermat's margin was too small to contain?", and like a proper mystery, we may never know. (Also, that proof - like most other attempts at it - was almost certainly wrong, but that doesn't even matter.)

P=NP? is merely an open, and, evidently, very hard problem, but it lacks that kind of essential je ne sais quoi
@rygorous While P=NP is a simple question, there is the possible, hillarious outcome, that we will find a proof for P=NP, but it is non-constructive.

@Marthog or other hilarious outcomes like P=NP with a constructive proof and a hilariously useless upper bound like O(N^TREE(3)).

congratulations, it's Technically Polynomial Time

@Marthog (middle schooler still sitting there, twiddling thumbs) "Oh we got a solution?"

"...sorry kiddo, we do, but you'll need to learn around 7-10 more years worth of math to get even close to appreciating how incredibly useless this solution is"