P vs NP proof formal

This project presents an explicit algebraic construction of a family of NP problems over GF(2) and applies a diagonalization argument over all polynomial-time algorithms. The aim is to explore the computational complexity of these instances and their implications for the P vs NP problem. The work includes fully detailed constructions, proofs of global variable interactions, and analysis of algorithmic limitations.the manuscript can be foind here https://myucdsb-my.sharepoint.com/personal/haseeb_haq_my_ucdsb_ca/Documents/Document%20(11).docx