Optimize CheckRegularTransaction for larger vin sizes
To check for duplicate inputs in a transaction, CheckRegularTransaction currently uses a O(n^2) algorithm. This works well for small (n < 120), but for larger input sizes, it is faster to sort and compare adjacent elements.
Closes #220 (closed)
Test plan:
-
ninja check-bitcoin
# should produce no errors ninja bench_bitcoin
-
src/bench/bench_bitcoin -filter=CheckRegular.\*
# should produce better results