Pages:
Author

Topic: VanitySearch (Yet another address prefix finder) - page 37. (Read 32072 times)

full member
Activity: 282
Merit: 114
This is not exactly the answer to my question - "Is there a number that creates a range that makes up 100% of the pool in which the prefix is located?"

However, thanks for the calculation and explanation.
What the case looks like in case of difficulties 10054102514374868992
What percentage does this number specify? (I can't find an effective calculation method myself)

I'm not sure to fully understand the question.
If I understand well, there is no way to define a group with a specific size where you are 100% sure that a given prefix is located because addresses are randomly distributed. As said in above posts, the difficulty give the probability to hit a particular prefix after 1 try, nothing more...
63% means that if you make 173346595075428800 tries, you will have 63% of chance to find the desired prefix.


So explaining in the simplest understandable way:
115792089237316195423570985008687907852837564279074904382605163141518161494336 - the size of the entire BTC range
173346595075428800 means as if every "173346595075428800" of spaces appears the prefix searched, but they are not evenly distributed across the full range (i.e. that I can search 10x the whole "173346595075428800" without finding the solution, and searching the 11th range I will find solutions eleven)?
I have scanned the continuous range of over 505000000000000000 (decimal) in order to find a solution for a vanity address with the aforementioned difficulty value with no results and this probably allowed me to understand the above ...



I just updated CUDA8 project files for VS2015.
Let me know if it is better...

Now works correctly. Thank you!



I think that the function (Base Key) greatly reduces performance. Because the search range is too narrow. Now, if it as it to disconnect! We can say that this is a useless function, since one character in 160 changes Sha 256 cardinally.

I have the opinion about this, may be not correct. I guess that the base key function is very important for securiyty reasons. Vanitysearch is a tool designed to generate desired vanity addresses. So these addresses also should be secured - for these purposes random base key is used. Without base key fuction 2 different persons could generate the same addresses if use the same prefix - let's say I generate the address starting with "1Dragon", so another person could generate the same address using vanitysearch without base key.

But anyway, if vanitysearch performance without base key is faster, it will be good be able to disable this function (only for advanced users, as it decreases the security).

PS. Without base key, by default users could use number 1 as teh starting private key. So, all different users will generate the same address if use similar prefix, because the tool increment priv key number by 1 searchig for the address.

I have a different opinion on this topic:
1. The option of manually setting BaseKey will not affect your security in any way, because manual setting has exactly the same number of combinations - how many random combinations can the machine generate.
2. The implementation of the option of manual determination (with security) should work so that by default the application generates a random key (as it does by default), while for advanced users - it gives the ability to disable the generation of BaseKey (with forced own input)
3. The above points are justified, because no one who turns off the random BaseKey mode (differently each time) consciously - will not do it to find an empty address for the purpose of storing funds for which BaseKey was used 0x00000000000000000000000000000000000000000000000000000000000000001



Now wanting to dispel doubts:
1. Do they have any impact on the functioning of VanitySearch:
- pagefile size and virtual memory settings:

- "lock pages in memory" settings from gpedit.msc:

- setting the manual value -m in VanitySearch
2. What values should I use by default to get the best working environment for VanitySearch in Windows for the ONE vanity address I am looking for?
sr. member
Activity: 462
Merit: 701
Hey
@Jean_Luc

I tried under windows 10..

seems to be the same.. everything works except loading lists..
the error message is a little different though if I use -b or not..


Hi,
Did you try older version ?
I do not manage to reproduce the issue on my hardware.
legendary
Activity: 3416
Merit: 1912
The Concierge of Crypto
There are so many "base" keys the dev can't store them all or precalculate them - such as with a master or root key - without being seen or noticed in the code.
jr. member
Activity: 41
Merit: 1
Hey
@Jean_Luc

I tried under windows 10..

seems to be the same.. everything works except loading lists..
the error message is a little different though if I use -b or not..

-b:

Code:
Vanitysearch.exe -t 5 -b -gpu -gpuId 0,1 -o found.txt -i 5000_2.txt
VanitySearch v1.16
Search: 128 addresses (Lookup size 128,[1,1]) [Compressed or Uncompressed]
Start Mon Jan 13 15:50:02 2020
Base Key: 52C72D03D79BBE9E353E4F94C4DA98D670319CAFDE77BA6CED88F869A46B78D4
Number of CPU thread: 5
GPU: GPU #1 GeForce RTX 2080 Ti (68x64 cores) Grid(544x128)
GPU: GPU #0 GeForce RTX 2080 Ti (68x64 cores) Grid(544x128)
GPUEngine: SetKeys: an illegal memory access was encountered
GPUEngine: Kernel: an illegal memory access was encountered
GPUEngine: Launch: an illegal memory access was encountered

without -b:

Code:
Vanitysearch.exe -gpu -gpuId 0,1 -o found.txt -i 5000_2.txt
VanitySearch v1.16
Search: 128 addresses (Lookup size 128,[1,1]) [Compressed]
Start Mon Jan 13 15:52:57 2020
Base Key: A710A6BA12BEFC65131BCDE3EFFE9516BE675645578DF60624F69E8A67817605
Number of CPU thread: 10
GPU: GPU #0 GeForce RTX 2080 Ti (68x64 cores) Grid(544x128)
GPU: GPU #1 GeForce RTX 2080 Ti (68x64 cores) Grid(544x128)
GPUEngine: Launch: an illegal memory access was encountered
GPUEngine: Launch: an illegal memory access was encountered/code]

newbie
Activity: 14
Merit: 0
Thanks!
sr. member
Activity: 462
Merit: 701
You must be crazy, man, to store your bitcoins on the vanity addresses generated by the tool the source code of which you are not able to read and understand.

I fully agree and the full source code of VanitySearch is public. Anybody can compile it, the code is documented, you can read it.

The base key does not alter performance. VanitySearch choose a secure random base key (if no seed specified) only once when it starts. Then private keys are incremented, 6 addresses are calculated and prefix are checked. The process is simple. You have the possibility to choose new random base keys every certain number of key using -r, but it is slower and useless because it requires extra EC mult. It does not improve the probability to find a match.
newbie
Activity: 14
Merit: 0
Can't you read? It describes the essence of the problem. And pick up expressions when writing to strangers.
jr. member
Activity: 59
Merit: 3
Good! Is there a security audit of this program? I personally can't read the code, and neither can 99 percent of users. And what if the developer of this program has implemented in the code that the basic keys are repeated. It may be a large range, so users will not notice. Then, at the appropriate time, all addresses created with this program will be emptied. So the base key is a security threat.
You must be crazy, man, to store your bitcoins on the vanity addresses generated by the tool the source code of which you are not able to read and understand.
newbie
Activity: 14
Merit: 0
Good! Is there a security audit of this program? I personally can't read the code, and neither can 99 percent of users. And what if the developer of this program has implemented in the code that the basic keys are repeated. It may be a large range, so users will not notice. Then, at the appropriate time, all addresses created with this program will be emptied. So the base key is a security threat.
newbie
Activity: 14
Merit: 0
The base key is a security risk because it narrows the search range. I would like to search for matches across the entire range of keys. This will be true randomization.
sr. member
Activity: 443
Merit: 350
I think that the function (Base Key) greatly reduces performance. Because the search range is too narrow. Now, if it as it to disconnect! We can say that this is a useless function, since one character in 160 changes Sha 256 cardinally.

I have the opinion about this, may be not correct. I guess that the base key function is very important for securiyty reasons. Vanitysearch is a tool designed to generate desired vanity addresses. So these addresses also should be secured - for these purposes random base key is used. Without base key fuction 2 different persons could generate the same addresses if use the same prefix - let's say I generate the address starting with "1Dragon", so another person could generate the same address using vanitysearch without base key.

But anyway, if vanitysearch performance without base key is faster, it will be good be able to disable this function (only for advanced users, as it decreases the security).

PS. Without base key, by default users could use number 1 as teh starting private key. So, all different users will generate the same address if use similar prefix, because the tool increment priv key number by 1 searchig for the address.
newbie
Activity: 14
Merit: 0
I think that the function (Base Key) greatly reduces performance. Because the search range is too narrow. Now, if it as it to disconnect! We can say that this is a useless function, since one character in 160 changes Sha 256 cardinally.
newbie
Activity: 14
Merit: 0
I tested not for 3 characters, but 5 or 6 characters and VanitySearch is very long looking compared to vanitygen
sr. member
Activity: 462
Merit: 701
Hi, Do you have in plan to add :
-keyspace START:END+Count
-random keyspace between START:END+Count ?

Yes keyspace START:END+Count , but i don't knwo when I will do that.

Hello! Is it possible to disable the function (Base Key). The fact is that The Base Key function reduces the search range. Despite the fact that your program is more productive than vanitygen. Vanitygen is able to find matches faster with a short prefix. How can I disable the function of the Base Key? or to configure that your program used constantly random keys for search?

VanitySearch may be less efficient for short prefixes (less than 3 char) than vanitygen. I presume it is because VanitySearch use a 16bit lookup on the hash160 to speedup the search not because keys are not random.
newbie
Activity: 14
Merit: 0
Hello! Is it possible to disable the function (Base Key). The fact is that The Base Key function reduces the search range. Despite the fact that your program is more productive than vanitygen. Vanitygen is able to find matches faster with a short prefix. How can I disable the function of the Base Key? or to configure that your program used constantly random keys for search?
jr. member
Activity: 59
Merit: 3
Yes it increments the starting priv key at each step but generates also 5 other points from it (no way to disable the 5 extra points without code mods).
To start with a specific priv key, the only way is to specify the corresponding public key using -sp option and reconstruct final key using -rp option.

If specify the corresponding public key using -sp option, the tool just adds some "unknown" number to the priv key. This is very useful for work delegation.

My question was about start search from the exact priv key. You have base key in your tool, but it is not determined as the exact 256bit number to start, it is determined by the seed. How do you receive the base key from the "-s seed" option as the starting point?
Bro, you would probably need VanitySearch-1.15.2_bitcrack for this task.
Run it like:
Code:
VanitySearch-1.15.2_bitcrack -stop -t 0 -gpu -r 10000 -s 0000000000000000000000000000000000000000000000000000000400000000 1PWCx5fovoEaoBowAvF5k91m2Xat9bMgwb
-s    - start privkey
newbie
Activity: 4
Merit: 0
In any case this program is not designed to do that, so this is just tricks and you need to modify the code.
You have to disable the 5 optimized points, to set the startKey to 0 and specify a pub key or add the appropriate option.
You have also to adjust the starting key of each thread in order to cover the desired range.
This is more or less planned but not for the moment.

Hi, Do you have in plan to add :
-keyspace START:END+Count
-random keyspace between START:END+Count ?

Thx
sr. member
Activity: 462
Merit: 701
In any case this program is not designed to do that, so this is just tricks and you need to modify the code.
You have to disable the 5 optimized points, to set the startKey to 0 and specify a pub key or add the appropriate option.
You have also to adjust the starting key of each thread in order to cover the desired range.
This is more or less planned but not for the moment.
sr. member
Activity: 443
Merit: 350
Yes it increments the starting priv key at each step but generates also 5 other points from it (no way to disable the 5 extra points without code mods).
To start with a specific priv key, the only way is to specify the corresponding public key using -sp option and reconstruct final key using -rp option.

If specify the corresponding public key using -sp option, the tool just adds some "unknown" number to the priv key. This is very useful for work delegation.

My question was about start search from the exact priv key. You have base key in your tool, but it is not determined as the exact 256bit number to start, it is determined by the seed. How do you receive the base key from the "-s seed" option as the starting point?
jr. member
Activity: 41
Merit: 1

Your git is up to date ?

yeah I made a fresh copy yesterday and compiled it, its 1.16
1.15 had the same problem though

might have the chance to run it on windows next week..
im also trying to find someone that can lend me a gtx for a bit only found a friend with a Vega 64 but this is cuda only no openCL right?
Pages:
Jump to: