Show Posts
I'm not brute forcing the key, I'm algorithmically solving for the key. But I don't think that changes the math at all.
Those words in that context are complete nonsense.
There is no known method of deriving the digest from a hash or the private key from the pubkey other than brute force (unless the algorithm is cryptographically broken and RIPEMD-160, SHA-256, and ECDSA are not). That is the entire point of hashing algorithms and public key cryptography. If there was a faster method than brute force the algorithms would be broken.
Not sure what you think brute force means but baring a cryptographic break or quantum computer capable of Shor's algorithm (limited to attacks on known PubKeys only) your options are:
a) brute force
b) see option a.
Brute forcing a private key means to check every possible private key to see if it's the correct one. That is not what my network would do, but what my network would do is really no faster.
But I've realized an entirely separate problem with my approach: It lets me solve hard problems, but only about 1million times faster than my current computer. Which still is not fast enough to solve NP-complete problems quickly.
