-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathkeytree.cpp
691 lines (606 loc) · 28.6 KB
/
keytree.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
////////////////////////////////////////////////////////////////////////////////
//
// kt.h
//
// Copyright (c) 2013-2014 Tim Lee
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
#include <iostream>
#include <algorithm>
#include <stdexcept>
#include <sstream>
#include <deque>
#include <termios.h>
#include <unistd.h>
#include "keynode/keynode.h"
#include "keynode/logger.h"
#include "keynode/CoinClasses/Base58Check.h"
#include "keytreeutil.h"
using namespace std;
/*
Option to specify seed, extended key and chain in command line is possible,
but is discouraged because on most OS commands are stored in a history file.
To do it put the noprompt option at the begining.
./kt --noprompt -s "this is a password" --chain "(0-1)'/(6-8)'" -trav levelorder
./kt -np --extkey "xprv9uHRZZhk6KAJC1avXpDAp4MDc3sQKNxDiPvvkX8Br5ngLNv1TxvUxt4cV1rGL5hj6KCesnDYUhd7oWgT11eZG7XnxHrnYeSvkzY7d2bhkJ7" -c "(0-1)'/8"
*/
static bool noInputEcho = false;
static const std::string cmdName = "./kt";
static const std::string HELP = "-help";
static const std::string SEED_FORMAT = "seed_format";
static const std::string SEED_VALUE = "seed_value";
static const std::string EXTENDEDKEY_VALUE = "extkey_value";
static const std::string CHAIN_VALUE = "chain_value";
static const std::string NO_INPUT_ECHO = "-noecho";
static const std::string TESTNET = "-testnet";
static const std::string HASH_SEED = "-hashseed";
static const std::string NO_PROMPT = "-noprompt";
static const std::string SEED = "-seed";
static const std::string SEED_HEX = "-seedhex";
static const std::string EXTENDEDKEY = "-extkey";
static const std::string CHAIN = "-chain";
static const std::string TREE_TRAVERSAL_OPTION = "-traverse";
static const std::string TREE_TRAVERSAL_TYPE_PREORDER = "preorder";
static const std::string TREE_TRAVERSAL_TYPE_POSTORDER = "postorder";
static const std::string TREE_TRAVERSAL_TYPE_LEVELORDER = "levelorder";
static const std::string OUTPUT_ENTIRE_CHAIN_OPTION = "-all";
static const std::string VERBOSE_OPTION = "-verbose";
static const std::string NO_INPUT_ECHO_SHORT = "ne";
static const std::string TESTNET_SHORT = "tn";
static const std::string HASH_SEED_SHORT = "hs";
static const std::string NO_PROMPT_SHORT = "np";
static const std::string SEED_SHORT = "s";
static const std::string SEED_HEX_SHORT = "sh";
static const std::string EXTENDEDKEY_SHORT = "ek";
static const std::string CHAIN_SHORT = "c";
static const std::string TREE_TRAVERSAL_OPTION_SHORT = "trav";
static const std::string TREE_TRAVERSAL_TYPE_PREORDER_SHORT = "pre";
static const std::string TREE_TRAVERSAL_TYPE_POSTORDER_SHORT = "post";
static const std::string TREE_TRAVERSAL_TYPE_LEVELORDER_SHORT = "lev";
static const std::string OUTPUT_ENTIRE_CHAIN_OPTION_SHORT = "a";
static const std::string VERBOSE_OPTION_SHORT = "v";
static const TreeTraversal::Type defaultTreeTraversalType = TreeTraversal::preorder;
void testVector1();
void testVector2();
template<typename It>
std::map<std::string, std::string> parse_arguments(It begin, It end);
void outputExamples();
TreeTraversal::Type getTreeTraversalOption(std::string treeTraversalOption);
bool getOptionValue(std::string option);
std::string get_input(std::string pretext);
int enter_prompt(std::map<std::string, std::string> argsDict);
int handle_arguments(std::map<std::string, std::string> argsDict);
void outputString(const std::string& str);
void outputExtKeysFromSeed(const std::string& seed, const std::string& chainStr,
StringUtils::StringFormat seedStringFormat, const int roundsToHash,
const OptionsDict& optionsDict = OptionsDict(),
TreeTraversal::Type traversalType = defaultTreeTraversalType);
void outputExtKeysFromExtKey(const std::string& extKey, const std::string& chainStr,
const OptionsDict& optionsDict = OptionsDict(),
TreeTraversal::Type traversalType = defaultTreeTraversalType);
void outputKeyAddressofExtKey(const std::string& extKey,
const OptionsDict& optionsDict = OptionsDict());
void outputString(const std::string& str);
void traversePreorder(const KeyNode& keyNode, TreeChains treeChains, const std::string& chainName,
const OptionsDict& optionsDict = OptionsDict());
void traversePostorder(const KeyNode& keyNode, TreeChains treeChains, const std::string& chainName,
const OptionsDict& optionsDict = OptionsDict());
void traverseLevelorder(const KeyNode& keyNode, const TreeChains& treeChains, const std::string& chainName,
uint64_t level, std::deque<KeyNode>& keyNodeDeq,
std::deque<std::pair<uint64_t,std::string>>& levelNChainDeq,
const OptionsDict& optionsDict = OptionsDict());
void visit(const KeyNode& keyNode, const std::string& chainName, const bool isLeafNode,
const OptionsDict& optionsDict = OptionsDict());
void outputExtraKeyNodeData(const KeyNode& keyNode);
void testVector1() {
OptionsDict optionsDict;
optionsDict[OUTPUT_ENTIRE_CHAIN_OPTION] = true;
optionsDict[VERBOSE_OPTION] = false;
//optionsDict[VERBOSE_OPTION] = true;
outputExtKeysFromSeed("000102030405060708090a0b0c0d0e0f", "0'/1/2'/2/1000000000", StringUtils::hex, 0, optionsDict);
}
void testVector2() {
OptionsDict optionsDict;
optionsDict[OUTPUT_ENTIRE_CHAIN_OPTION] = true;
optionsDict[VERBOSE_OPTION] = false;
//optionsDict[VERBOSE_OPTION] = true;
std::string seed = "fffcf9f6f3f0edeae7e4e1dedbd8d5d2cfccc9c6c3c0bdbab7b4b1aeaba8a5a29f9c999693908d8a8784817e7b7875726f6c696663605d5a5754514e4b484542";
outputExtKeysFromSeed(seed, "0/2147483647'/1/2147483646'/2", StringUtils::hex, 0, optionsDict);
}
template<typename It>
std::map<std::string, std::string> parse_arguments(It begin, It end) {
std::map<std::string, std::string> argsDict;
for (auto it = begin ; it != end; ++it) {
std::string arg = *it;
if (arg[0] != '-')
throw std::invalid_argument("Invalid arguments.");
arg = arg.substr(1);
if (arg == HELP) {
argsDict[HELP] = HELP;
break;
} else if (arg == SEED || arg == SEED_SHORT) {
argsDict[SEED_FORMAT] = ""; //assumes ascii
argsDict[SEED] = "Y";
if (getOptionValue(argsDict[NO_PROMPT])) {
++it;
argsDict[SEED_VALUE] = *it;
}
} else if (arg == SEED_HEX || arg == SEED_HEX_SHORT) {
argsDict[SEED_FORMAT] = "hex";
argsDict[SEED] = "Y";
if (getOptionValue(argsDict[NO_PROMPT])) {
++it;
argsDict[SEED_VALUE] = *it;
}
} else if(arg == EXTENDEDKEY || arg == EXTENDEDKEY_SHORT) {
argsDict[EXTENDEDKEY] = "Y";
if (getOptionValue(argsDict[NO_PROMPT])) {
++it;
argsDict[EXTENDEDKEY_VALUE] = *it;
}
} else if(arg == CHAIN || arg == CHAIN_SHORT) {
if (getOptionValue(argsDict[NO_PROMPT])) {
++it;
argsDict[CHAIN_VALUE] = *it;
}
} else if(arg == TREE_TRAVERSAL_OPTION || arg == TREE_TRAVERSAL_OPTION_SHORT) {
++it;
argsDict[TREE_TRAVERSAL_OPTION] = *it;
argsDict[OUTPUT_ENTIRE_CHAIN_OPTION] = "Y";
} else if(arg == OUTPUT_ENTIRE_CHAIN_OPTION || arg == OUTPUT_ENTIRE_CHAIN_OPTION_SHORT) {
argsDict[OUTPUT_ENTIRE_CHAIN_OPTION] = "Y";
} else if(arg == VERBOSE_OPTION || arg == VERBOSE_OPTION_SHORT) {
argsDict[VERBOSE_OPTION] = "Y";
} else if(arg == NO_INPUT_ECHO || arg == NO_INPUT_ECHO_SHORT) {
noInputEcho = true;
} else if(arg == TESTNET || arg == TESTNET_SHORT) {
argsDict[TESTNET] = "Y";
} else if(arg == HASH_SEED || arg == HASH_SEED_SHORT) {
argsDict[HASH_SEED] = "Y";
if (getOptionValue(argsDict[NO_PROMPT])) {
++it;
argsDict[HASH_SEED] = *it;
}
} else if(arg == NO_PROMPT || arg == NO_PROMPT_SHORT) {
argsDict[NO_PROMPT] = "Y";
} else {
throw std::invalid_argument("Invalid arguments.");
}
}
//default to seed if no option provided
if (argsDict.find(EXTENDEDKEY) == argsDict.end() && argsDict.find(SEED) == argsDict.end()) {
argsDict[SEED] = "Y";
}
return argsDict;
}
void outputExamples() {
outputString("Extended Keys can be in hex or base58. Seed can be in ASCII or hex. Examples below.");
outputString("");
outputString("To use KeyTree simply do the following:");
outputString(cmdName);
outputString("Enter Seed:");
outputString("correct horse battery staple");
outputString("Enter Chain:");
outputString("0'/0");
outputString("");
outputString("Use the hex option to enter the seed in hex:");
outputString(cmdName+" --seed.hex");
outputString("Enter Seed in Hex:");
outputString("000102030405060708090a0b0c0d0e0f");
outputString("Enter Chain:");
outputString("0'/1/2");
outputString("");
outputString("Use the extended key option to enter the extended key in lieu of the seed:");
outputString(cmdName+" --extkey");
outputString(cmdName+" -ek");
outputString("");
outputString("It is also possible to print multiple chain paths together:");
outputString(cmdName);
outputString("Enter Extended Key:");
outputString("xprv9uHRZZhk6KAJC1avXpDAp4MDc3sQKNxDiPvvkX8Br5ngLNv1TxvUxt4cV1rGL5hj6KCesnDYUhd7oWgT11eZG7XnxHrnYeSvkzY7d2bhkJ7");
outputString("Enter Chain:");
outputString("0'/(3-6)'/(1-2)/8");
outputString("");
outputString("To output all the node data on the chain, use the all option:");
outputString(cmdName+" --all");
outputString(cmdName+" -a");
outputString("");
outputString("It is also possible to output the nodes in a different order:");
outputString(cmdName+" --traverse levelorder");
outputString(cmdName+" -trav postorder");
outputString(cmdName+" -trav preorder");
outputString("");
outputString("For more information on the node use the verbose option:");
outputString(cmdName+" --verbose");
outputString(cmdName+" -v");
outputString("There is also the testnet option:");
outputString(cmdName+" --testnet");
outputString(cmdName+" -tn");
outputString("");
outputString("Use the no echo option to not echo your inputs:");
outputString(cmdName+" --noecho");
outputString(cmdName+" -ne");
outputString("");
outputString("Use the hash seed option to do a number of specific rounds of sha256 on your seed:");
outputString(cmdName+" --hashseed 10");
outputString(cmdName+" -hs 5");
outputString("");
}
TreeTraversal::Type getTreeTraversalOption(std::string treeTraversalOption) {
if (treeTraversalOption == TREE_TRAVERSAL_TYPE_LEVELORDER
|| treeTraversalOption == TREE_TRAVERSAL_TYPE_LEVELORDER_SHORT)
return TreeTraversal::levelorder;
else if (treeTraversalOption == TREE_TRAVERSAL_TYPE_POSTORDER
|| treeTraversalOption == TREE_TRAVERSAL_TYPE_POSTORDER_SHORT)
return TreeTraversal::postorder;
else if (treeTraversalOption == TREE_TRAVERSAL_TYPE_PREORDER
|| treeTraversalOption == TREE_TRAVERSAL_TYPE_PREORDER)
return TreeTraversal::preorder;
else
return defaultTreeTraversalType;
}
bool getOptionValue(std::string option) {
if (option == "Y") return true;
else return false;
}
std::string get_input(std::string pretext) {
if (! pretext.empty())
outputString(pretext);
std::string buffer;
std::getline(std::cin, buffer);
return buffer;
}
int enter_prompt(std::map<std::string, std::string> argsDict) {
if (argsDict[HELP] == HELP) {
outputExamples();
} else {
OptionsDict optionsDict;
optionsDict[TESTNET] = getOptionValue(argsDict[TESTNET]);
optionsDict[OUTPUT_ENTIRE_CHAIN_OPTION] = getOptionValue(argsDict[OUTPUT_ENTIRE_CHAIN_OPTION]);
optionsDict[VERBOSE_OPTION] = getOptionValue(argsDict[VERBOSE_OPTION]);
TreeTraversal::Type traverseType = getTreeTraversalOption(argsDict[TREE_TRAVERSAL_OPTION]);
if (getOptionValue(argsDict[SEED])) {
std::string seed;
std::string chain;
StringUtils::StringFormat seed_format;
if (argsDict[SEED_FORMAT] == "hex") {
seed_format = StringUtils::hex;
seed = get_input("Enter Seed in Hex:");
if (! StringUtils::isHex(seed))
throw std::runtime_error("Invalid hex string \"" + seed + "\"");
} else {
seed_format = StringUtils::ascii;
seed = get_input("Enter Seed:");
}
chain = get_input("Enter Chain:");
int roundsToHash = 0;
if (getOptionValue(argsDict[HASH_SEED])) {
std::string roundsToHashStr = get_input("Enter number of rounds of Sha256 hash:");
std::stringstream(roundsToHashStr) >> roundsToHash;
}
outputExtKeysFromSeed(seed, chain, seed_format, roundsToHash, optionsDict, traverseType);
} else if (getOptionValue(argsDict[EXTENDEDKEY])) {
std::string extkey;
std::string chain;
extkey = get_input("Enter Extended Key:");
chain = get_input("Enter Chain:");
if(! chain.empty())
outputExtKeysFromExtKey(extkey, chain, optionsDict, traverseType);
else
outputKeyAddressofExtKey(extkey, optionsDict);
}
}
return 0;
}
int handle_arguments(std::map<std::string, std::string> argsDict) {
Logger::debug("Arguments:");
for (auto arg : argsDict) {
Logger::debug("\tkey: " + arg.first + " value: " + arg.second);
}
Logger::debug("");
if (argsDict[HELP] == HELP) {
outputExamples();
return 0;
} else {
OptionsDict optionsDict;
optionsDict[TESTNET] = getOptionValue(argsDict[TESTNET]);
optionsDict[OUTPUT_ENTIRE_CHAIN_OPTION] = getOptionValue(argsDict[OUTPUT_ENTIRE_CHAIN_OPTION]);
optionsDict[VERBOSE_OPTION] = getOptionValue(argsDict[VERBOSE_OPTION]);
if (argsDict[SEED_VALUE] != "") {
std::string seed = argsDict[SEED_VALUE];
StringUtils::StringFormat seed_format;
if (argsDict[SEED_FORMAT] == "hex")
seed_format = StringUtils::hex;
else
seed_format = StringUtils::ascii;
std::string chain = "";
if (argsDict[CHAIN_VALUE] != "")
chain = argsDict[CHAIN_VALUE];
std::string roundsToHashStr = argsDict[HASH_SEED];
int roundsToHash = 0;
std::stringstream(roundsToHashStr) >> roundsToHash;
TreeTraversal::Type traverseType = getTreeTraversalOption(argsDict[TREE_TRAVERSAL_OPTION]);
optionsDict[HASH_SEED] = getOptionValue(argsDict[HASH_SEED]);
outputExtKeysFromSeed(seed, chain, seed_format, roundsToHash, optionsDict, traverseType);
} else if (argsDict[EXTENDEDKEY_VALUE] != "" && argsDict[CHAIN_VALUE] != "") {
std::string extkey = argsDict[EXTENDEDKEY_VALUE];
std::string chain = argsDict[CHAIN_VALUE];
TreeTraversal::Type traverseType = getTreeTraversalOption(argsDict[TREE_TRAVERSAL_OPTION]);
outputExtKeysFromExtKey(extkey, chain, optionsDict, traverseType);
} else if (argsDict[EXTENDEDKEY] != "") {
std::string extkey = argsDict[EXTENDEDKEY_VALUE];
outputKeyAddressofExtKey(extkey, optionsDict);
} else {
throw std::invalid_argument("Invalid arguments.");
}
}
return 0;
}
void outputString(const std::string& str) {
Logger::log(str);
}
int main(int argc, const char * argv[]) {
Logger::setLogLevelError();
//Logger::setLogLevelDebug();
//testVector1();
//testVector2();
try {
std::map<std::string, std::string> argsDict = parse_arguments(argv+1, argv+argc);
if (getOptionValue(argsDict[NO_PROMPT])) {
return handle_arguments(argsDict);
} else {
if (noInputEcho) {
termios oldt;
tcgetattr(STDIN_FILENO, &oldt);
termios newt = oldt;
newt.c_lflag &= ~ECHO;
tcsetattr(STDIN_FILENO, TCSANOW, &newt);
}
return enter_prompt(argsDict);
}
}
catch (const std::invalid_argument& err) {
outputString("Error: " + std::string(err.what()));
outputString("---------------------------------------------------");
outputExamples();
}
catch (const std::runtime_error& err) {
outputString("Error: " + std::string(err.what()));
}
}
void visit(const KeyNode& keyNode, const std::string& chainName, const bool isLeafNode,
const OptionsDict& optionsDict) {
if (! isLeafNode && ! optionsDict.at(OUTPUT_ENTIRE_CHAIN_OPTION))
return;
outputString("* [Chain " + chainName + "]");
if (keyNode.isPrivate()) {
KeyNode keyNodePub= keyNode.getPublic();
outputString(" * ext pub: " + toBase58Check(keyNodePub.extkey()));
outputString(" * ext prv: " + toBase58Check(keyNode.extkey()));
if (! optionsDict.at(VERBOSE_OPTION)) {
outputString(" * priv key: " + keyNode.privkey());
outputString(" * address: " + keyNode.address());
} else {
outputString(" * uncompressed priv key: " + keyNode.privkey(false));
outputString(" * uncompressed pub key: " + uchar_vector(keyNode.pubkeyUncompressed()).getHex());
outputString(" * uncompressed address: " + keyNode.address(false));
outputString(" * compressed priv key: " + keyNode.privkey(true));
outputString(" * compressed pub key: " + uchar_vector(keyNode.pubkey()).getHex());
outputString(" * compressed address: " + keyNode.address(true));
}
} else {
outputString(" * ext pub: " + toBase58Check(keyNode.extkey()));
if (! optionsDict.at(VERBOSE_OPTION)) {
outputString(" * address: " + keyNode.address());
} else {
//outputString(" * uncompressed pub key: " + uchar_vector(keyNode.pubkeyUncompressed()).getHex());
//outputString(" * uncompressed address: " + keyNode.address(false));
outputString(" * compressed pub key: " + uchar_vector(keyNode.pubkey()).getHex());
outputString(" * compressed address: " + keyNode.address(true));
}
}
}
void traverseLevelorder(const KeyNode& keyNode, const TreeChains& treeChains, const std::string& chainName,
uint64_t level, std::deque<KeyNode>& keyNodeDeq,
std::deque<std::pair<uint64_t,std::string>>& levelNChainDeq,
const OptionsDict& optionsDict) {
bool isLeafNode = false;
if (level < treeChains.size()) {
IsPrivateNPathRange isPrivateNPathRange = treeChains.at(level);
bool isPrivate = isPrivateNPathRange.first;
Range range = isPrivateNPathRange.second;
uint64_t min = range.first;
uint64_t max = range.second;
level++;
for (uint64_t i = min; i <= max; ++i) {
uint32_t k = (uint32_t)i;
if (isPrivate) k = KeyTreeUtil::toPrime(k);
std::string childChainName = chainName + "/" + KeyTreeUtil::iToString(k);
KeyNode childNode = keyNode.getChild(k);
keyNodeDeq.push_back(childNode);
levelNChainDeq.push_back(std::pair<uint64_t,std::string>(level,childChainName));
}
} else {
isLeafNode = true;
}
visit(keyNode, chainName, isLeafNode, optionsDict);
if (! keyNodeDeq.empty()) {
std::pair<uint64_t,std::string> pair = levelNChainDeq.front();
uint64_t lev = pair.first++;
std::string cc = pair.second;
KeyNode node = keyNodeDeq.front();
keyNodeDeq.pop_front();
levelNChainDeq.pop_front();
traverseLevelorder(node, treeChains, cc, lev, keyNodeDeq, levelNChainDeq, optionsDict);
}
}
void traversePreorder(const KeyNode& keyNode, TreeChains treeChains, const std::string& chainName,
const OptionsDict& optionsDict) {
if (! treeChains.empty()) {
IsPrivateNPathRange isPrivateNPathRange = treeChains.front();
treeChains.pop_front();
bool isPrivate = isPrivateNPathRange.first;
Range range = isPrivateNPathRange.second;
uint64_t min = range.first;
uint64_t max = range.second;
bool isLeafNode = false;
if (treeChains.empty()) isLeafNode = true;
if (min == KeyTreeUtil::NODE_IDX_M_FLAG && max == KeyTreeUtil::NODE_IDX_M_FLAG) {
visit(keyNode, chainName, isLeafNode, optionsDict);
traversePreorder(keyNode, treeChains, chainName, optionsDict);
} else {
for (uint64_t i = min; i <= max; ++i) {
uint32_t k = (uint32_t)i;
if (isPrivate) k = KeyTreeUtil::toPrime(k);
std::string childChainName = chainName + "/" + KeyTreeUtil::iToString(k);
KeyNode childNode = keyNode.getChild(k);
visit(childNode, childChainName, isLeafNode, optionsDict);
traversePreorder(childNode, treeChains, childChainName, optionsDict);
}
}
}
}
void traversePostorder(const KeyNode& keyNode, TreeChains treeChains, const std::string& chainName,
const OptionsDict& optionsDict) {
if (! treeChains.empty()) {
IsPrivateNPathRange isPrivateNPathRange = treeChains.front();
treeChains.pop_front();
bool isPrivate = isPrivateNPathRange.first;
Range range = isPrivateNPathRange.second;
uint64_t min = range.first;
uint64_t max = range.second;
bool isLeafNode = false;
if (treeChains.empty()) isLeafNode = true;
if (min == KeyTreeUtil::NODE_IDX_M_FLAG && max == KeyTreeUtil::NODE_IDX_M_FLAG) {
traversePostorder(keyNode, treeChains, chainName, optionsDict);
visit(keyNode, chainName, isLeafNode, optionsDict);
} else {
for (uint64_t i = min; i <= max; ++i) {
uint32_t k = (uint32_t)i;
if (isPrivate) k = KeyTreeUtil::toPrime(k);
std::string childChainName = chainName + "/" + KeyTreeUtil::iToString(k);
KeyNode childNode = keyNode.getChild(k);
traversePostorder(childNode, treeChains, childChainName, optionsDict);
visit(childNode, childChainName, isLeafNode, optionsDict);
}
}
}
}
void outputExtKeysFromSeed(const std::string& seed, const std::string& chainStr,
StringUtils::StringFormat seedStringFormat, const int roundsToHash,
const OptionsDict& optionsDict, TreeTraversal::Type traversalType) {
std::string seedHex;
if (seedStringFormat == StringUtils::ascii) {
seedHex = StringUtils::string_to_hex(seed);
} else if (seedStringFormat == StringUtils::hex) {
if (! StringUtils::isHex(seed))
throw std::runtime_error("Invalid hex string \"" + seed + "\"");
seedHex = seed;
} else throw std::runtime_error("Invalid seed string format.");
uchar_vector seedBytes;
if (roundsToHash <= 0) {
seedBytes = uchar_vector(seedHex);
} else {
uchar_vector hash = KeyTreeUtil::sha256Rounds(uchar_vector(seedHex), roundsToHash);
seedBytes = uchar_vector(hash);
}
if (optionsDict.find(TESTNET) != optionsDict.end()) {
if (optionsDict.at(TESTNET) == true) {
KeyNode::setTestNet(true);
} else {
KeyNode::setTestNet(false);
}
} else {
KeyNode::setTestNet(false);
}
KeyNodeSeed keyNodeSeed(seedBytes);
bytes_t k = keyNodeSeed.getMasterKey();
bytes_t c = keyNodeSeed.getMasterChainCode();
KeyNode prv(k, c);
TreeChains treeChains = KeyTreeUtil::parseChainString(chainStr, prv.isPrivate());
if (optionsDict.at(VERBOSE_OPTION))
outputString("Master (hex): " + seedBytes.getHex());
if (traversalType == TreeTraversal::postorder)
traversePostorder(prv, treeChains, KeyTreeUtil::MASTER_NODE_LOWERCASE_M, optionsDict);
else if (traversalType == TreeTraversal::levelorder) {
treeChains.pop_front();
std::deque<KeyNode> KeyNodeDeq;
std::deque<std::pair<uint64_t,std::string>> levelNChainDeq;
traverseLevelorder(prv, treeChains, KeyTreeUtil::MASTER_NODE_LOWERCASE_M, 0, KeyNodeDeq, levelNChainDeq, optionsDict);
}
else
traversePreorder(prv, treeChains, KeyTreeUtil::MASTER_NODE_LOWERCASE_M, optionsDict);
}
void outputExtraKeyNodeData(const KeyNode& keyNode) {
outputString(" * depth: " + std::to_string(keyNode.depth()));
uint32_t childNum = keyNode.child_num();
if (KeyTreeUtil::isPrime(childNum))
outputString(" * child number: " + std::to_string(KeyTreeUtil::removePrime(childNum))+"'");
else
outputString(" * child number: " + std::to_string(childNum));
std::stringstream stream;
stream << std::hex << keyNode.parent_fp();
std::string parent_fp(stream.str());
outputString(" * parent fingerprint: " + parent_fp);
std::stringstream stream2;
stream2 << std::hex << keyNode.fp();
std::string fp(stream2.str());
outputString(" * fingerprint: " + fp);
}
void outputExtKeysFromExtKey(const std::string& extKey, const std::string& chainStr,
const OptionsDict& optionsDict, TreeTraversal::Type traversalType) {
if (optionsDict.find(TESTNET) != optionsDict.end()) {
if (optionsDict.at(TESTNET) == true) {
KeyNode::setTestNet(true);
} else {
KeyNode::setTestNet(false);
}
} else {
KeyNode::setTestNet(false);
}
uchar_vector extendedKey(KeyTreeUtil::extKeyBase58OrHexToBytes(extKey));
KeyNode keyNode(extendedKey);
TreeChains treeChains = KeyTreeUtil::parseChainString(chainStr, keyNode.isPrivate());
if (optionsDict.at(VERBOSE_OPTION)) outputExtraKeyNodeData(keyNode);
if (traversalType == TreeTraversal::postorder)
traversePostorder(keyNode, treeChains, KeyTreeUtil::LEAD_CHAIN_PATH, optionsDict);
else if (traversalType == TreeTraversal::levelorder) {
treeChains.pop_front();
std::deque<KeyNode> KeyNodeDeq;
std::deque<std::pair<uint64_t,std::string>> levelNChainDeq;
traverseLevelorder(keyNode, treeChains, KeyTreeUtil::LEAD_CHAIN_PATH, 0, KeyNodeDeq, levelNChainDeq, optionsDict);
} else
traversePreorder(keyNode, treeChains, KeyTreeUtil::LEAD_CHAIN_PATH, optionsDict);
}
void outputKeyAddressofExtKey(const std::string& extKey, const OptionsDict& optionsDict) {
if (optionsDict.find(TESTNET) != optionsDict.end()) {
if (optionsDict.at(TESTNET) == true) {
KeyNode::setTestNet(true);
} else {
KeyNode::setTestNet(false);
}
} else {
KeyNode::setTestNet(false);
}
uchar_vector extendedKey(KeyTreeUtil::extKeyBase58OrHexToBytes(extKey));
KeyNode keyNode(extendedKey);
if (optionsDict.at(VERBOSE_OPTION)) outputExtraKeyNodeData(keyNode);
visit(keyNode, KeyTreeUtil::LEAD_CHAIN_PATH, true, optionsDict);
outputString("");
}