Topic: VanitySearch (Yet another address prefix finder) - page 9. (Read 32072 times)
Supports, I just do not know where to write and what I need to write. Here is an inscription from Github "Note: The current relase has been compiled with CUDA SDK 10.0, if you have a different release of the CUDA SDK, you may need to update CUDA SDK paths in VanitySearch.vcxproj using a text editor. The current nvcc option are set up to architecture starting at 3.0 capability, for older hardware, add the desired compute capabilities to the list in GPUEngine.cu properties, CUDA C/C++, Device, Code Generation."
Hello everyone, can you help me configure the program for searching on the GPU? Where and what to add? My graphics card gt 550ti CUDA installed version 8.
Test the "-l" argument first to see if your GPU is supported:Code:
vanitysearch -l
If yes, you just have to add the argument -gpu when searching for a vanity prefix.
Hello everyone, can you help me configure the program for searching on the GPU? Where and what to add? My graphics card gt 550ti CUDA installed version 8.
Wich version will run on a RTX3090 ?
I alwais get error when trying to run this software.
error is : GPUEngine: Launch: misaligned address
Do not use full address, if you have a full address you are looking for, delete the last 8-9 characters from the end of the address and the program will work fine on 30xx cardsI alwais get error when trying to run this software.
error is : GPUEngine: Launch: misaligned address
Seems to work.
So, if i'm trying to "hack" into a lost wallet i just delete the last 8-9 digit of this wallet and it "should" look for it ?
When using VanitySearch
What meaning about Base Key: DA12E013325F12D6B68520E327847218128B788E6A9F2247BC104A0EE2818F44 ?
What meaning about Base Key: DA12E013325F12D6B68520E327847218128B788E6A9F2247BC104A0EE2818F44 ?
The initial key from which search starts.
If the initial key would be always the same, users who search for the same prefix would receive the same results (first key which fulfils criteria).
When using VanitySearch
What meaning about Base Key: DA12E013325F12D6B68520E327847218128B788E6A9F2247BC104A0EE2818F44 ?
What meaning about Base Key: DA12E013325F12D6B68520E327847218128B788E6A9F2247BC104A0EE2818F44 ?
My brother Miha was born yesterday so I thought I can make him a vanity address with his name and give him some Bitcoin as a gift. I wonder how much it's going to be worth in 10 or 20 years. Never too early to start investing 
And the date of first transaction is his birthday which is really cool, right?
Here is his vanity address if you feel generous today and want to gift him a few sats: 3Miha3LSkHrtioPfgismPCQ6KfUa4wzPu1
I promise I will not touch this address. Ever. I will teach him all about Bitcoin when he's old enough.
And the date of first transaction is his birthday which is really cool, right?Here is his vanity address if you feel generous today and want to gift him a few sats: 3Miha3LSkHrtioPfgismPCQ6KfUa4wzPu1
I promise I will not touch this address. Ever. I will teach him all about Bitcoin when he's old enough.
Wich version will run on a RTX3090 ?
I alwais get error when trying to run this software.
error is : GPUEngine: Launch: misaligned address
Do not use full address, if you have a full address you are looking for, delete the last 8-9 characters from the end of the address and the program will work fine on 30xx cards I alwais get error when trying to run this software.
error is : GPUEngine: Launch: misaligned address
Wich version will run on a RTX3090 ?
I alwais get error when trying to run this software.
error is : GPUEngine: Launch: misaligned address
I alwais get error when trying to run this software.
error is : GPUEngine: Launch: misaligned address
But how does it reduce the range by 2^128? By using the public key
PublicKeys are symmetrical till N/2. And 2^256 /2 is 2^254. So why do you repeat the wrong number of 2^128?
I won't complicate things but they are actually symmetrical up to N/6 - not that it would help bigvito get to 2^128 though (It'd still only reduce to about 2^253.48 (N/2 actually makes it go down to 2^255 not 2^254).
But how does it reduce the range by 2^128? By using the public key
PublicKeys are symmetrical till N/2. And 2^256 /2 is 2^254. So why do you repeat the wrong number of 2^128?
So basically BitCrack2 with PubKeys.
https://github.com/kanhavishva/BitCrack2#xpoint-search-mode
But how does it reduce the range by 2^128?
https://github.com/kanhavishva/BitCrack2#xpoint-search-mode
But how does it reduce the range by 2^128?
Bitcrack and vanitysearch are not the same.
What range is this searching in? https://github.com/kanhavishva/BitCrack2#xpoint-search-mode
But how does it reduce the range by 2^128? By using the public key
So basically BitCrack2 with PubKeys.
https://github.com/kanhavishva/BitCrack2#xpoint-search-mode
But how does it reduce the range by 2^128?
https://github.com/kanhavishva/BitCrack2#xpoint-search-mode
But how does it reduce the range by 2^128?
Kangaroo is cracking the discrete Logarythm of the pubkey. VanitySearch is looking for Prefixes which are pubkeys sha256 and ripemd160.
How do you want to mix those?
How do you want to mix those?
Can you search for an address with vanitygen with a public key? I was thinking would that be able to shorten the search space like kangaroo.
Not 100% sure with vanitygen but vanity search takes inputted address and converts it to its RIPEMD160, then searches for a match for the RIPEMD160. One could tweak code to search for a pubkey which would save one sha256 and the one RIPEMD160 function.Priv key
Pub key
sha256
ripemd160
so you would save two functions but I am not sure on the speed gained since normally, the most time consuming part. whether its CPU or GPU. is doing the math from priv key to pub key.
Kangaroo is cracking the discrete Logarythm of the pubkey. VanitySearch is looking for Prefixes which are pubkeys sha256 and ripemd160.
How do you want to mix those?
How do you want to mix those?
Anybody thought about making VanitySearch search with a public key to decrease the search range to 2^128 like how kangaroo is but looking for prefixes?
I could make test with this code in Bitcrack version, it really writes pkey to the output file,
but how can I make a test with the original version of VanitySearch?
Code:
>VanitySearch-1.15_bitcrack -stop -t 0 -gpu -r 10000 -s 0000000000000000000000000000000000000000000000000000000A00000000 1CABDYTie48wXV93XJ4Bdk7MFSTyshTXxg
but how can I make a test with the original version of VanitySearch?
Friends, one question, does the Vanity run faster on linux or on Windows?
I currently use it on Windows and I am wondering if it is worth using it on Linux.
Thanks in what can help me
I currently use it on Windows and I am wondering if it is worth using it on Linux.
Thanks in what can help me
i repeat this question, please help me.
Thanks,
from my experience there is no big difference, so you can use both OS.
Thanks for your reply.
Then I will not complicate and I will continue in w10
Friends, one question, does the Vanity run faster on linux or on Windows?
I currently use it on Windows and I am wondering if it is worth using it on Linux.
Thanks in what can help me
I currently use it on Windows and I am wondering if it is worth using it on Linux.
Thanks in what can help me
i repeat this question, please help me.
Thanks,
from my experience there is no big difference, so you can use both OS.
How would I create a 128 bit unsigned data type in int.cpp?
Jump to: