Pages:
Author

Topic: VanitySearch (Yet another address prefix finder) - page 12. (Read 32966 times)

full member
Activity: 1232
Merit: 242
Shooters Shoot...
Hello again guys
I leave a new question, please help me to understand.

I am trying multiple options when I launch the vanitysearch, and I realize that if I "execute" it with -t 0 (which is the same as using it without a processor, and therefore, it would only be with a video card) it does not find anything, even after 10 minutes

Testing with a list of 1,000,000 prefixes, each with a size of 9 letters.

on the contrary, if I try with -t 6, there if I find values. (an average of 1 every 10 seconds)

Could it be that in the end only my processor works and not the gpu?
Shouldn't I find something with GPU alone?
thanks
The short answer, yes, you should find something with GPU, especially if you are finding it with CPU.
Long answer, we would need to see your full command line/batch script flags that you are using.
newbie
Activity: 18
Merit: 7
Hello again guys
I leave a new question, please help me to understand.

I am trying multiple options when I launch the vanitysearch, and I realize that if I "execute" it with -t 0 (which is the same as using it without a processor, and therefore, it would only be with a video card) it does not find anything, even after 10 minutes

Testing with a list of 1,000,000 prefixes, each with a size of 9 letters.

on the contrary, if I try with -t 6, there if I find values. (an average of 1 every 10 seconds)

Could it be that in the end only my processor works and not the gpu?
Shouldn't I find something with GPU alone?
thanks
newbie
Activity: 18
Merit: 7
Quote from: WanderingPhilospher


You can play around with the grid size to see if you can tweak out more MKey/s, but here's the deal, IMO, most of these programs were releases prior to 30xx cards so the programs probably do not best optimize the use of the cards GPU structure. I have only used one program that did and that was an OpenCL program versus Cuda.

thanks again friend.
full member
Activity: 1232
Merit: 242
Shooters Shoot...
Quote
Why does appear (38X0 cores) ?
help me please understand a little.

The code was built before the new cards came out. If you want to adjust, go into GPUEngine.cu and change the code to this:

Code:
sSMtoCores nGpuArchCoresPerSM[] = {
      {0x20, 32}, // Fermi Generation (SM 2.0) GF100 class
      {0x21, 48}, // Fermi Generation (SM 2.1) GF10x class
      {0x30, 192},
      {0x32, 192},
      {0x35, 192},
      {0x37, 192},
      {0x50, 128},
      {0x52, 128},
      {0x53, 128},
      {0x60,  64},
      {0x61, 128},
      {0x62, 128},
      {0x70,  64},
      {0x72,  64},
      {0x75,  64},
      {0x86,  128},
      {-1, -1} };

The {0x86,  128}, part is what will update and show you the proper grid size for your newer graphics card.

Ok, thank you very much for answering.
With that, as I understand it, I will allow to show the correct number of cores, but then the current results, with the 3060 ti are less than the 2080, for example? or do I still need to correct something in it to get better results?

Thanks again!
You can play around with the grid size to see if you can tweak out more MKey/s, but here's the deal, IMO, most of these programs were releases prior to 30xx cards so the programs probably do not best optimize the use of the cards GPU structure. I have only used one program that did and that was an OpenCL program versus Cuda.
newbie
Activity: 18
Merit: 7
Quote
Why does appear (38X0 cores) ?
help me please understand a little.

The code was built before the new cards came out. If you want to adjust, go into GPUEngine.cu and change the code to this:

Code:
sSMtoCores nGpuArchCoresPerSM[] = {
      {0x20, 32}, // Fermi Generation (SM 2.0) GF100 class
      {0x21, 48}, // Fermi Generation (SM 2.1) GF10x class
      {0x30, 192},
      {0x32, 192},
      {0x35, 192},
      {0x37, 192},
      {0x50, 128},
      {0x52, 128},
      {0x53, 128},
      {0x60,  64},
      {0x61, 128},
      {0x62, 128},
      {0x70,  64},
      {0x72,  64},
      {0x75,  64},
      {0x86,  128},
      {-1, -1} };

The {0x86,  128}, part is what will update and show you the proper grid size for your newer graphics card.

Ok, thank you very much for answering.
With that, as I understand it, I will allow to show the correct number of cores, but then the current results, with the 3060 ti are less than the 2080, for example? or do I still need to correct something in it to get better results?

Thanks again!
full member
Activity: 1232
Merit: 242
Shooters Shoot...
Quote
Why does appear (38X0 cores) ?
help me please understand a little.

The code was built before the new cards came out. If you want to adjust, go into GPUEngine.cu and change the code to this:

Code:
sSMtoCores nGpuArchCoresPerSM[] = {
      {0x20, 32}, // Fermi Generation (SM 2.0) GF100 class
      {0x21, 48}, // Fermi Generation (SM 2.1) GF10x class
      {0x30, 192},
      {0x32, 192},
      {0x35, 192},
      {0x37, 192},
      {0x50, 128},
      {0x52, 128},
      {0x53, 128},
      {0x60,  64},
      {0x61, 128},
      {0x62, 128},
      {0x70,  64},
      {0x72,  64},
      {0x75,  64},
      {0x86,  128},
      {-1, -1} };

The {0x86,  128}, part is what will update and show you the proper grid size for your newer graphics card.
newbie
Activity: 18
Merit: 7
Hi friends,
I wish you a nice day

I recently started testing vanitySearch, and I am realizing that the 3060 TI card is not getting enough values ​​that I would unknowingly expect.
 I have seen, in this message (https://bitcointalksearch.org/topic/m.57116410), that the 2080 TI reaches 2500 MK / s (approximately) and the 2080 super reaches 2000 MK / s. in my case, and testing the 3060 TI, it doesn't even reach 2000.
because it can be?

Code:
VanitySearch.exe -gpu -t 0 1testme1
VanitySearch v1.19
Difficulty: 51529903411245
Search: 1testme1 [Compressed]
Start Sun Sep 12 20:40:48 2021
Base Key: 2CAF27F4DBD746225EBC883505540087E7CF680E05B35CEF9253A6C1D4603E65
Number of CPU thread: 0
GPU: GPU # 0 NVIDIA GeForce RTX 3060 Ti (38x0 cores) Grid (304x128)
[1791.73 Mkey / s] [GPU 1791.73 Mkey / s] [Total 2 ^ 33.36] [Prob 0.0%] [50% in 05:31:45] [Found 0]

Why does appear (38X0 cores) ?
help me please understand a little.
Thank you
newbie
Activity: 1
Merit: 0
Hello Guys, I write this message to ask something.
putting the VanitySearch to the test, I get the following message:

vanitysearch.exe -b -gpu -o general9.txt -i baseAdd6.txt
[Loading input file 100.0%]
VanitySearch v1.19
[Building lookup16 99.8%]
[Building lookup32 100.0%]
Search: 202467 prefixes (Lookup size 60223) [Compressed or Uncompressed]
Start Mon Sep 6 15:14:52 2021
Base Key: 45F1AF1EFE0B031DDAD00BF1E7D68B9A38CFA0C8B649B09CBCC70349976725B0
Number of CPU thread: 3
GPU: GPU #0 NVIDIA GeForce 930MX (3x128 cores) Grid(24x128)

Warning, 34623463 items lost
Hint: Search with less prefixes, less threads (-g) or increase maxFound (-m)
[15.83 Mkey/s][GPU 15.58 Mkey/s][Total 2^30.87][Prob 0.2%][50% in 10:46:14][Found 14]

Can you do me a favor and guide me a bit about the following:

1. (Warning, 34623463 items lost) How to avoid these losses?
2. the input -m is not clear to me, because, for example, if I put -m 10, it gives me a better performance, something like [25.39 Mkey / s], but if I leave that field empty, it throws me, like you can see, around [15.8 Mkey / s]. which should be then, the correct -m?

Thank you
legendary
Activity: 1092
Merit: 1125
(SOLUTION BELOW)
Hey there, I have a question:
I created an address with vanity search.
I used the bc1q prefix and vanity search gave me a Priv(WIF) Key and a Priv(HEX) Key. I can't load either of those into my Wallet (using BlueWallet on iOS).
Do I have to do anything with those keys or can I only import them to certain wallets ?

I never used Electrum before but I decided to download the standalone .exe and imported the whole private key "p2wpkh:..." and electrum seems to get it and also shows the correct receiving address. Can anyone tell me if there's an ios wallet capable of importing these keys ?

EDIT: On another thread I started, o_e_l_e_o was kind enough to help me fix this problem. You need to load a few sats onto the correct wallet so the app (BlueWallet in my case) will be able to determine the right address you want to import.

If I remember correctly, when you import a private key in to BlueWallet it scans all the relevant addresses looking for which one has been used, and then imports that one. If it finds none of them have been used, it defaults to the nested segwit (P2SH-P2WPKH) address, which will start with a 3.

Have you ever used this vanity address? It might be that you need to send some funds to it before you can import it to BlueWallet.

Edit: Just had a look through the code and it looks like I'm right, except it will default to a legacy address beginning with a 1 if it finds no used addresses. You can see the code here if you are interested: https://github.com/BlueWallet/BlueWallet/blob/master/class/wallet-import.js#L250-L268
full member
Activity: 1232
Merit: 242
Shooters Shoot...
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.
full member
Activity: 706
Merit: 111
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.
jr. member
Activity: 75
Merit: 2


For one thing, "human" randomness is not random enough since we just replace numbers with more predictable ones, unlike a computer. And I'd be hard-pressed to find a private key that happens to have what I call "human randomness" entropy/bits in it.


I typed what I typed, was blindly hitting the keypad, deleting, adding, without thinking. Hard to call it a real randomness but still..
BTW, one might think there's a trick, lets say, I used one of my old private keys which I entered into their search. But the thing is that that website doesn't show you the page the key is on when you enter one. You can enter your old private key, it will show you calculated public key and other stuff, but it doesn't say which page it is on. So as strange as it is, looks like I did the impossible?

though there's still one logical explanation, I mentioned it in my previous post
jr. member
Activity: 75
Merit: 2
OFFTOP

l
now to my question. I'm bad with large numbers. could anyone tell me the probability of randomly finding a private key wallet with transaction given the fact that that 'database' supposed to have 10e +77 private keys and there was only 1 billion transactions and I happen to find one?
or to rephrase it - there are less than 100,000,000 wallets in use and I've randomly found one. what are the chances of that?

Ummmmm, buy a lottery ticket today Smiley

I am not sure on the numbers but you finding a random page with a used wallet has to be pretty high/astronomical.


I thought somebody would say something about the lottery ))

At first it didn't even shock me, but then I started calculating, so it must be a ratio: 1,000,000,000 (a number of all transactions) to 10 e+77 or 100,000,000 (a number of all the wallets) to 10 e+77. I'm lost with all the zeros so I can't figure out the accurate probability.

P.S.

there's still one logical explanation though:

the numbers on a page I've found are identical to the full number of pages minus a few from the end which I've deleted. so I didn't add or mix any numbers yet, I just deleted a few digits when I found that particular address. what if somebody did the same and created a transaction on purpose? maybe they deleted a few digits, picked up a key, used it, now it's there. the domain was registered in 2017, the transaction was made in 2018, so it's possible.

legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
...I clearly said that if it cannot save all the addresses then it should do its job and search for pattern and save addresses that match the pattern so tell me again does it not fit the "purpose" what is the difference by randomly brute-forcing the private keys and checking for the pattern and doing the same by taking millions of private keys? or will it lose its functionality by doing so?.

I think I mentioned this earlier but the main hurdle to implementing something like this is not the lack of talent, it's the lack of time potential devs have to write code & features and test them, since like most other OSS projects you usually don't make money until after the modifications are done. And in the case of cracking tools, you don't even stand a chance then unless you have expensive hardware, so it's kind of a chicken and egg problem.

I was randomly typing digits, adding and erasing some when I came across page 257315753860702656496824411130417573006305698397944231
(https://privatekeys.pw/keys/bitcoin/257315753860702656496824411130417573006305698397944231)

~

now to my question. I'm bad with large numbers. could anyone tell me the probability of randomly finding a private key wallet with transaction given the fact that that 'database' supposed to have 10e +77 private keys and there was only 1 billion transactions and I happen to find one?
or to rephrase it - there are less than 100,000,000 wallets in use and I've randomly found one. what are the chances of that?

For one thing, "human" randomness is not random enough since we just replace numbers with more predictable ones, unlike a computer. And I'd be hard-pressed to find a private key that happens to have what I call "human randomness" entropy/bits in it.
full member
Activity: 1232
Merit: 242
Shooters Shoot...
OFFTOP

let's talk about probability in general. there is this website where you can generate private keys on the fly and check their balance (lots of websites like this one actually but I was using a specific one).
so the total number of pages is: 2573157538607026564968244111304175730063056983979442319613448069811514699875

I was randomly typing digits, adding and erasing some when I came across page 257315753860702656496824411130417573006305698397944231
(https://privatekeys.pw/keys/bitcoin/257315753860702656496824411130417573006305698397944231)

there is a private key wallet that had had a transaction in 2018 (now it's empty).
so I did a little math. the average number of transactions in 2020 was 300,000 daily. in 2021 it was 400,000 daily.
before 2020 it was less but lets say it was 200,000 a day. so roughly there was about 73,000,000 transactions a year or 730,000,000 transactions in 10 years.
so by a very rough estimate it was nearly one billion transactions in Bitcoin network over all (I don't have real statistics though I'm pretty sure it exists somewhere).  

now to my question. I'm bad with large numbers. could anyone tell me the probability of randomly finding a private key wallet with transaction given the fact that that 'database' supposed to have 10e +77 private keys and there was only 1 billion transactions and I happen to find one?
or to rephrase it - there are less than 100,000,000 wallets in use and I've randomly found one. what are the chances of that?

Ummmmm, buy a lottery ticket today Smiley

I am not sure on the numbers but you finding a random page with a used wallet has to be pretty high/astronomical.
jr. member
Activity: 75
Merit: 2
OFFTOP

let's talk about probability in general. there is this website where you can generate private keys on the fly and check their balance (lots of websites like this one actually but I was using a specific one).
so the total number of pages is: 2573157538607026564968244111304175730063056983979442319613448069811514699875

I was randomly typing digits, adding and erasing some when I came across page 257315753860702656496824411130417573006305698397944231
(https://privatekeys.pw/keys/bitcoin/257315753860702656496824411130417573006305698397944231)

there is a private key wallet that had had a transaction in 2018 (now it's empty).
so I did a little math. the average number of transactions in 2020 was 300,000 daily. in 2021 it was 400,000 daily.
before 2020 it was less but lets say it was 200,000 a day. so roughly there was about 73,000,000 transactions a year or 730,000,000 transactions in 10 years.
so by a very rough estimate it was nearly one billion transactions in Bitcoin network over all (I don't have real statistics though I'm pretty sure it exists somewhere).  

now to my question. I'm bad with large numbers. could anyone tell me the probability of randomly finding a private key wallet with transaction given the fact that that 'database' supposed to have 10e +77 private keys and there was only 1 billion transactions and I happen to find one?
or to rephrase it - there are less than 100,000,000 wallets in use and I've randomly found one. what are the chances of that?
full member
Activity: 1232
Merit: 242
Shooters Shoot...
Take the RTX 3070 for example.
  Bitcrack gives out 800mk.
Vanitysearch, gives out 1600-1700mk.
So why not use vanitysearch for search, if it is twice as fast?
Therefore, I asked about the possibility of searching in a fixed range, in vanitysearch.
You can read up, I've answered this before.

When vanity search lands on a single private key, it actually checks that single key against 6 possibilities, because it is checking Point + endo1 + endo2 + symmetries. While vanitysearch modded is faster than bitcrack, the precompiled version is checking more points per single private key which is why the speed seems a lot faster.
newbie
Activity: 20
Merit: 0
Its a real shame really while these kind of programs can generate millions of addresses why not have a simple option to input millions of private keys from a text file that otherwise would take forever to convert using python to convert using gpu and save the output to text file or otherwise save addresses with the matching pattern along with private keys
Ahh, maybe because that's not the reason why these type of programs are written?  Roll Eyes

Based from your description, it's far from vanitysearch's main purpose: "generating vanity addresses"

I’m not trying to be disrespectful but you are not very genius regarding this it seems if you reread it then you would understand it does indeed fits the purpose I clearly said that if it cannot save all the addresses then it should do its job and search for pattern and save addresses that match the pattern so tell me again does it not fit the "purpose" what is the difference by randomly brute-forcing the private keys and checking for the pattern and doing the same by taking millions of private keys? or will it lose its functionality by doing so?.
legendary
Activity: 2646
Merit: 6681
Self-proclaimed Genius
Its a real shame really while these kind of programs can generate millions of addresses why not have a simple option to input millions of private keys from a text file that otherwise would take forever to convert using python to convert using gpu and save the output to text file or otherwise save addresses with the matching pattern along with private keys
Ahh, maybe because that's not the reason why these type of programs are written?  Roll Eyes

Based from your description, it's far from vanitysearch's main purpose: "generating vanity addresses"
newbie
Activity: 20
Merit: 0
Its a real shame really while these kind of programs can generate millions of addresses why not have a simple option to input millions of private keys from a text file that otherwise would take forever to convert using python to convert using gpu and save the output to text file or otherwise save addresses with the matching pattern along with private keys
Pages:
Jump to: