There is absolutely no reason to do this.
Any reasonable micro-controller can build merkle tree roots
significantly faster than is necessary.
1 Th/s walks the nonce range once every 4.3ms.
The largest valid merkle trees are 14 nodes high.
That translates to 28 SHA256 ops per 4.3ms or 6511
It's well answered by this stack exchange question.
http://bitcoin.stackexchange.com/questions/2025/what-is-txins-sequence
On 06/20/2013 05:54 PM, Marko Otbalkana wrote:
Could anyone tell me what CTxIn::nSequence is meant for?
Best Regards,
-Marko
2 matches
Mail list logo
