No, it definitely won't. I personally spent several years building SHA-256 as a Boolean circuit and then using all the most sophisticated techniques known to math and cryptography to try to invert that function (to execute a preimage attack). I know the math of SHA-256 more deeply than most people on this planet. It's exceptionally well-defined as a trapdoor function, and inverting it is most certainly NP complete. I also spent over 30 years trying to prove that P = NP, and threw my entire 30 years of knowledge of this problem at frontier LLMs to try to crack it. What they ended up doing was to thoroughly and convincingly refute every single line of reasoning and "clever" trick I came up with over those decades, which has now left me believing for the first time that actually P≠NP.