Hi HN, I've been working on the P vs NP problem from an information theory perspective rather than a pure combinatorial one. My paper introduces the S-operator, which treats complexity as 'information noise' (\mathcal{N}) that can be filtered. This leads to a linear-time resolution for NP-complete structures. I'm looking for rigorous feedback on the entropy reduction step. You can find the full paper on Zenodo (CERN repository) here: https://zenodo.org/records/18395618