I find it odd mainly because the account hasn't been touched ever since OP made that post : https://blockchair.com/bitcoin/address/1DGwqAM8mV4aJVPidoBp9Zfz8GKhAzLkma

It still holds the 25 BTC. Considering that OP has basically most of the private key, why the lack of interest in running pyhton programs in order to retrieve the missing characters?

OK, I will try to do this tomorrow.

It could also be a BIP39 seed with a one-word BIP38 password.  OP did not clarify if each file corresponds to a word in the seed so it's possible that the order is also unknown and this is no different from having one file full of words.

Actually, we don't even know which wordlist is used which makes a big difference if the seed phrase is for a custom wordlist (otherwise I would not see the point of having a file full of BIP39 or Electrum words  )
 

Ultra modern processors (AMD Ryzen/ anything using Zen microarchitecture and Intel ice lake 10xxx and later) have hardware accelerated SHA256 instructions which you can call from C using the __asm__ keyword: SHA256RNDS2, SHA256MSG1 and SHA256MSG2.

Do you know the addresses you are looking for?
I think I could change my https://github.com/PawelGorny/lostword to implement solver of your problem, but it all makes no sense if you do not know what you are looking for.

Here is how i do.
Put all words in a text file and load it into the filereader.
Split() strip() and trim() into array.
Then you rotate the words randomly and validate the resulting mnemonic.
If true verify it to the target address.

https://i.ibb.co/16k8tBb/mnemonics.png

You can also modify the autocomplete function.
This will normally 'predict' words when you start typing.
You could modify it in a way that you can type a * wildcard for the unknown letters and have it show a list with possible words from the known letter input.

https://i.ibb.co/YTtJWkc/autocomplete.png

Are you sure that this is possible? I know that for two electrum missing words, it can take around 20 seconds on an average pc. For three words it'll take 20*2048 = 40960 seconds which is equal with ~11.3 hours. But for 4 words... Oh boy. It'll take around 23,142 hours which is 964 days.

You can surely reduce it, by a lot. But still, brute forcing by not knowing 4 out of 12 words isn't meant to be found.

Are we talking 13 lists of mnemonics that don't have 4 words out of 12? It seems impossible to me the way you describe it.

Anyway, there is no program that can do your job, but if you have 13 lists of possible words then you can try FinderOuter. Instead of opening one window, open as many as you want and use a mouse scheduler for each window.

You can use Blockchair's interactive search feature by going to https://blockchair.com/bitcoin/transactions , scroll down to "Monetary", and select the filter button to the right of "Input Total (BTC)". Then there will be a box that lets you fill in the equal value, but there are also boxes for lowest and highest amounts of BTC. It even lets you filter transactions by USD amount and date/time all at once, so it's a really useful search tool.

It depends what areas are effected and also the error correction level that was encoded into the QR code.
But if the address holds funds then it can be easily found by searching the blockchain for head 1Fd3tFCqr and then see if the tail also matches.

If you look closely at the original file and the file shown as an example, we will see that it is rotated 90 degrees clockwise.
https://i.ibb.co/FXTF7sJ/Screenshot-7.jpg

Why need the code for the proof at all? Usually the only proof those kind of Piñatas require is that the coins have been successfully moved out of the target address, no?

Quoting image for reference:


First off, you need to tell us exactly which positions are already known so that valuable time is not wasted brute-forcing those positions. I see that you already have columns AA-AG and the big square at the top left, do you also know if any of the cleared squares around A9 are correct?

In your case you got 26 rows between 8 and 34, times another 26 columns between A and Z, which equals 676 different squares for you to check. In other words you're dealing with a search space of 2^676, even more enormous than the search space of bitcoin private keys.

There are some properties of QR codes that can reduce this problem size somewhat but it's still going to be too large for brute forcing.

Also, the problem solved in the freecodecamp article is fundamentally different from yours; They had a blurred QR code which they had to "unblur", but you seem to only have a fourth of your QR code and the rest of it is completely missing. The solutions used there can't be applied here, unless you actually have a blurred or low-res AR code (in which case please post it here).


Guys in this quote chain, why make it like we have to privately send the code to OP, when it can just be uploaded to Github as a public proof and so that future people can benefit from it?

I see no benefit in spending a lot of energy making something only to hide it from the public. Just look at how many threads that exist here offering bounties to decode/decrypt/unscramble/brute-force their private key and imagine how many less threads like those would be made if the existing problems were solved and the code made available.

Oh, so you want to hire someone then to write this software for you? That's quite different from "playing a game" because in that case you'd definitely need a trusted escrow.

If you're serious about it, i would advice you to sign message with address which contain 0.1 BTC or use trusted escrow to attract people & edit title of this thread to attract of more people.