In the real world, communication is limited to the speed of light.
If your message is going out to the "infinite number of mathematicians", then after time T your message reaches 4/3 π (c*T)^3 of space, which is polynomial in time. You therefore cannot contact an exponential number of mathematicians, which is what you would need in order to demonstrate the trivial reduction of an NP problem into P.
See https://en.wikipedia.org/wiki/Limits_of_computation for other real-world limitations.
You mention "twitter ... where it's quite possible to send messages instantly for all practical purposes."
There are fewer than 10 billion people in the world. That's a finite number. Even a quadratic problem remains quadratic if there is a bounded number of compute resources. (Any finite number of people/CPUs will be a problem, even if the entire galaxy were populated by humans and/or computronium)
Consider https://en.wikipedia.org/wiki/Ramsey%27s_theorem#Ramsey_numb... with the famous description attributed to Erdős:
> Erdős asks us to imagine an alien force, vastly more powerful than us, landing on Earth and demanding the value of R(5, 5) or they will destroy our planet. In that case, he claims, we should marshal all our computers and all our mathematicians and attempt to find the value. But suppose, instead, that they ask for R(6, 6). In that case, he believes, we should attempt to destroy the aliens.
Even with the entire mathematical population of the world working on it, Erdős doesn't think R(6, 6) solvable in reasonable time. Now try solving R(n, n). Can it really be solved in linear time even if the entire world becomes proficient in mathematics?