I do not understand how to use this on windows. The instruction is not intelligible.

[sjorso]

I do not understand how to use this on windows. The instruction is not intelligible.

[SjorsO]

Sorry, can't help you with that

[fredsta98]

https://github.com/fredsta98/keys-generator-binaries for the binaries.

1. Download the version that suits your laptops architecture.
2. Add the file keys-generator.exe to your system path: https://www.architectryan.com/2018/03/17/add-to-the-path-on-windows-10
3. Use command: keys-generator btc (replace with an actual number of whichever page you want to generate for.

[Tamago4a]

https://github.com/fredsta98/keys-generator-binaries for the binaries.

1. Download the version that suits your laptops architecture.
2. Add the file keys-generator.exe to your system path: https://www.architectryan.com/2018/03/17/add-to-the-path-on-windows-10
3. Use command: keys-generator btc (replace with an actual number of whichever page you want to generate for.

I found more interesting software. https://www.youtube.com/watch?v=0_73zW86c-8

[fredsta98]

Doesn't seem very efficient, you're better off using the this as a generator, you can get this project to generate 10k keys/second I did the benchmarks last night. Then parsing those to a python script, and checking a larger dataset of keys. I'm currently building a script like that although looking at Go's performance, I think adding the functionality to this code base and running it on a loop might be more efficient than python, let me know if you'd be interested.

[Tamago4a]

Doesn't seem very efficient, you're better off using the this as a generator, you can get this project to generate 10k keys/second I did the benchmarks last night. Then parsing those to a python script, and checking a larger dataset of keys. I'm currently building a script like that although looking at Go's performance, I think adding the functionality to this code base and running it on a loop might be more efficient than python, let me know if you'd be interested.

The script shown in the video generates keys. With the help of keys, wallet addresses are generated. If something from what was generated matches what is in the key database with a balance (you must download and process it in advance), then you get an address and a key pair. Works very well. I recommend to try. If you don't understand what to do, I can explain.

[fredsta98]

Well, ok I get it, I watched the video. But I've already done scripts like these in python, issue with python is its a little slow. Max amount I've managed to do is round about 2 billion keys/day. That's 24hrs mate... There are 2^256 - 2^160 possible private keys for each address (2^90). Divide that by 2 billion you realize just how slow that is, and my scripts were multithreading on xeon CPUs. With this though I made a script that does the same in 2 hours on an HP Spectre, and used the same database that guy used to search for addresses with a balance, I'll create a repo with the code and publish in round about 24hrs, with both linux and windows binaries, and clear instructions. It's a lot faster than what that guy was show casing.

[Tamago4a]

Well, ok I get it, I watched the video. But I've already done scripts like these in python, issue with python is its a little slow. Max amount I've managed to do is round about 2 billion keys/day. That's 24hrs mate... There are 2^256 - 2^160 possible private keys for each address (2^90). Divide that by 2 billion you realize just how slow that is, and my scripts were multithreading on xeon CPUs. With this though I made a script that does the same in 2 hours on an HP Spectre, and used the same database that guy used to search for addresses with a balance, I'll create a repo with the code and publish in round about 24hrs, with both linux and windows binaries, and clear instructions. It's a lot faster than what that guy was show casing.

What you say sounds good. I have been looking for such scripts for a long time. It seemed to me that this script demonstrated in the video could no longer be found more ideal.

[fredsta98]

Well, ok I get it, I watched the video. But I've already done scripts like these in python, issue with python is its a little slow. Max amount I've managed to do is round about 2 billion keys/day. That's 24hrs mate... There are 2^256 - 2^160 possible private keys for each address (2^90). Divide that by 2 billion you realize just how slow that is, and my scripts were multithreading on xeon CPUs. With this though I made a script that does the same in 2 hours on an HP Spectre, and used the same database that guy used to search for addresses with a balance, I'll create a repo with the code and publish in round about 24hrs, with both linux and windows binaries, and clear instructions. It's a lot faster than what that guy was show casing.

What you say sounds good. I have been looking for such scripts for a long time. It seemed to me that this script demonstrated in the video could no longer be found more ideal.

[email protected] email me, I'm only at an alpha working version I thought I'd be done days ago. You can test it out if you like though... I created several versions for windows, one that uses this repository as a backend, one that uses vanitygen, and one that in a sense uses what the guy in the video was doing a demo on. If setup on a GPU enables VPS/RDP/Server it runs pretty damn fast. But even with the colab versions, running CPU computations these are churning out quite a lot, and using the same architecture in the sense of using that tsv file as a database for the outputs.

Working on this just gives more of an appreciation for elliptic curve cryptography though... I've generated over 50 trillion keys so far and gotten 0 bites out of 300k+ possible addresses. Study the maths of it all, technically you could land one with a balance the odds though (despite 2^90 private keys able to open 1 address...) are so small it's improbable but not entirely impossible given time and resources... lots of both