The document proposes a proof that NP โ P using Markov random fields and Boolean algebra simplification. It represents non-deterministic polynomial problems as graphical models and shows that while linear chains and trees can be solved efficiently in polynomial time, fully connected graphs cannot due to remaining complex terms. The author believes propagating "not" operations in Boolean algebras will preserve polynomial time for polynomial problems but not for NP-complete problems. They provide examples and ask others to share links to their paper proposing this proof.