Hi everyone,
I´m just trying to decrypt my wallet.dat with btcrecover.
Simplified example:
Word A, B, C and D maybe on position 1 and 3 but not between.
so what I am trying is the following tokenfile:
+ ^1^A ^1^B ^1^C ^1^D
+ ^2^E ^2^F ^2^G ^2^H
+ ^3^A ^3^B ^3^C ^3^D
First question:
Is there a shorter way to do that? As I know + ^1,3^A will try the word A on position 1 TILL 3, including 2, which I don´t need.
Second question:
Each word exists only one time, so if A is tested on position 1, it doesn´t need to be tested on position 3 again! Is there a syntax for managing this, to reduce the possible number of passwords?
Maybe question one and two have a unified solution?
I am grateful for any help!
best regards,
drvga
Topic: btcrecover help for better tokenlist syntax (Read 194 times)
Jump to: