Topic: VanBitCracken - a program to use for 32 BTC challenge (supports RTX 30xx cards) - page 4. (Read 5673 times)

Not sure what you are really asking/maybe I am misunderstanding your question but here goes:

We will just stick with legacy public addresses, or those that start with a "1".
You can generate just under 2^256 private keys, multiplied by the gen point, that translate to a public key, an x and y coordinate.
For uncompressed, it takes both the x and y coords, adds a "04" to the beginning, and does a sha256.
For compressed, it takes the x coord and if y is even, then public key starts with 02, if odd, starts with 03; and then does a sha256.

Now, for both uncompressed and compressed, it takes the resulting public key, a sha256, and performs a ripemd-160 of the resulting sha256.

Private key(gen)
Public key(whether uncompressed "04..." or compressed "02..." or "03..."
SHA256(Public key)
RIPEMD-160(SHA256)

For the purpose of this convo, this is all we will look at.

In theory, you can have 2^160 uncompressed addresses and/or 2^160 compressed addresses. Which again, in theory, many of those will overlap, meaning you could derive an uncompressed public address from private key 14ed2324 that also is the same public address as a compressed address from private key ed83ad448367.
Again, in theory, if you generated 2^160 uncompressed public keys (generated from x and y coords, starting with 04), or if you generated 2^160 compressed public keys (using only the x coord and the y parity (odd/even), you would in theory, have created all available public bitcoin addresses starting with "1".

So I would say there are 2^160 uncompressed public addresses and 2^160 compressed addresses lol.

Hi dev, I didn't get my answer elsewhere.
So I deleted my post on another topic and reposting it here.

---

Does anyone know how many of 2^160 addresses are uncompressed? How many compressed. Is it correct to assume that there are 2^128(compressed)×2^32(uncompressed) addresses?  Whatever the correct answer is. Could we just search in 160 bit range for both un/compressed addresses with only half the performance while searching in 256 bit range is exponentially harder?

Its programmed to only show x amount of new random starting points. However big your grid size, is how many new points are generated on each rekey. If your grid size is 10x128 then you are generating 1280 new points each rekey. I can generate and run 2800x512 grid sizes and I did not want all those points, cluttering up the screen and slowing the program down any.

Do you use CPU on the random search? I just used -t 2 and my speed went up from 28 MK to 31.5 MK also the random key points increased from 4 to 6, however adding -t 4 didn't increase the speed but generated 2 more random points.

I was wondering, do random key points depend on GPU/ CPU cores or we can generate more maybe by changing grid size? Though changing grid size never generates more key points. Lol I think I just realized what parallel computing is.

No, but the kangaroo link above, that program will find x point collisions...

The tool Lolo54 and I were working on, takes a given public key and subtracts from and adds to the given public key.

Wait a minute, do you have a tool that searches for public key collisions? Can we use it on 120+ bit ranges? 🥳🥳 lol.

I just ran the command line but it doesn't work.


Nothing is happening

Try this and let me know results:

now it launches without an error message but it doesn't seem to work or am I inserting a wrong command line?


it seems that several parameters are missing for the program to run [E]
I inserted other commands same message
-p 02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630 -n 200 -b 120
-p 02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630 -n 10 -b 60 -o keysubtracter

Do me a favor, see if you can download the newest .exe and if it works...
I just uploaded a new one. I think the issue was if your PC didn't have some of the dependencies, it wouldn't work, but I added those (I think) to the exe file.

Try and see. Thanks

hi WanderingPhilospher I wanted to test https://github.com/WanderingPhilosopher/Windows-KeySubtractor/releases
but impossible error message at launch 0xc000007b I saw that many encountered this problem how to solve it?

Best on the market as far as kangaroo...but it is limited to 125 bits.

https://github.com/JeanLucPons/Kangaroo

https://github.com/JeanLucPons/Kangaroo/releases/tag/2.2

Hi, do you have a windows binary for kangaroo or something similar to that to work with public keys?

I am only searching full address, not partial string.

I used to know how to try and figure out how many leading characters in address could be in a specific range.

Maybe someone else can answer better/more accurate.

Take number of characters, minus the leading 1, 13zb1hQbW has 8 characters. Multiply that by base 58 to the power of characters; 58^8 = 128,063,081,718,016. Now divide range size by that. 2^65 / 58^8 = 288,088. So there could be up to 288,000 addresses starting with 13zb1hQbW in the #66 range.

3 days of searching only found 3 addresses starting with 13zb1hQb, while finding more than 200 addresses starting with 13zb1hQ.
My first 13zb1hQb is in 203c0df74e49 next one is in 401f8aa ( lol was testing ). Third one is in 3b650e1d66a7.
I can't really tell how rare those are considering I'm using random mode. Have you found any of those rare addresses yet? Could this mean that 13zb1hQbW when found is the only address in the entire range? Maybe I'm wrong given the small ranges I have searched.

Those ranges I posted in the file have already been checked.

As far as new ranges I run; they all come from VBCr and are random. I just capture them...was really showing people what a single small GPU could do/search in a limited time. But like I said, it's a little skill and all LUCK, IMO. But it's like the lottery, the more tickets you buy, the better your odds lol.

Of course, I might be noob in all of this but I'm not stupid.
Maybe doing that is somehow useful if others joined, so can I join the hunt as well? I just set your provided ranges and start searching or are you trying to do it solo?

I save them, when I want to see the ranges covered/checked/completed...like when I posted those files of ranges ran.

But do you understand the calculations now?

No. Lol. If I knew how to do these calculations, it'd be great,  do you save each random key or you just see it on screen?

No, those ranges are created via the random mode.

If one of the random keys generated is 0x100; and I know each thread searched 0xff keys (total keys checked / total threads), then that range searched is 0x100 + 0xff = 0x100:0x1ff or 100:1ff

Make sense?