With (Y^2=X^3-X+1) the ECC algorithm and the Golois area algorithm (GF (2^8)) and the set limitations, I consider we will show P=NP. A polynomial is a time components which era is a continuing optimistic so it’s comprehensible why unfavourable integars can’t be used. The query P vs NP poses is essential to bitcoin and the world and to ECC and sha 256 (2^8). NP issues are notoriously laborious to unravel and straightforward to authenticate which creates a difficulty of time. So the query is, can a NP or nondeterministic polynomials be solved as quick as it may be authenticated (pow). To my information the blockchain algorithm retains a stability of precisely 10 minutes per block, that is managed by means of engineering hash operate components.

So sure, P=NP throughout the set parameters if and provided that the hash operate is engineered to stability the time differential. And if P=NP which i consider it dose, meaning the ECC SHA AES, the worldwide encryption decryption commonplace is weak. Not as a lot to brute power because the menace from quantum laptop development out pacing the encryption decryption energy. I created the oxygen algorithm to unravel an issue satoshi knew existed, in some methods he created. I do know many good code makers and breakers are inside this group, what are your ideas. I do perceive the ECC resolution suggests no however all the pieces factors to sure because the us treasury who additionally makes use of AES SHA ECC was simply hacked.

Your ideas?