Will give it a go!
Topic: Vanitygen: Vanity bitcoin address generator/miner [v0.22] - page 22. (Read 1152908 times)
This is really interesting, was looking for a custom BTC address.
Will give it a go!
Will give it a go!
I am still continuing that bash script for some of days and hasn't found a simple ^1Abcd type of address right now.
Something must be wrong, I just found 1Abcd in a fraction of a second. Even a slow computer should be able to quickly find this.
I am still continuing that bash script for some of days and hasn't found a simple ^1Abcd type of address right now.
does the oclvanitygen only works with amd ati readon cards ? or with nvidia cards too ?
i tried
H:\Downloads\Compressed\vanitygen-0.22-win>
it ended without giving any error, and i got popup from windows7 ,
DISPLAY DRIVER STOPPED RESPONDING AND HAS RECOVERED.
what should i do next ?
i know my gpu is not much powerfull, but still.
after more tries , i got it working.,
but i am getting almost same or more with cpu.
then i tried various grid sizes and i got this.,
i tried
Code:
H:\Downloads\Compressed\vanitygen-0.22-win>oclvanitygen.exe 1admin
Difficulty: 15318045009
Compiling kernel, can take minutes...done!
clWaitForEvents(NDRange,e): CL_OUT_OF_RESOURCES
Device: GeForce GT 610
Vendor: NVIDIA Corporation (10de)
Driver: 388.13
Profile: FULL_PROFILE
Version: OpenCL 1.1 CUDA
Max compute units: 1
Max workgroup size: 1024
Global memory: -2147483648
Max allocation: 536870912
H:\Downloads\Compressed\vanitygen-0.22-win>
it ended without giving any error, and i got popup from windows7 ,
DISPLAY DRIVER STOPPED RESPONDING AND HAS RECOVERED.
what should i do next ?
i know my gpu is not much powerfull, but still.
after more tries , i got it working.,
Code:
H:\Downloads\Compressed\vanitygen-0.22-win>oclvanitygen.exe -D0:0,grid=1024x1024 1admin
Difficulty: 15318045009
[1.40 Mkey/s][total 24117248][Prob 0.2%][50% in 2.1h] ^C
but i am getting almost same or more with cpu.
Code:
H:\Downloads\Compressed\vanitygen-0.22-win>vanitygen64.exe -k 1admin
Difficulty: 15318045009
[1.50 Mkey/s][total 17031168][Prob 0.1%][50% in 2.0h] ^C
then i tried various grid sizes and i got this.,
Code:
H:\Downloads\Compressed\vanitygen-0.22-win>oclvanitygen.exe -D0:0,grid=1598x1598 1admin
Difficulty: 15318045009
clWaitForEvents(NDRange,1): CL_OUT_OF_RESOURCES
clWaitForEvent(clUnmapMemObject,4): CL_OUT_OF_RESOURCES
Device: GeForce GT 610
Vendor: NVIDIA Corporation (10de)
Driver: 388.13
Profile: FULL_PROFILE
Device: FULL_PROFILE
Vendor: NVIDIA Corporation (10de)
Driver: 388.13
Profile: FULL_PROFILE
Version: FULL_PROFILE
Max compute units: 1
Max workgroup size: 1024
Version: OpenCL 1.1 CUDA
Max compute units: 1
Max workgroup size: 1024
Global memory: -2147483648
Global memory: -2147483648
Max allocation: 536870912
Max allocation: 536870912
Can anyone think of a clever way to distribute this: to let us search for the vanity phrases others want aswell as our own...
Thanks for this really quick vanity address generator! I`ve read everything about changes, but i`d like to know what entropy sources it uses?
Anyone here actually managed to get this to compile under Windows?
Seems every dependancy is outdatted and tons of warnings/errors.
Seems every dependancy is outdatted and tons of warnings/errors.
I've got it running on win 7 with a GTX 660ti running around 28 mil h/sec with oclvanitygen. Using the binaries linked in the original post it didn't take any tinkering.
https://i.imgur.com/epho0Rs.png
Is there anyone working on vanitygen fork to generate vanity bech32 addresses? Seems like it might be easier to get longer firstbits that make sense because it's more limited in characters.
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
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.
Hi, how can I get your program to test?
I was wondering what you guys thought of the idea of making a legitimate pool for vanity address mining. I was looking into the code for it, and it seems pretty workable.
There is one already, see: Vanity Pool - vanity address generator pool or Vanity Pool. 
I was wondering what you guys thought of the idea of making a legitimate pool for vanity address mining. I was looking into the code for it, and it seems pretty workable.
Anyone here actually managed to get this to compile under Windows?
Seems every dependancy is outdatted and tons of warnings/errors.
Seems every dependancy is outdatted and tons of warnings/errors.
I was wondering is it possible to use ASIC miners to mine custom address or does it only work with CPU?
No. Address generation requires the use of RIPEMD-160 as well as SHA-256.
I was wondering is it possible to use ASIC miners to mine custom address or does it only work with CPU?
But I am getting the following error (marked in RED),
You can manually set the number of threads to use:Code:
-t Set number of worker threads (Default: number of CPUs)
If you have 4 cores, use -t 4. Or -t 3 if your computer gets too slow.
I tried to generate a custom bitcoin address by following this tutorial > https://99bitcoins.com/how-to-get-a-custom-bitcoin-address/
But I am getting the following error (marked in RED),
so is it a normal procedure of cmd or vanitygen or it is a problem?
Kind help will be appreciated in this regard.
But I am getting the following error (marked in RED),
so is it a normal procedure of cmd or vanitygen or it is a problem?
Kind help will be appreciated in this regard.
Pretty sure people will start modding this software to optimize for the RX GPUs to try and solve those BTCs in the old 32BTC brute force private key contest.
Its almost reached the point, where brute forcing the private keys for the 0.54BTC address will yield more profit than mining ETH or ZEC.
Its almost reached the point, where brute forcing the private keys for the 0.54BTC address will yield more profit than mining ETH or ZEC.
Find the version of solidcoin addresses and use this
btw can someone response to my question a few post earlier
anyhow to modify the code to also work/search on compressed addresses
There has been someone who made this changes, and posted it in this thread. You'll have to search a bit, this thread has too many pages to quickly find back the link.anyhow to modify the code to also work/search on compressed addresses
I never used it, as I have a hard time trusting new programs that create private keys. You could at least use it to compare the source.
...The more times you try, the more likely it becomes to roll a 6.
Dice have no memory. The chance to roll a 6 is the same at every throw. So it is NOT more likely to throw a 6 the more times you try.Guys, I've asked about probability and time previously: 1, 2 and got the answer that "Dice have no memory."
Okay, but I still could not understand what does it mean on practice. And to illustrate my frustration here is the animated image (actually it is html+css).
So, I could search forever for my 1 exact 9-prefixed address?
in short, probability is theoritical calculation on possible outcomes while chance is based on luck factor
in this vanitygen case, your luck depends on random seed producing targeted pattern
thus the chance is the same everytime because you starting with random seed every time
If you're running searches for months, you may want to make a longer list of words to search for. By making a list with prefixes you may find more cool addresses in the same amount of time.
and I agree with what he said, add a few more patterns to make it worthwhileso with multiple pattern search on single run you can get your other desired patterns at once
for example: 1Thirdspace 1Th3rdspace 1Thirdsp4ce 1Th3rdsp4ce 13rdspace
if you just do single pattern, you might missed the chance hitting the other patterns
I wish I have the power to do that kind of pattern
but I was a bit lucky with 1Third address (on profile) using only cpu power
I got it in around 10-12 hour while it says 50% in 1.1d at the beginning
btw can someone response to my question a few post earlier
anyhow to modify the code to also work/search on compressed addresses
Jump to: