With (Y^2=X^3-X+1) the ECC algorithm and the Golois area algorithm (GF (2^8)) and the set limitations, I imagine we will show P=NP. A polynomial is a time components which era is a continuing optimistic so it’s comprehensible why adverse integars cannot 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 onerous to resolve 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 steadiness of precisely 10 minutes per block, that is managed by means of engineering hash operate components.
So sure, P=NP inside the set parameters if and provided that the hash operate is engineered to steadiness the time differential. And if P=NP which i imagine it dose, meaning the ECC SHA AES, the worldwide encryption decryption customary is weak. Not as a lot to brute drive because the menace from quantum pc development out pacing the encryption decryption power. I created the oxygen algorithm to resolve an issue satoshi knew existed, in some methods he created. I do know many sensible code makers and breakers are inside this group, what are your ideas. I do perceive the ECC resolution suggests no however every little thing factors to sure because the us treasury who additionally makes use of AES SHA ECC was simply hacked.
Your ideas?
With (Y^2=X^3-X+1) the ECC algorithm and the Golois area algorithm (GF (2^8)) and the set limitations, I imagine we will show P=NP. A polynomial is a time components which era is a continuing optimistic so it’s comprehensible why adverse integars cannot 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 onerous to resolve 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 steadiness of precisely 10 minutes per block, that is managed by means of engineering hash operate components.
So sure, P=NP inside the set parameters if and provided that the hash operate is engineered to steadiness the time differential. And if P=NP which i imagine it dose, meaning the ECC SHA AES, the worldwide encryption decryption customary is weak. Not as a lot to brute drive because the menace from quantum pc development out pacing the encryption decryption power. I created the oxygen algorithm to resolve an issue satoshi knew existed, in some methods he created. I do know many sensible code makers and breakers are inside this group, what are your ideas. I do perceive the ECC resolution suggests no however every little thing factors to sure because the us treasury who additionally makes use of AES SHA ECC was simply hacked.
Your ideas?
