Topic: VanitySearch (Yet another address prefix finder) - page 41. (Read 31225 times)

Hi there,
I'm still very busy at the moment but I will definitely restart to work on the project soon.
I'm working in a particle accelerator and we have rebuilt the storage ring. We have just started the commissioning phase yesterday.
When we will get a stable stored beam at nominal settings, I will have more time to work again on personal projects.

Please any one have cubitcrack_vanity for linux ? I just find the windows one

 Just upgraded my video card to something a little more current - an MSI RTX 2070 Windforce 2X 8G v3.0.    There are already specs on an RTX 2070 but mine come in a bit slower with stock settings.



 Loving this new VanitySearch!

So I finally went through the thread and updated this post with all the benchmarks:
https://bitcointalksearch.org/topic/m.50823897

If I missed any please let me know and I will add them.
Since Jean_Luc has been offline and not updated in a while I think the only new speed increases will be with new cards not from software updates.

-Dave

It can generate keys random in range i think, go tocode in..wrote later if i can do that

Yes I added yours to the list.
I have to go back through the thread and add a few others. Since nobody pinged out to me and Jean_Luc has been offline since August I have been slacking on doing it.
Will take care of the rest later or tomorrow.

Also, since most of the benchmarks are compressed that has been the only ones I have added to keep the datapoints even.

-Dave

VanitySearch is not for cracking, so I'm not sure you can specify a range. Those two applications generate private keys for different purposes.

Thank you JeanLuc - VanitySearch is awesome!  I don't know what took me so long to find this thread...

DaveF are you still compiling GPU stats?

Hello,
I want to try VanitySearch because I don't know why he can calculate more than Bitcrack in my GPU . but I don't know how to use VanitySearch !! how can I specify range ?
for example in bitcrack command is :

./cuBitCrack --keyspace 80000000000:FFFF0000000 ADDRESS
Please how can specify range in VanitySearch,
Thanks

Hi, can you wrote a start comand or describe how you start vanity in range? it very interesting!

Thk

It's working. It's updated for native segwit. It just doesn't have Regular Expression stuff like the original VanityGen. I want it to find compatible segwit addresses (starts with 3) that have all capitals letters. Native segwit address can easily be converted as they are not case sensitive.

FWIW I sent him an email on November 3 to let him know about the Dockerfile and thank him for his work and he never replied... I just assumed he was busy.

Has anyone heard from Jean_Luc at all?
The last time he logged in here was Aug 19th, the last time he was active on github was a few days after that.

He could have wandered off to another project, (and he did say he was getting busy) but it's rare that people just walk away like that.

-Dave

https://github.com/JeanLucPons/VanitySearch

It's literally on the OP. You can edit it, download the compiled version, download the open source version and compile it yourself. Anything, there are also several edited versions by other users here that tend to be better especially for last-gen GPUs.

Thanks a lot for this Jean-Luc, great software. And FWIW, I wrote a Dockerfile so anyone can easily and securely run it. It can be found here https://gitlab.com/iMil/vanitysearch-docker

Is there something on Github to reproduce this myself ?

He didn't add it probably because, as time has shown - he doesn't devote much time to this project ... there is no other reasonable explanation. Regardless of whether the range is random or whether I can determine it myself - the fact of proper operation is impossible to investigate, and the randomness of the range is only an additional difficulty to determine this fact. The fact of the first of the above-mentioned causes that VanitySearch is only suitable for use if you want to find yourself an individual and short prefix, and is not suitable for use in any challenge or for any profitable purposes, because if you are looking for a difficult prefix to find takes XXX days - you are not sure if he will be found. I have a modified version of VanitySearch in which I can set this range and interestingly - recently trying to check if everything works correctly in different ways - it turned out that changing the value of "max found" (-m) causes that in the same search range (on short four-character prefixes) - increasing this value causes that there are completely different prefixes ... So what is the miracle? The range is the same, and the keys and prefixes are different.


13

---

BTW. My question to the author or someone who has knowledge of the subject:
As described by VanitySearch's arguments:

- What is the default value of this parameter?
- What to consider when setting it up? (RAM, amount of core ...?)
- What are the disadvantages of increasing this parameter?
...and finally: 
- How to unitize it?
I can set this parameter to the value of 1920000000 - then I will get (scanning the same keyspace range) completely different results [also correct]!

So I dare say that if we change the value, we get different results than without this value - then with difficult prefixes the rule also works: either it will be found or it will get lost along the way for some reason

Enjoy the stoichiometry/shotgun methods.
Im out BTW , Vanitypool is basically done. Yall have at it 14 problems left. 

This is probably why the developer did not add a search for a range of keys. so that it would be impossible to track the correctness of the search for full addresses, and not vanity prefixes.

You can look through the code (it's open source!) to see if the program has a valid RNG setup or if there is rigged/flawed RNG present.