VanitySearch (Yet another address prefix finder)

[WanderingPhilospher]

is your card an LHR model/version?

Yes, I just saw that.  

But I understand that all of the 30 series are.

No, none of my 3070s are LHR. They were part of first batches before companies decided to nerf them. Also, I do believe that all Founder's Editions cards will not implement LHR.

Honestly, that is the only thing I can think of now...unless it's something odd that I haven't read or experienced before.

[NotATether]

No, none of my 3070s are LHR. They were part of first batches before companies decided to nerf them. Also, I do believe that all Founder's Editions cards will not implement LHR.

Honestly, that is the only thing I can think of now...unless it's something odd that I haven't read or experienced before.

Do you have any LHR cards lying around so you can make a vanitysearch benchmark between LHR and non-LHR cards?

Surely, somebody had to have run some tests with them by now. Though it doesn't sound like NVIDIA would nerf Vanitysearch (it sounds like they are only nerving stuff like arith ops).

[WanderingPhilospher]

No, none of my 3070s are LHR. They were part of first batches before companies decided to nerf them. Also, I do believe that all Founder's Editions cards will not implement LHR.

Honestly, that is the only thing I can think of now...unless it's something odd that I haven't read or experienced before.

Do you have any LHR cards lying around so you can make a vanitysearch benchmark between LHR and non-LHR cards?

Surely, somebody had to have run some tests with them by now. Though it doesn't sound like NVIDIA would nerf Vanitysearch (it sounds like they are only nerving stuff like arith ops).

I do not have any LHR cards.

Right, I am wondering if there is something in Vanitysearch that is similar to an eth miner/ethash algo.

[WhyFhy]

In regards to 3000 series cards and LHR
If it isn't memory intensive it's probably not throttled.
Where technically along the lines of sha256 witch is not memory intensive at all.
I have non lhr cards as well that simply don't perform as expected on VS it could be user error but as long as I've been using this program I dont think so.
For now to me tesla's still dominate VS.
I tried a a100 and couldn't get it to work at all.

[Andre_25]

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

[eozdem]

I have doubt, if it is starting from 1 each time I start, or it is starting from a random private key ...

Code:

./VanitySearch -o /content/drive/MyDrive/sonuc.txt -gpu -i /content/drive/MyDrive/rch.txt -stop -r 100000

Code:

VanitySearch v1.15.4, add BitCrack mode
[keyspace] start=                                                               1
[keyspace]   end=FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140
Search: 46 addresses (Lookup size 46,[1,1]) [Compressed]
Start at Fri Sep 24 13:14:17 2021
Number of CPU thread: 1
GPU: GPU #0 Tesla P100-PCIE-16GB (56x64 cores) Grid(448x512)

[WanderingPhilospher]

I have doubt, if it is starting from 1 each time I start, or it is starting from a random private key ...

Code:

./VanitySearch -o /content/drive/MyDrive/sonuc.txt -gpu -i /content/drive/MyDrive/rch.txt -stop -r 100000

Code:

VanitySearch v1.15.4, add BitCrack mode
[keyspace] start=                                                               1
[keyspace]   end=FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140
Search: 46 addresses (Lookup size 46,[1,1]) [Compressed]
Start at Fri Sep 24 13:14:17 2021
Number of CPU thread: 1
GPU: GPU #0 Tesla P100-PCIE-16GB (56x64 cores) Grid(448x512)

1, every time. The -r flag you are using (-r 100000) is for rekey, not random. So once your GPU checks 100,000,000,000 keys, the threads will shift up by 100,000,000,000/# of threads.

[eozdem]

I have doubt, if it is starting from 1 each time I start, or it is starting from a random private key ...

Code:

./VanitySearch -o /content/drive/MyDrive/sonuc.txt -gpu -i /content/drive/MyDrive/rch.txt -stop -r 100000

Code:

VanitySearch v1.15.4, add BitCrack mode
[keyspace] start=                                                               1
[keyspace]   end=FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140
Search: 46 addresses (Lookup size 46,[1,1]) [Compressed]
Start at Fri Sep 24 13:14:17 2021
Number of CPU thread: 1
GPU: GPU #0 Tesla P100-PCIE-16GB (56x64 cores) Grid(448x512)

1, every time. The -r flag you are using (-r 100000) is for rekey, not random. So once your GPU checks 100,000,000,000 keys, the threads will shift up by 100,000,000,000/# of threads.

So how can I force it to start from a random key?

[WanderingPhilospher]

I have doubt, if it is starting from 1 each time I start, or it is starting from a random private key ...

Code:

./VanitySearch -o /content/drive/MyDrive/sonuc.txt -gpu -i /content/drive/MyDrive/rch.txt -stop -r 100000

Code:

VanitySearch v1.15.4, add BitCrack mode
[keyspace] start=                                                               1
[keyspace]   end=FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140
Search: 46 addresses (Lookup size 46,[1,1]) [Compressed]
Start at Fri Sep 24 13:14:17 2021
Number of CPU thread: 1
GPU: GPU #0 Tesla P100-PCIE-16GB (56x64 cores) Grid(448x512)

1, every time. The -r flag you are using (-r 100000) is for rekey, not random. So once your GPU checks 100,000,000,000 keys, the threads will shift up by 100,000,000,000/# of threads.

So how can I force it to start from a random key?

The easiest way without recoding yourself, or using my version, is to create a new start range each time you want to start from a different key.

[Andre_25]

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 repeat this question, please help me.
Thanks,

[Trancefan]

How would I create a 128 bit unsigned data type in int.cpp?

[eozdem]

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 repeat this question, please help me.
Thanks,

from my experience there is no big difference, so you can use both OS.

[Andre_25]

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 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

[eozdem]

I could make test with this code in Bitcrack version, it really writes pkey to the output file,

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?

[bigvito19]

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?

[a.a]

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?

[bigvito19]

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?

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.

[a.a]

So basically BitCrack2 with PubKeys.

https://github.com/kanhavishva/BitCrack2#xpoint-search-mode

 But how does it reduce the range by 2^128?

[bigvito19]

So basically BitCrack2 with PubKeys.

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

[a.a]

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?