forked from brichard19/BitCrack
-
Notifications
You must be signed in to change notification settings - Fork 2
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Signed-off-by: Luca Bognolo <git@bogny.eu>
- Loading branch information
Luca Bognolo
committed
Jun 23, 2021
1 parent
9676f5a
commit 7b10d22
Showing
69 changed files
with
5,356 additions
and
5,555 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,117 +1,114 @@ | ||
| #include <map> | ||
| #include "CryptoUtil.h" | ||
|
|
||
| #include "CryptoUtil.h" | ||
| #include "AddressUtil.h" | ||
|
|
||
|
|
||
| static const std::string BASE58_STRING = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"; | ||
|
|
||
| struct Base58Map { | ||
| static std::map<char, int> createBase58Map() | ||
| { | ||
| std::map<char, int> m; | ||
| for(int i = 0; i < 58; i++) { | ||
| m[BASE58_STRING[i]] = i; | ||
| } | ||
| static std::map<char, int> createBase58Map() | ||
| { | ||
| std::map<char, int> m; | ||
| for (int i = 0; i < 58; i++) { | ||
| m[BASE58_STRING[i]] = i; | ||
| } | ||
|
|
||
| return m; | ||
| } | ||
| return m; | ||
| } | ||
|
|
||
| static std::map<char, int> myMap; | ||
| static std::map<char, int> myMap; | ||
| }; | ||
|
|
||
| std::map<char, int> Base58Map::myMap = Base58Map::createBase58Map(); | ||
|
|
||
|
|
||
|
|
||
| /** | ||
| * Converts a base58 string to uint256 | ||
| */ | ||
| secp256k1::uint256 Base58::toBigInt(const std::string &s) | ||
| { | ||
| secp256k1::uint256 value; | ||
| secp256k1::uint256 value; | ||
|
|
||
| for(unsigned int i = 0; i < s.length(); i++) { | ||
| value = value.mul(58); | ||
| for (unsigned int i = 0; i < s.length(); i++) { | ||
| value = value.mul(58); | ||
|
|
||
| int c = Base58Map::myMap[s[i]]; | ||
| value = value.add(c); | ||
| } | ||
| int c = Base58Map::myMap[s[i]]; | ||
| value = value.add(c); | ||
| } | ||
|
|
||
| return value; | ||
| return value; | ||
| } | ||
|
|
||
| void Base58::toHash160(const std::string &s, unsigned int hash[5]) | ||
| { | ||
| secp256k1::uint256 value = toBigInt(s); | ||
| unsigned int words[6]; | ||
| secp256k1::uint256 value = toBigInt(s); | ||
| unsigned int words[6]; | ||
|
|
||
| value.exportWords(words, 6, secp256k1::uint256::BigEndian); | ||
| value.exportWords(words, 6, secp256k1::uint256::BigEndian); | ||
|
|
||
| // Extract words, ignore checksum | ||
| for(int i = 0; i < 5; i++) { | ||
| hash[i] = words[i]; | ||
| } | ||
| // Extract words, ignore checksum | ||
| for (int i = 0; i < 5; i++) { | ||
| hash[i] = words[i]; | ||
| } | ||
| } | ||
|
|
||
| bool Base58::isBase58(std::string s) | ||
| { | ||
| for(unsigned int i = 0; i < s.length(); i++) { | ||
| if(BASE58_STRING.find(s[i]) < 0) { | ||
| return false; | ||
| } | ||
| } | ||
| for (unsigned int i = 0; i < s.length(); i++) { | ||
| if (BASE58_STRING.find(s[i]) < 0) { | ||
| return false; | ||
| } | ||
| } | ||
|
|
||
| return true; | ||
| return true; | ||
| } | ||
|
|
||
| std::string Base58::toBase58(const secp256k1::uint256 &x) | ||
| { | ||
| std::string s; | ||
| std::string s; | ||
|
|
||
| secp256k1::uint256 value = x; | ||
| secp256k1::uint256 value = x; | ||
|
|
||
| while(!value.isZero()) { | ||
| secp256k1::uint256 digit = value.mod(58); | ||
| int digitInt = digit.toInt32(); | ||
| while (!value.isZero()) { | ||
| secp256k1::uint256 digit = value.mod(58); | ||
| int digitInt = digit.toInt32(); | ||
|
|
||
| s = BASE58_STRING[digitInt] + s; | ||
| s = BASE58_STRING[digitInt] + s; | ||
|
|
||
| value = value.div(58); | ||
| } | ||
| value = value.div(58); | ||
| } | ||
|
|
||
| return s; | ||
| return s; | ||
| } | ||
|
|
||
| void Base58::getMinMaxFromPrefix(const std::string &prefix, secp256k1::uint256 &minValueOut, secp256k1::uint256 &maxValueOut) | ||
| { | ||
| secp256k1::uint256 minValue = toBigInt(prefix); | ||
| secp256k1::uint256 maxValue = minValue; | ||
| int exponent = 1; | ||
| secp256k1::uint256 minValue = toBigInt(prefix); | ||
| secp256k1::uint256 maxValue = minValue; | ||
| int exponent = 1; | ||
|
|
||
| // 2^192 | ||
| unsigned int expWords[] = { 0, 0, 0, 0, 0, 0, 1, 0 }; | ||
| // 2^192 | ||
| unsigned int expWords[] = {0, 0, 0, 0, 0, 0, 1, 0}; | ||
|
|
||
| secp256k1::uint256 exp(expWords); | ||
| secp256k1::uint256 exp(expWords); | ||
|
|
||
| // Find the smallest 192-bit number that starts with the prefix. That is, the prefix multiplied | ||
| // by some power of 58 | ||
| secp256k1::uint256 nextValue = minValue.mul(58); | ||
| // Find the smallest 192-bit number that starts with the prefix. That is, the prefix multiplied | ||
| // by some power of 58 | ||
| secp256k1::uint256 nextValue = minValue.mul(58); | ||
|
|
||
| while(nextValue.cmp(exp) < 0) { | ||
| exponent++; | ||
| minValue = nextValue; | ||
| nextValue = nextValue.mul(58); | ||
| } | ||
| while (nextValue.cmp(exp) < 0) { | ||
| exponent++; | ||
| minValue = nextValue; | ||
| nextValue = nextValue.mul(58); | ||
| } | ||
|
|
||
| secp256k1::uint256 diff = secp256k1::uint256(58).pow(exponent - 1).sub(1); | ||
| secp256k1::uint256 diff = secp256k1::uint256(58).pow(exponent - 1).sub(1); | ||
|
|
||
| maxValue = minValue.add(diff); | ||
| maxValue = minValue.add(diff); | ||
|
|
||
| if(maxValue.cmp(exp) > 0) { | ||
| maxValue = exp.sub(1); | ||
| } | ||
| if (maxValue.cmp(exp) > 0) { | ||
| maxValue = exp.sub(1); | ||
| } | ||
|
|
||
| minValueOut = minValue; | ||
| maxValueOut = maxValue; | ||
| } | ||
| minValueOut = minValue; | ||
| maxValueOut = maxValue; | ||
| } |
Oops, something went wrong.