2) my own generator: 75M keys / minute (-> 6,5GB file / minute) per 1 core. I got about 175 Mkeys / minute with 4 cores. 
Topic: Vanitygen: Vanity bitcoin address generator/miner [v0.22] - page 7. (Read 1152778 times)
arulbero Could you share your program 2) my own generator: 75M keys / minute (-> 6,5GB file / minute) per 1 core. I got about 175 Mkeys / minute with 4 cores.
2) my own generator: 75M keys / minute (-> 6,5GB file / minute) per 1 core. I got about 175 Mkeys / minute with 4 cores. I have a my own generator (for Linux) that produces private key + address but not in base58 format.
I have another program in Python too that produces private key + address, I should search it. I don't remember performance, but surely much more than 1500keys/s. Are you interested?
I have another program in Python too that produces private key + address, I should search it. I don't remember performance, but surely much more than 1500keys/s. Are you interested?
This smells like jhdscript will soon open a new topic: 'Please Help! My Bitcoins have been stolen.'
My answer might be: 'Sorry for your loss'
Thanks for the trust.
Anyway my program generates only "consecutive" keys. You provide:
1) the private key to start from
2) how many keys you want to compute
and it generates the corresponding addresses (hash of public keys, not base58 encoded). This is the output if you start from key = 1:
Code:
0+0000000000000000000000000000000000000000000000000000000000000001 751e76e8199196d454941c45d1b3a323f1433bd6
1+0000000000000000000000000000000000000000000000000000000000000001 06afd46bcdfd22ef94ac122aa11f241244a37ecc
2+0000000000000000000000000000000000000000000000000000000000000001 7dd65592d0ab2fe0d0257d571abf032cd9db93dc
3+0000000000000000000000000000000000000000000000000000000000000001 c42e7ef92fdb603af844d064faad95db9bcdfd3d
4+0000000000000000000000000000000000000000000000000000000000000001 4747e8746cddb33b0f7f95a90f89f89fb387cbb6
5+0000000000000000000000000000000000000000000000000000000000000001 7fda9cf020c16cacf529c87d8de89bfc70b8c9cb
6+0000000000000000000000000000000000000000000000000000000000000001 5dedfbf9ea599dd4e3ca6a80b333c472fd0b3f69
7+0000000000000000000000000000000000000000000000000000000000000001 9652d86bedf43ad264362e6e6eba6eb764508127
8+0000000000000000000000000000000000000000000000000000000000000001 b46abf4d9e1746e33bcc39cea3de876c29c4adf3
9+0000000000000000000000000000000000000000000000000000000000000001 185140bb54704a9e735016faa7a8dbee4449bddc
a+0000000000000000000000000000000000000000000000000000000000000001 362995a6e6922a04e0b832a80bc56c33709a42d2
b+0000000000000000000000000000000000000000000000000000000000000001 dd100be7d9aea5721158ebde6d6a1fd8fff93bb1
c+0000000000000000000000000000000000000000000000000000000000000001 57526b1a1534d4bde788253281649fc2e91dc70b
d+0000000000000000000000000000000000000000000000000000000000000001 726d44b7af8228257c030bafe764d3c5839d5c02
e+0000000000000000000000000000000000000000000000000000000000000001 9fc5dbe5efdce10374a4dd4053c93af540211718
f+0000000000000000000000000000000000000000000000000000000000000001 60aa32549d990a09863b8fd4ce611ebd70bb310b
10+0000000000000000000000000000000000000000000000000000000000000001 4f99bbf75707e44bc2afa65337dece914e817aac
1+0000000000000000000000000000000000000000000000000000000000000001 06afd46bcdfd22ef94ac122aa11f241244a37ecc
2+0000000000000000000000000000000000000000000000000000000000000001 7dd65592d0ab2fe0d0257d571abf032cd9db93dc
3+0000000000000000000000000000000000000000000000000000000000000001 c42e7ef92fdb603af844d064faad95db9bcdfd3d
4+0000000000000000000000000000000000000000000000000000000000000001 4747e8746cddb33b0f7f95a90f89f89fb387cbb6
5+0000000000000000000000000000000000000000000000000000000000000001 7fda9cf020c16cacf529c87d8de89bfc70b8c9cb
6+0000000000000000000000000000000000000000000000000000000000000001 5dedfbf9ea599dd4e3ca6a80b333c472fd0b3f69
7+0000000000000000000000000000000000000000000000000000000000000001 9652d86bedf43ad264362e6e6eba6eb764508127
8+0000000000000000000000000000000000000000000000000000000000000001 b46abf4d9e1746e33bcc39cea3de876c29c4adf3
9+0000000000000000000000000000000000000000000000000000000000000001 185140bb54704a9e735016faa7a8dbee4449bddc
a+0000000000000000000000000000000000000000000000000000000000000001 362995a6e6922a04e0b832a80bc56c33709a42d2
b+0000000000000000000000000000000000000000000000000000000000000001 dd100be7d9aea5721158ebde6d6a1fd8fff93bb1
c+0000000000000000000000000000000000000000000000000000000000000001 57526b1a1534d4bde788253281649fc2e91dc70b
d+0000000000000000000000000000000000000000000000000000000000000001 726d44b7af8228257c030bafe764d3c5839d5c02
e+0000000000000000000000000000000000000000000000000000000000000001 9fc5dbe5efdce10374a4dd4053c93af540211718
f+0000000000000000000000000000000000000000000000000000000000000001 60aa32549d990a09863b8fd4ce611ebd70bb310b
10+0000000000000000000000000000000000000000000000000000000000000001 4f99bbf75707e44bc2afa65337dece914e817aac
It is only up to the user to choose which keys to generate, not up to the program.
Besides I don't think that jhdscript needs to store a so huge amount of addresses to send some bitcoin there. Maybe it is only a statistical project.
@jhdscript
I made 2 tests (writing speed, Xeon CPU E3-1505 3 GHz + SSD, Ubuntu Mate 17.04)
1) supervanitygen: about 220K keys / minute (8 threads, that confirms that vanitygen-like program are not suited to your case)
2) my own generator: 75M keys / minute (-> 6,5GB file / minute) per 1 core. I got about 175 Mkeys / minute with 4 cores.
Unfortunately if I try to compile it for Windows the results I get are not correct anymore. When I will have more time I will give it a look. For now I can't help you (unless you decide to use Linux).
Honestly I can't figure out why you need to fill an hard disk so fast. It takes about 20 hours to fill 4TB.
Hello! Could you share your program for me? For me, such a speed of geniation is like flying to the moon! I want to try this miracle program! I would be very grateful to you! Thank you very much!!!
I have a problem:
ocl vanitygen runs at a speed of 4000 Mk/s on my rig and today he printed out some thing like this - numbers are for example:
index found: 553
CPU hash: 123456789
GPU hash: 123456789
Delta found: 1234567 Delta started again: 123456
I have 2 identical hashes, but he did not sow the PrivK.
How can I get to the adress and privK with this information?
I also have the prefix of the adress, since it shows me the index number of my prefix search file.
ocl vanitygen runs at a speed of 4000 Mk/s on my rig and today he printed out some thing like this - numbers are for example:
index found: 553
CPU hash: 123456789
GPU hash: 123456789
Delta found: 1234567 Delta started again: 123456
I have 2 identical hashes, but he did not sow the PrivK.
How can I get to the adress and privK with this information?
I also have the prefix of the adress, since it shows me the index number of my prefix search file.
In August of 2018 I created 2 vanity wallets. In March 2019 they were hacked and my 1.2BTC was stolen. Don't trust vanity wallets. I used bitcoin vanity Gen. -snip-
That's the problem, you've used the scam website bitcoinvanitygen, there are a lot of scam accusations againt that website and the user who's promoting (or creator of) it.Vanity addresses are considered secured as long as there's nothing malicious in the code or your private key isn't compromised.
Link to the trust rating of the user who's promoting that site in his signature: Trust Summary: Velkro
with an average setup how long would you expect it to take before finding a vanity address like 1ELonMUSK14JSGNYAcPJNqubuFByZPyjcj? Or 1SPacex1daUkw7L6ux8Cfw7jASexb9umL?
I would be interested in that, too. Is there a calculator with which you can roughly determine how much time you need with a certain setup for a certain number of characters? I did a address generation for four characters today, which took me around 25 minutes. For a generation of six characters, I unfortunately had to quit the generation after around 4 hours.
There is a faster prefix search program called VanitySearch (developed by Jean_Luc)
Using a GTX970 GeForce GPU, the search rate went from ~40 Mkeys/s with Vanitygen to ~240 Mkeys/s by switching to VanitySearch. I was thinking about buying a second video card to increase my search capability when I stumbled on Jean_Luc's program. The program itself gave me a nearly 6X increase in speed where another $400+ GPU would have only doubled the speed. The energy savings are also amazing as I no longer need to leave the computer running for days to find the desired prefix.
Here: https://en.bitcoin.it/wiki/Vanitygen#Using_a_vanity_address_generator_to_try_to_attack_addresses
The table is based from 1Mkeys/s. Just adjust the 'average time' based on your "average set-up"
Based from that, it's 1year for 1ELonMUSK & 3hours for 1SPacex if Vanitygen is running at 1Mkeys/s.
Take note that there's luck involved in that, you can get your address within the first few minutes if you're extremely lucky as long as the difficulty isn't too high.
The table is based from 1Mkeys/s. Just adjust the 'average time' based on your "average set-up"
Based from that, it's 1year for 1ELonMUSK & 3hours for 1SPacex if Vanitygen is running at 1Mkeys/s.
Take note that there's luck involved in that, you can get your address within the first few minutes if you're extremely lucky as long as the difficulty isn't too high.
with an average setup how long would you expect it to take before finding a vanity address like 1ELonMUSK14JSGNYAcPJNqubuFByZPyjcj? Or 1SPacex1daUkw7L6ux8Cfw7jASexb9umL?
I would be interested in that, too. Is there a calculator with which you can roughly determine how much time you need with a certain setup for a certain number of characters? I did a address generation for four characters today, which took me around 25 minutes. For a generation of six characters, I unfortunately had to quit the generation after around 4 hours.
with an average setup how long would you expect it to take before finding a vanity address like 1ELonMUSK14JSGNYAcPJNqubuFByZPyjcj? Or 1SPacex1daUkw7L6ux8Cfw7jASexb9umL?
I think getting something working with an FPGA would be the likely next step.
Do you think that an FPGA would apply for this task?
Someone would need to code a implementation of this https://github.com/samr7/vanitygen/blob/master/calc_addrs.cl in Verilog. I don't know much about FPGAs but they must also choose the right pins to assign to. I like the idea though, since there should be a way to program the EC multiplications and adds for it.
I think getting something working with an FPGA would be the likely next step.
Do you think that an FPGA would apply for this task?
Over the years I've seen requests for P2SH multisignature vanity addresses.
The basic support of Vanitygen was a 1 signature out of 1 key P2SH address.
I thought it was time to add more multisignature support :-)
The code for the following proof can be found in my https://github.com/kangaderoo/vanitygen repository.
Generating two public keys for a 2 signature out of 3 keys P2SH redeem script:
Searching for the 2/3 P2SH address starting with 3P14159 (or ℼ):
./vanitygen.exe -M 2 -X 5 -j [\"02a3fdb80c5da1ceb4da75e56c900da9baf2dfde0a2d2efbf81387e5ab2e91e985\",\"03d2c632fa06281b97eba0475de8e6e4597bc19b1ce0edfb36ad889141137f7dc3\"] -v -i -F compressed 3P14159
-M --> script address needing M signatures
-X --> 5 is for bitcoin adresses starting with 3, other values could be used for alt-coins
-j [\"pubkey1\",\"pubkey2\",....,\"pubkey(N-1)\"]
--> list of keys, one key will be added by the vanitygen search to complete N keys
-v --> verbose
-i --> ignore case
-F --> public key type
Response:
Verify the generated Private Key using the keyconv utility:
./keyconv -M 2 -X 5 -C -j [\"02a3fdb80c5da1ceb4da75e56c900da9baf2dfde0a2d2efbf81387e5ab2e91e985\",\"03d2c632fa06281b97eba0475de8e6e4597bc19b1ce0edfb36ad889141137f7dc3\",\"0279600e5939f4f7baace27acefcc6191f260d23d30da8c779bc557c50eaf01751\"]
or:
./keyconv -M 2 -X 5 -C -j [\"02a3fdb80c5da1ceb4da75e56c900da9baf2dfde0a2d2efbf81387e5ab2e91e985\",\"03d2c632fa06281b97eba0475de8e6e4597bc19b1ce0edfb36ad889141137f7dc3\"]
Response:
Verification in Bitcoin-qt:
As I'm a puzzle solver, not a software professional, my github repository has a fixed setup to my personal environment and does
not automatically configure to other development environments. My personal environment also does not support OpenCL, so this
part of the code is not updated.
The basic support of Vanitygen was a 1 signature out of 1 key P2SH address.
I thought it was time to add more multisignature support :-)
The code for the following proof can be found in my https://github.com/kangaderoo/vanitygen repository.
Generating two public keys for a 2 signature out of 3 keys P2SH redeem script:
Code:
Pubkey Compressed (hex):
02a3fdb80c5da1ceb4da75e56c900da9baf2dfde0a2d2efbf81387e5ab2e91e985
Address Compressed (P2PKH):
1Q9U3bchykTsm5Ri4ZgJsgcYiBWPUSM3zE
Pubkey Compressed (hex):
03d2c632fa06281b97eba0475de8e6e4597bc19b1ce0edfb36ad889141137f7dc3
Address Compressed (P2PKH):
1BU2z1UTxmtVTrCsRWTnKuXpWXtvh9gDH3
02a3fdb80c5da1ceb4da75e56c900da9baf2dfde0a2d2efbf81387e5ab2e91e985
Address Compressed (P2PKH):
1Q9U3bchykTsm5Ri4ZgJsgcYiBWPUSM3zE
Pubkey Compressed (hex):
03d2c632fa06281b97eba0475de8e6e4597bc19b1ce0edfb36ad889141137f7dc3
Address Compressed (P2PKH):
1BU2z1UTxmtVTrCsRWTnKuXpWXtvh9gDH3
Searching for the 2/3 P2SH address starting with 3P14159 (or ℼ):
./vanitygen.exe -M 2 -X 5 -j [\"02a3fdb80c5da1ceb4da75e56c900da9baf2dfde0a2d2efbf81387e5ab2e91e985\",\"03d2c632fa06281b97eba0475de8e6e4597bc19b1ce0edfb36ad889141137f7dc3\"] -v -i -F compressed 3P14159
-M
-X
-j [\"pubkey1\",\"pubkey2\",....,\"pubkey(N-1)\"]
--> list of keys, one key will be added by the vanitygen search to complete N keys
-v --> verbose
-i --> ignore case
-F --> public key type
Response:
Code:
Pattern: 3P14159
Pubkey Compressed (hex):
0279600e5939f4f7baace27acefcc6191f260d23d30da8c779bc557c50eaf01751
Address Compressed (P2PKH):
1BU2z1UTxmtVTrCsRWTnKuXpWXtvh9gDH3
Address (P2SH):
3P14159mYzQdm5eozWLMBkaMJMxzQKu7am
Pubkey Compressed (hex):
0279600e5939f4f7baace27acefcc6191f260d23d30da8c779bc557c50eaf01751
Address Compressed (P2PKH):
1BU2z1UTxmtVTrCsRWTnKuXpWXtvh9gDH3
Address (P2SH):
3P14159mYzQdm5eozWLMBkaMJMxzQKu7am
Verify the generated Private Key using the keyconv utility:
./keyconv -M 2 -X 5 -C -j [\"02a3fdb80c5da1ceb4da75e56c900da9baf2dfde0a2d2efbf81387e5ab2e91e985\",\"03d2c632fa06281b97eba0475de8e6e4597bc19b1ce0edfb36ad889141137f7dc3\",\"0279600e5939f4f7baace27acefcc6191f260d23d30da8c779bc557c50eaf01751\"]
or:
./keyconv -M 2 -X 5 -C -j [\"02a3fdb80c5da1ceb4da75e56c900da9baf2dfde0a2d2efbf81387e5ab2e91e985\",\"03d2c632fa06281b97eba0475de8e6e4597bc19b1ce0edfb36ad889141137f7dc3\"]
Response:
Code:
P2SH (hex):
522102a3fdb80c5da1ceb4da75e56c900da9baf2dfde0a2d2efbf81387e5ab2e91e9852103d2c632fa06281b97eba0475de8e6e4597bc19b1ce0edfb36ad889141137f7dc3210279600e5939f4f7baace27acefcc6191f260d23d30da8c779bc557c50eaf0175153ae
P2SH address:
3P14159mYzQdm5eozWLMBkaMJMxzQKu7am
522102a3fdb80c5da1ceb4da75e56c900da9baf2dfde0a2d2efbf81387e5ab2e91e9852103d2c632fa06281b97eba0475de8e6e4597bc19b1ce0edfb36ad889141137f7dc3210279600e5939f4f7baace27acefcc6191f260d23d30da8c779bc557c50eaf0175153ae
P2SH address:
3P14159mYzQdm5eozWLMBkaMJMxzQKu7am
Verification in Bitcoin-qt:
Code:
createmultisig 2 "[\"02a3fdb80c5da1ceb4da75e56c900da9baf2dfde0a2d2efbf81387e5ab2e91e985\",\"03d2c632fa06281b97eba0475de8e6e4597bc19b1ce0edfb36ad889141137f7dc3\",\"0279600e5939f4f7baace27acefcc6191f260d23d30da8c779bc557c50eaf01751\"]"
Response:Code:
"address": "3P14159mYzQdm5eozWLMBkaMJMxzQKu7am",
"redeemScript": "522102a3fdb80c5da1ceb4da75e56c900da9baf2dfde0a2d2efbf81387e5ab2e91e9852103d2c632fa06281b97eba0475de8e6e4597bc19b1ce0edfb36ad889141137f7dc3210279600e5939f4f7baace27acefcc6191f260d23d30da8c779bc557c50eaf0175153ae"
"redeemScript": "522102a3fdb80c5da1ceb4da75e56c900da9baf2dfde0a2d2efbf81387e5ab2e91e9852103d2c632fa06281b97eba0475de8e6e4597bc19b1ce0edfb36ad889141137f7dc3210279600e5939f4f7baace27acefcc6191f260d23d30da8c779bc557c50eaf0175153ae"
As I'm a puzzle solver, not a software professional, my github repository has a fixed setup to my personal environment and does
not automatically configure to other development environments. My personal environment also does not support OpenCL, so this
part of the code is not updated.
Hi,
how can I use oclvanitygen for an asic mining process? Could I connect my old S3 to it? I want to speed it up, so that I can have an adress like 1isbetterthannothingthankyou...... This takes too much time right now and I want to use Asic for this task. Any ideas? Thank you.
how can I use oclvanitygen for an asic mining process? Could I connect my old S3 to it? I want to speed it up, so that I can have an adress like 1isbetterthannothingthankyou...... This takes too much time right now and I want to use Asic for this task. Any ideas? Thank you.
Nope, you can't. oclvanitygen will only work on GPU (or any CPU that support OpenCL).
I think getting something working with an FPGA would be the likely next step.
Nope, you can't. oclvanitygen will only work on GPU (or any CPU that support OpenCL).
Yes, thank you. I know. Right now I am running it on EC2/AWS using CPU and running it on a PC on GPU as well. However I thought that there may is a way to speed it up or have a more efficient way? I mean the EC2 is expensive with no result yet. After 4 months. And yes, I am considering using the IBM QS One for this. I guess that is the only speedup
How can i tell oclvanitygen to have specific ranges of privK? So that he generates for example privk(Start) 5student4ever...........1 to privk(End) 5student4ever...........9 ?
Hi,
how can I use oclvanitygen for an asic mining process? Could I connect my old S3 to it? I want to speed it up, so that I can have an adress like 1isbetterthannothingthankyou...... This takes too much time right now and I want to use Asic for this task. Any ideas? Thank you.
how can I use oclvanitygen for an asic mining process? Could I connect my old S3 to it? I want to speed it up, so that I can have an adress like 1isbetterthannothingthankyou...... This takes too much time right now and I want to use Asic for this task. Any ideas? Thank you.
Nope, you can't. oclvanitygen will only work on GPU (or any CPU that support OpenCL).
Forking this. Thanks for all your hard work! 
If we run their program or vanitygen on it, how many keys/s can it archived?
I would recommend to try it by yourself
Now, why would one need a million keys .... You might want to take a look at VanitySearch if you need an updated vanity generator.
Hi, everybody.
Tell me can I generate keys in hex format using Vanitygen?
More precisely, I need to generate millions of keys in hex format with the output of each key in a new line without any additional characters.
Tell me can I generate keys in hex format using Vanitygen?
More precisely, I need to generate millions of keys in hex format with the output of each key in a new line without any additional characters.
You don't use vanitygen for such a simple task! All you need is a simple random number generator.
https://onlinehextools.com/generate-random-hex-numbers
This does exactly what you're looking for but you would have to copy and paste them to a file.
The beauty is the website uses your computer for the calculations and there's a copy to clipboard button. Simply input the number you want ie millions and then the length in bytes 64...
Careful though, 100k took about 10 seconds on my machine - (pretty kick-ass CPU in it though it pales in comparison to some of the newer AMD options available) - and one million took around 3 minutes. Copy pasting was quick though. Here's a sample output of 10 @ 64 bytes
Code:
f8dbb4a211807d7c4ee0f2b3b6bc6d09bd5ca2905aa7336492e52dcd0701bf47
723a08ff247985f1146aa44c7201644c332c05d3e1bb4b03333c0bce3b2087f7
4e2f2c5c9e1ac2f625722543d53d86606c1caf7f4910c2a6feea08591f5b16f4
82f150ca4fbfce98781dce40d76cf0ff62fbe2eb80fba193a5e2f83be74ccaa9
bcd2656310ae4550892912e4a3b7b71be24ef576bf801a3adf0afedf497574e1
adc643900ecfeac846e81ec272e97bcf50637d791e8c36442738c9ac216418ce
5421806c8591586f3cc052482b2c1a5a5311f0f98bdcec8b4cfc50a60face784
02a96ca8378edb26df582361f7f87b18282db3640a555f5b29cad2703ebcde86
4ac41466859c92e94389168378c3a74d847080fe2a36b4f0fa7aca41554f71a4
c27685199166d8819095b8e649e8c2bb15465e17b645d12f84c5cfdcb0528ab7
More precisely, I need to generate millions of keys in hex format with the output of each key in a new line without any additional characters.
You might need Bitcrack instead of Vanitygen to do that. [Bitcointalk Thread | Github Repo]I haven't tried the software (so read the thread's previous replies for more info) but the -o or --out argument's description looks similar to what you need:
Quote from: Github - BitCrack
-o, --out FILE
Append private keys to FILE, one per line
Append private keys to FILE, one per line
Hi, everybody.
Tell me can I generate keys in hex format using Vanitygen?
More precisely, I need to generate millions of keys in hex format with the output of each key in a new line without any additional characters.
Tell me can I generate keys in hex format using Vanitygen?
More precisely, I need to generate millions of keys in hex format with the output of each key in a new line without any additional characters.
Jump to: