Why the need to use an online wallet? Maybe it was good back in the days where we could play around with some faucets and send them to our online wallet, but it's not safe to use them for more than a few k sats. Easiest way to have an address without downloading a wallet is using bitaddress.org using a browser in guest mode and disconnecting the net, generating keys, saving then, closing the browser. Then you could reconnect, but this is still for small amounts, for large amounts produce your keys on a system that never connects to the net and don't print or save the keys on flash drives, just carefully write them down, this is the best way.

You should also use electrum instead.

I got what you said about how it works, I have a problem with the results I have got, for example:
dc629ccec8a0c3c53e5a0707021a0053a325720e3321f5fb6db3f9339eac23f7 #+ 184ffe30916bcf90fdba43677100000  and I used -s, which means I have to actually add, but add what to what and how?

---

Edit, one other thing, how does this adding and subtracting exactly work? Is it done using integers or hex and why do I get different results when I use decimal values to add and subtract? Could you explain this please?

Not that one, I meant the one from Jean Luc, which could be used to search for rmd160 prefix. About the puzzle 66, if we knew the checksum for it's WIF for example, we could narrow down our search space.

What now? I just double clicked on the bat file a few times, each time it finished in less than a second so I changed things and ran it again until I saw the output file is full.

Now you say #target is my input, but why is it in my output file and why did the tool add + to them instead of subtracting? Because I selected -s only.

I have 3 #targets, one of them is derived from 64 hex string and 2 of them are from 31 char hex string, should I search the one leading to the target?

And why does it select the additions like this : eeeeeeeeeeeeee434343434343, did you just hit the keyboard for add/sub selection or is it doing it by itself?

Wow, do any of you guys know the addresses holding these lost coins? I might be able to work something out, but first I need to make sure that I'm not going after cold wallets of other people,  however after finding these lost coins I will share a percentage of the prize which hopefully the owners of those coins will give me, with anyone sharing intel on lost coins.

Cool story bro, didn't work I guess elliptic curve is forbidden for people from my part of the woods. Could you make something that would visually display your private key and how it corresponds to x and y on the curve, like clicking on a random point on the graph( interactive) and watching everything in real time!

Read back the previous pages, I have explained how to find them with 100% certainty, there is no other proof that I know of, and what I have explained is good for sha256 and rmd160, I was unable to even understand what does (sha256(rmd160) mean, but I know what does sha256 double collision mean, having 2 different inputs generating 2 different first hash but having identical second hash, that's a bit (very) hard to construct a sure method.

However, every problem has not one but many solutions, and in order to find them you need no computational power at first, what you need is to come up with an algorithm to perform a task and then you let the computer to do the heavy work. For now the safety of all hash functions and elliptic curves depend on DLP.
~dig.

@Op, in the output file I have several #targets, is that what we are looking for? How do I derive the private key now?

First of all ouch! Secondly, doing things on our own will never work, team work efforts is the answer, that's why it's called a community.
Guess I will have to go for btccollider then.

They already exist, we just don't know whether they have been found and are being exploited or not, however if they become publicly known then we'd be sure they can be exploited, thus requiring a major change which will render all miners useless, this is what worries me.

Where is this keyhunt cuda? You mean the one you removed from your repo? Well I have been looking for any length  prefix finder for rmd160, now you are telling me that my mentor had this tool all this time?🙂 please release the offline cuda version🥳.

---

Btw, what is this Zahid dude doing around these woods? You guys think we should get him some medical help? Lol I mean what are you doing man? Goose chase? 😅

Guess that explains why the following inputs have the same hash:
"ffffffffffffffffffff000000"  ,  "ffffffffffffffffffff00000". =
"02de980e731d160a92b4f41fe07d1b2763f167906db488e4cd380f3936e51ff4". The software I use is a broken open source implementation.😉

Question regarding hash functions:
Do they all operate based on 2 character set hexadecimal or we can hash a single hex character as well?
I'm asking this because I have found 2 strings with only 1 character difference having the same digest, maybe it's a bug?
Like if they are not supposed to give you any hash for a single bit, then all the 16 bit hex chars used bit by bit should never produce a hash while they do, so why is it when I use a 30 long char hex string and a 31 long char string they both produce the same output?

*For example: "1234567890" and "12345678901" give me the same output.

*=Fake example.

Real example: "1" and "01" give this "4bf5122f344554c53bde2ebb8cd2b7e3d1600ad631c385a5d7cce23c7785459a"

Am I missing something?
And please don't tell me the algorithm pads a 0 to 1 when we only use 1 as input, because I have 2 strings not starting with a 0 but have the same hash.

Hey man I'm back again, as I explained earlier I can't use GPU, because CUDA is not compiled or something, I have a ccap 5 and CUDA 12, but I tried to compile your WIFsolver CUDA few month ago and was unsuccessful. I can't keep coming to you everytime I need compiling, it's not your job but it would mean a lot if it's not a bother to release a compatible version for ccap 5.🤝👍

---

Lol my cute kangaroos are dying using CPU, I haven't fed them properly with strong GPU computation.😉

---

You know I was thinking today about something interesting, since you know programming I will share it here to see if we could come up with something.
You know that hexadecimal characters are used to set colors on the web, right? I was wondering if it would be possible to develop a tool capable of linking the hexadecimal values of public keys to their actual private keys by color encoding them in synchronization, so for example we could invent an algorithm to find similarities and match them with certain colors, then we could find clues about the private key of a certain public key by encoding the public key using our invention.

Imagine integrating that algo with kangaroo or baby step giant step, and then use strides to detect color hues  similar to our public/ private key pair.

But I guess that would destroy modern cryptography systems if it was possible.😅

Move a small amount and wait to see if the funds move, if they didn't move for months, try to move the rest but not at once, and then wait and research about a possible owner, sometimes people who have lost their coins go around and talk about it, so there should be some chatter on social medias.

Eventually if after a year no one claimed them, you should give 1/5 to charity and take the rest.(this assumes the funds have no owner).

Don't use address prefix because it will slow down your search, when you give a prefix of an address the program will generate private keys, derives their public keys, hashes the public key twice and then performs another double hash on the rmd160 hash to derive the address and then checks to see if the prefix matches with your desired prefix.
You should find a tool that searches for rmd160 prefix. I haven't seen any tool searching for such prefixes, they either search for the whole hash or just slow you down by searching for prefix match on addresses. Why are you using CPU? it's a waste of time, you should use GPU only.

I would remove centralized garbage coins such as ETH, Ripple etc from the basket, because we don't want our precious gold and silver coins to touch garbage.😉

I have a serious question, why can't we determine the range of a given private key by looking at the derived public key? Why is it so hard? I mean we practically know the range of all private keys and their public keys, I haven't figured it out yet as to why we can't easily map public keys to private keys, it's not magic but only math, even if it was magic we could nullify it. But since it's mathematics I would say all the answers are in "Permutation" equation, other than that there is no mathematic solution. So chop chop dear developers, get to work, we've got mouths to feed.🤣

---

You were actually right about this, I was assuming you were talking about searching for prefix before the hash operation completes, lol. But indeed it would be the fastest method to search for rmd160 prefix because it saves us a double sha256 hash.😉
And don't listen to some developers claiming their tools already do that, because they don't, otherwise why there is no option to set our desired rmd160 prefix? Because they all generate addresses from scratch and either check for a whole address match or for an address prefix, slowing down the process, I think we need some professional devs, these devs are rookies.🙃

You know I was wondering, when I try to search for 7 char prefix by entering only 7 characters, and by searching for the full address I get the same speed and performance.

Unless programs such as vanity and bitcrack can magically turn 7 characters into a complete rmd160 hash and just search for the hash instead of address, then I can't see a reason as to why searching for full address and 7 char prefix would have the same speed.

According to you those tools decode the address we give them and then only search for the rmd160, decoding the prefix of an address gives no clue about the actual rmd160 hash of said address, therefore they all are hashing the rmd160 twice with sha256 algo in order to find the correct checksum, hence slowing down the process.

What? 🤔😂. Where should we store the blockchain data then, on RAM? Hashing needs computational power >CPU, People need to verify data on their own>Blockchain data on storage device. Ram is just a temporary and fast storage device.