Coding Enthusiast (OP)
Legendary
Offline
Activity: 1039
Merit: 2783
Bitcoin and C♯ Enthusiast
|
|
November 05, 2020, 02:41:21 AM |
|
Hi Coding Enthusiast, i cant compile it broken os. could you get a compiled one up and ready to use, for windows 10 probably, thanks a lot, just did fix the not compiling issue, used ps net . Glad it worked out for you but you should know that it is not safe to handle your private keys and other secrets on Windows specifically if the system is what you regularly use for everything else too. This is why I have only released compiled version for Linux.
|
|
|
|
|
|
|
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction.
|
Coding Enthusiast (OP)
Legendary
Offline
Activity: 1039
Merit: 2783
Bitcoin and C♯ Enthusiast
|
|
December 24, 2020, 05:40:29 AM |
|
Version 0.6.0 is released.https://github.com/Coding-Enthusiast/FinderOuter/releases/tag/v0.6.0.0See changelog for details. - Move to .net 5.0
- Added small icons at the bottom showing the current state of the program
- New recovery option: ELectrum mnemonics
- Base16 recovery now has more options for secondary input (to check against)
- Add a new word list to mnemonic recovery: Portuguese
As you may already know FinderOuter has always been a bitcoin recovery tool but we may add altcoin recovery options some day. By request I created a new branch for recovering Tron private keys, it can recover a hexadecimal Tron private key if you have the damaged hex and your public key or address. https://github.com/Coding-Enthusiast/FinderOuter/tree/Tron
|
|
|
|
dextronomous
|
|
December 25, 2020, 12:48:07 AM Last edit: December 25, 2020, 01:13:41 AM by dextronomous |
|
Version 0.6.0 is released.https://github.com/Coding-Enthusiast/FinderOuter/releases/tag/v0.6.0.0See changelog for details. - Move to .net 5.0
- Added small icons at the bottom showing the current state of the program
- New recovery option: ELectrum mnemonics
- Base16 recovery now has more options for secondary input (to check against)
- Add a new word list to mnemonic recovery: Portuguese
As you may already know FinderOuter has always been a bitcoin recovery tool but we may add altcoin recovery options some day. By request I created a new branch for recovering Tron private keys, it can recover a hexadecimal Tron private key if you have the damaged hex and your public key or address. https://github.com/Coding-Enthusiast/FinderOuter/tree/Tron Hi there Coding Enthusiast, got it working now, thanks again for this great piece, merry christmas,
|
|
|
|
BlackHatCoiner
Legendary
Offline
Activity: 1498
Merit: 7228
Farewell, Leo
|
|
January 07, 2021, 07:39:33 AM Last edit: January 07, 2021, 07:52:19 AM by BlackHatCoiner |
|
Is FinderOuter available for console only? I believe that it would go faster. Also question, can I run it with my gpu? I'm brute forcing an mnemonic with 10 words and it has to search among 4.1 million mnemonics. I left it all night, it seems to be in the middle.
Edit: Another question, does it searches until it finds the correct mnemonic or does it try all the possible combinations first? As I said I've reached the middle and I want to know if my chances are getting smaller.
|
. .HUGE. | | | | | | █▀▀▀▀ █ █ █ █ █ █ █ █ █ █ █ █▄▄▄▄ | ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ . CASINO & SPORTSBOOK ▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄ | ▀▀▀▀█ █ █ █ █ █ █ █ █ █ █ █ ▄▄▄▄█ | | |
|
|
|
Coding Enthusiast (OP)
Legendary
Offline
Activity: 1039
Merit: 2783
Bitcoin and C♯ Enthusiast
|
|
January 07, 2021, 03:22:46 PM |
|
Is FinderOuter available for console only? I believe that it would go faster.
No. UI isn't consuming that much CPU power, it is just a thread that will be updated every now and then. Also question, can I run it with my gpu?
Not yet. I'm brute forcing an mnemonic with 10 words and it has to search among 4.1 million mnemonics. I left it all night, it seems to be in the middle.
10 words out of how many? 2 missing out of 12 takes only an hour on my old PC, having 10 out of more like 24 is impossible to brute force. Edit: Another question, does it searches until it finds the correct mnemonic or does it try all the possible combinations first? As I said I've reached the middle and I want to know if my chances are getting smaller.
It will stop as soon as it finds the correct combination of words and prints the result.
|
|
|
|
BlackHatCoiner
Legendary
Offline
Activity: 1498
Merit: 7228
Farewell, Leo
|
|
January 07, 2021, 05:15:53 PM |
|
10 words out of how many? 2 missing out of 12 takes only an hour on my old PC, having 10 out of more like 24 is impossible to brute force. Really? It just finished after 19 hours. There are 12 words in the given mnemonic with 2 missing. A total of 4,194,304 mnemonics should be checked. Running in parallel. Elapsed time: 19:02:45.5941064 k/s= 61I must have a really slow PC.
|
. .HUGE. | | | | | | █▀▀▀▀ █ █ █ █ █ █ █ █ █ █ █ █▄▄▄▄ | ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ . CASINO & SPORTSBOOK ▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄ | ▀▀▀▀█ █ █ █ █ █ █ █ █ █ █ █ ▄▄▄▄█ | | |
|
|
|
Coding Enthusiast (OP)
Legendary
Offline
Activity: 1039
Merit: 2783
Bitcoin and C♯ Enthusiast
|
|
January 07, 2021, 05:43:33 PM |
|
I must have a really slow PC.
Sorry I should have asked about your path first, BIP39 recovery speed depends a lot on the path, doubly so in my code that has a known issue with ECC. Generally speaking the shorter your path is (eg. m/0 vs m/0/0/0/0) the faster the recovery. The more hardened indexes the path has (eg. m/0'/0'/0'/0' vs m/0/0/0/0) the faster the recovery. Additionally when the path is using hardened indexes it avoids the issue in FinderOuter so the speed goes up by a lot and it can also use the all CPU cores. To compare your PC speed with mine in the most optimal case check out the fifth example. On my corei3 CPU it barely takes 3 min (0:02:40) to check the 4.1 million cases. https://imgur.com/a/uRHbDef
|
|
|
|
BlackHatCoiner
Legendary
Offline
Activity: 1498
Merit: 7228
Farewell, Leo
|
|
January 07, 2021, 09:44:06 PM |
|
It will stop as soon as it finds the correct combination of words and prints the result. I've noticed that this works only if you've chosen "Electrum". This is what happens on BIP39: It should find the correct mnemonic on the first result. Instead it's starting this search that takes 1 day to finish.Nevermind, I had to change path equal with m/84'/0'/0'/0Generally speaking the shorter your path is (eg. m/0 vs m/0/0/0/0) the faster the recovery. What? Why should this be true? Am I missing anything? Besides, I tried it and it goes terribly slow, just like before.
|
. .HUGE. | | | | | | █▀▀▀▀ █ █ █ █ █ █ █ █ █ █ █ █▄▄▄▄ | ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ . CASINO & SPORTSBOOK ▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄ | ▀▀▀▀█ █ █ █ █ █ █ █ █ █ █ █ ▄▄▄▄█ | | |
|
|
|
Coding Enthusiast (OP)
Legendary
Offline
Activity: 1039
Merit: 2783
Bitcoin and C♯ Enthusiast
|
|
January 08, 2021, 05:55:48 AM |
|
I've noticed that this works only if you've chosen "Electrum". This is what happens on BIP39:
Whenever there is an "additional info" textbox in any of the recovery options, the result is always checked against that and the loop will break as soon as the comparison was successful. What? Why should this be true? Am I missing anything? Besides, I tried it and it goes terribly slow, just like before.
Each depth adds another round of HMACSHA512 and some small math for all index types, but also adds another EC point multiplication if the index wasn't hardened. For example m/0 only performs one additional EC mult and one HMACSHA512 compared to m/0/0/0/0 which has to perform 4 which makes it 4 times slower. Have you tried the 5 th example? Just click on Example button 5 times, and it should only take a minute to solve.
|
|
|
|
BlackHatCoiner
Legendary
Offline
Activity: 1498
Merit: 7228
Farewell, Leo
|
|
January 08, 2021, 07:35:14 AM |
|
To compare your PC speed with mine in the most optimal case check out the fifth example. On my corei3 CPU it barely takes 3 min (0:02:40) to check the 4.1 million cases. https://imgur.com/a/uRHbDefThis is me when I try the fifth example: It most likely going to take more than 2 hours. I don't get why it only takes you 3 minutes to do that on BIP39. (On electrum it takes a minute to me)
|
. .HUGE. | | | | | | █▀▀▀▀ █ █ █ █ █ █ █ █ █ █ █ █▄▄▄▄ | ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ . CASINO & SPORTSBOOK ▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄ | ▀▀▀▀█ █ █ █ █ █ █ █ █ █ █ █ ▄▄▄▄█ | | |
|
|
|
Coding Enthusiast (OP)
Legendary
Offline
Activity: 1039
Merit: 2783
Bitcoin and C♯ Enthusiast
|
|
January 08, 2021, 09:33:22 AM |
|
It most likely going to take more than 2 hours. I don't get why it only takes you 3 minutes to do that on BIP39. (On electrum it takes a minute to me)
Is your CPU older than mine? Or are you running FinderOuter in some sandbox/virtual machine that could limiting the CPU usage? If in example 5 I switch BIP39 to Electrum and change the path from m/0 back to m/0' then it only takes 11 seconds to check all combinations.
|
|
|
|
BlackHatCoiner
Legendary
Offline
Activity: 1498
Merit: 7228
Farewell, Leo
|
|
January 08, 2021, 09:38:14 AM |
|
Is your CPU older than mine? Or are you running FinderOuter in some sandbox/virtual machine that could limiting the CPU usage? If I'm not mistaken I have I-Duo Core. I'm running FinderOuter from Visual studio. The purpose is that I can't open the executable. Once I click "Yes", nothing happens. That's why I run it from visual studio.
|
. .HUGE. | | | | | | █▀▀▀▀ █ █ █ █ █ █ █ █ █ █ █ █▄▄▄▄ | ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ . CASINO & SPORTSBOOK ▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄ | ▀▀▀▀█ █ █ █ █ █ █ █ █ █ █ █ ▄▄▄▄█ | | |
|
|
|
Coding Enthusiast (OP)
Legendary
Offline
Activity: 1039
Merit: 2783
Bitcoin and C♯ Enthusiast
|
|
January 08, 2021, 10:04:57 AM |
|
I believe your CPU is slower than mine but the main reason is that you are adding bottlenecks that are significantly slowing down the application. First and biggest one is that you are running it in Debug mode which doesn't have a lot of the optimization. Switch to Released mode and you will experience a much faster run. Additionally when you run any application through V.S. it automatically attaches a debugger that will consume some CPU power and can slightly slow down the application. If you want to run it without V.S. then you either have to install .net or publish the application. Here is a walk-through: https://docs.microsoft.com/en-us/dotnet/core/tutorials/publishing-with-visual-studio
|
|
|
|
BlackHatCoiner
Legendary
Offline
Activity: 1498
Merit: 7228
Farewell, Leo
|
|
January 08, 2021, 10:24:52 AM |
|
Switch to Released mode and you will experience a much faster run. I switched it, built it and ran it from FinderOuter\Src\FinderOuter\bin\Release\net5.0\FinderOuter.exe. I tried the 5th example again. It should take few minutes, but still, it takes long.
|
. .HUGE. | | | | | | █▀▀▀▀ █ █ █ █ █ █ █ █ █ █ █ █▄▄▄▄ | ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ . CASINO & SPORTSBOOK ▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄ | ▀▀▀▀█ █ █ █ █ █ █ █ █ █ █ █ ▄▄▄▄█ | | |
|
|
|
BlackHatCoiner
Legendary
Offline
Activity: 1498
Merit: 7228
Farewell, Leo
|
|
January 17, 2021, 06:23:22 PM |
|
About the BIP39 option: Does it skip non-valid checksum mnemonics? I was wondering, because it would make brute forcing much faster. On electrum it takes much less time than on BIP39. Why does that happen?
Another question, are there wallets that generate non-valid checksum mnemonics?
|
. .HUGE. | | | | | | █▀▀▀▀ █ █ █ █ █ █ █ █ █ █ █ █▄▄▄▄ | ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ . CASINO & SPORTSBOOK ▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄ | ▀▀▀▀█ █ █ █ █ █ █ █ █ █ █ █ ▄▄▄▄█ | | |
|
|
|
Coding Enthusiast (OP)
Legendary
Offline
Activity: 1039
Merit: 2783
Bitcoin and C♯ Enthusiast
|
|
January 18, 2021, 07:37:47 PM |
|
Does it skip non-valid checksum mnemonics?
Of course it does. Example for 24 wordsOn electrum it takes much less time than on BIP39. Why does that happen?
It is because the slowest part of the code is SetBip32(...) method and it is only called when the checksum of the created mnemonic is valid. When we call it less times, the speed is going to be a lot higher. The number of times checksum is valid depends on the size of the checksum, the bigger it is the less collision occurs and SetBip32() is called less times. A 12-words BIP39 mnemonic only has a 4-bit checksum while a 12-word Electrum mnemonic has at least 8 bits of checksum (8 bits for standard type, 12 bits for other types). Back to our 5 th example duck firm october practice soccer * result regret unveil * uncle ginger child private key: L5fdNeFhX5Kgqnmbn6urPVt77eUocpbCF9f2ScEMu2HZwiFL3Viw path m/0'/ (has to be the same for all for time comparison) index: 1' (in order to make it fail and search the whole space in all cases) (no passphrase)
SetBip32() call count time BIP39 261,774 00:02:44 Electrum-Standard 16,464 00:00:12 Electrum-SegWit 1,064 00:00:02 Electrum-Legacy2FA 1,057 00:00:02 Electrum-SegWit2FA 1,015 00:00:02 The reason why the last 3 numbers are slightly different despite having the same checksum size is based on luck. Another question, are there wallets that generate non-valid checksum mnemonics?
Not that I know of.
|
|
|
|
cost203
Newbie
Offline
Activity: 8
Merit: 0
|
|
January 19, 2021, 09:59:36 AM |
|
Hi,
Does it work with Wallet.dat ?
i have a wallet.dat and btc never arrived to it...
|
|
|
|
Coding Enthusiast (OP)
Legendary
Offline
Activity: 1039
Merit: 2783
Bitcoin and C♯ Enthusiast
|
|
January 19, 2021, 11:41:05 AM |
|
Does it work with Wallet.dat ?
No. i have a wallet.dat and btc never arrived to it...
That is not a problem that a "recovery tool" can solve.
|
|
|
|
cost203
Newbie
Offline
Activity: 8
Merit: 0
|
|
January 27, 2021, 07:33:41 AM |
|
thanks,
But a wallet have not a lot of adress in it ?
in the past i go explore with python my wallet.dat and there was 50 or 100 adress in it...
|
|
|
|
Coding Enthusiast (OP)
Legendary
Offline
Activity: 1039
Merit: 2783
Bitcoin and C♯ Enthusiast
|
|
February 02, 2021, 02:10:26 AM |
|
Version 0.7.0 is released.https://github.com/Coding-Enthusiast/FinderOuter/releases/tag/v0.7.0.0See changelog for details. - General user interface improvements
- AvaloniaUI is updated to version 0.10
- Progressbar now shows the progress percentage
- A warning is added to MainWindow to inform those who build from source and forget to use -release (ie. if they run FinderOuter in Debug mode by mistake)
- Menu (help and about windows) is removed
- Examples are improved, some new ones are added and the button is now showing the count and current example index
- Recovery option descriptions are slightly improved
- Fixed a bug in mnemonic recovery option when user entered a mnemonic with no missing words
FinderOuter is 1 year old
|
|
|
|
|