From f8cdc495e9d15950185e35ab3de22c495e4e1b43 Mon Sep 17 00:00:00 2001 From: AlbertoBSD Date: Tue, 29 Dec 2020 10:10:14 +0100 Subject: [PATCH] Added TODO file --- .gitignore | 1 + CHANGELOG.md | 2 +- TODO.md | 20 ++++++++++++++++++++ 3 files changed, 22 insertions(+), 1 deletion(-) create mode 100644 TODO.md diff --git a/.gitignore b/.gitignore index 61de079..edd5924 100644 --- a/.gitignore +++ b/.gitignore @@ -1,3 +1,4 @@ +hexcharstoraw *.bin keyhunt test_bloom.c diff --git a/CHANGELOG.md b/CHANGELOG.md index ae7c755..51d8b6f 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -1,4 +1,4 @@ -Versionb 0.1.20201228 +#Version 0.1.20201228 - Change Quicksort to Introsort, this solve some edge cases of quicksort. - Introsort is avaible to keyhunt and hexcharstoraw. worst case. O(N log N). - Aling of some output text diff --git a/TODO.md b/TODO.md new file mode 100644 index 0000000..d464fd8 --- /dev/null +++ b/TODO.md @@ -0,0 +1,20 @@ +#TODO +- Implement libkeccak at https://github.com/maandree/libkeccak + This is the only library that implement legacy keccak funtion (NOT SHA3) + See https://medium.com/@ConsenSys/are-you-really-using-sha-3-or-old-code-c5df31ad2b0 as reference +- GPU support +- Optimize Point Addition, maybe with a custom bignumber lib instead libgmp +- Fix a minor bug in Partition process of Introsort + fixing this will half the time of sorting data +- Make a test files for All cases of input data with fixed ranges of search + - address BTC legacy, bech32, ETH + - xpoint hexchars and binary + + +#DONE +- Fixed Quicksort edges cases (All data already sorted) + To fix it Introsort was inmplement +- Fixed bottleneck of Point - Scalar multiplication + This was fix implementing a fixed Doubling Point G + Also part of this was made by bypassing it and implementing Point addition +