Author: Tier Nolan 2015-07-13 13:47:57
Published on: 2015-07-13T13:47:57+00:00
The processor load for signature verification involves a hash function call, large number maths, and an elliptic curve operation. The longest step is the elliptic curve operation, which takes about 1ms per signature on normal hardware. However, optimized code can make the process faster. The main task is proving that R = u1 * G + u2 * Q, where G is a constant and the rest are different per signature. Some of the core team have created a fast CPU implementation available at https://github.com/bitcoin/secp256k1.git. There has been discussion about batch verification of signatures, with the potential to compute 16 signatures together. However, it's believed that the benefit of using GPU would be lost due to communication bandwidth. GPU miners typically benefit from needing only minimal information to be sent to the GPU routine.
Updated on: 2023-06-10T02:31:22.200526+00:00