more efficient elliptic curve x to y math

[ofek]

In your feature branch for files pycoin/ecdsa/Group.py and pycoin/ecdsa/numbertheory.py you can implement https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm like so https://github.com/ofek/bit/blob/master/bit/curve.py. The first argument to pow should be x ** 3 + ax + b. This would also clean up that code significantly.

[blockonomics]

Just a question, can you elaborate which pycoin operations this will help to speed up. Will key derivation from xpub be faster ?

[mfbrj]

What about to replace the pycoin ecdsa code by ofek's coincurve?

With pycoin I can generate 4.3K addresses per second, per processor. With bit, which uses coincurve, I can generate about 9.3K addresses/sec/processor.

[richardkiss]

This algorithm is implemented, so closing this issue.