I don’t believe anything is stopping you from doing this now.
I can. But I guess it is possible by slow CPU regexp in slow Vanitygen only.Please if you know something lmk about that
Topic: VanitySearch (Yet another address prefix finder) - page 49. (Read 32966 times)
Please if you know something lmk about that
Jean_Luc
Here's your piece of code for generating pseudorandom numbers.
/* Knuth's PRNG as used in the Mersenne Twister reference implementation */
Here's your piece of code for generating pseudorandom numbers.
/* Knuth's PRNG as used in the Mersenne Twister reference implementation */
Code:
for (pos=0; pos
state->key[pos] = seed;
seed = (1812433253UL * (seed ^ (seed >> 30)) + pos + 1) & 0xffffffffUL;
}
state->pos = RK_STATE_LEN;
}
This is a quote from the Wikistate->key[pos] = seed;
seed = (1812433253UL * (seed ^ (seed >> 30)) + pos + 1) & 0xffffffffUL;
}
state->pos = RK_STATE_LEN;
}
Quote
Is not cryptographically secure, unless the CryptMT variant (discussed below) is used. The reason is that observing a sufficient number of iterations (624 in the case of MT19937, since this is the size of the state vector from which future iterations are produced) allows one to predict all future iterations.
https://en.wikipedia.org/wiki/Mersenne_Twister 
Hope to see all upper-case or all lower-case search.
I don’t believe anything is stopping you from doing this now.
Hi there 
Some news:
- The case insensitive search is ready and working well at almost nominal speed.
- For the search with wildcard, the speed is still very low, in that case I have to calculate the full base58 address for each generated point and the base58 is very slow, so I'm trying to implement this at the GPU level.
- I will also add an encryption mechanism for the output file and think to a manner to have a safe command line.
Some news:
- The case insensitive search is ready and working well at almost nominal speed.
- For the search with wildcard, the speed is still very low, in that case I have to calculate the full base58 address for each generated point and the base58 is very slow, so I'm trying to implement this at the GPU level.
- I will also add an encryption mechanism for the output file and think to a manner to have a safe command line.
Awesome!
Hope to see all upper-case or all lower-case search. Also hope to see regexp search for finding whatever want.
I am not an expert but I guess there are some algos for base64 encoding/decoding on GPU:
https://www.codeproject.com/Articles/276993/Base64-Encoding-on-a-GPU
https://lemire.me/blog/2018/01/17/ridiculously-fast-base64-encoding-and-decoding/
Also there are several fast GPU regexp:
https://madhumithasridhara.github.io/QuickMatch/
Hi there
Some news:
- The case insensitive search is ready and working well at almost nominal speed.
- For the search with wildcard, the speed is still very low, in that case I have to calculate the full base58 address for each generated point and the base58 is very slow, so I'm trying to implement this at the GPU level.
- I will also add an encryption mechanism for the output file and think to a manner to have a safe command line.
Some news:
- The case insensitive search is ready and working well at almost nominal speed.
- For the search with wildcard, the speed is still very low, in that case I have to calculate the full base58 address for each generated point and the base58 is very slow, so I'm trying to implement this at the GPU level.
- I will also add an encryption mechanism for the output file and think to a manner to have a safe command line.
What do you think about using wildcard and using pattern like 1*Bit*Coin* ?
Would like that very much!
Also, is it possible to encrypt the -o text file that you save the keys to?
I am running this on a offline PC that in theory nobody has access to. But, since it's alone churning for days on end other people in the office can walk up to it.
It would be another switch that encrypts the file, and clears the screen so nobody can see the command you ran.
Paranoid, I know.
-Dave
What do you think about using wildcard and using pattern like 1*Bit*Coin* ?
I think that's a great idea.
can you add an option to search all address in lowercase or upper case?
I'm not sure to fully understand your request? Could you be more precise?
the one i ask about is like this
in this thread no upper/no lower address giveaway he can generate an address like this no upper case letters(e.g. 184wwh1dtg8xv858d1n1ktj2cpvvbjugft) or no lower case letters (e.g. 1GNGTB96XPDHQ47Y6SNP8KN3YNPLFUP6B8)
now he doesn't do that anymore and he doesn't share the application he uses to generate the address
can you add an option to search all address in lowercase or upper case?
I'm not sure to fully understand your request ? Could you be more precise ?
Hello, @Jean_Luc!
First of all I want to say a big thank you for the amazing project you are developing. Just a huge pleasure to use it.
Had you been thinking about expanding pattern abilities? Search for a word at the end of an address or inside an address? What do you think about the implementation of regular expressions?
I know regex in vanitygen working with CPU only. I don't know if this is possible but I think it would be just awesome to see something like a hybrid algo for finding regex patterns faster.
Thank you!
First of all I want to say a big thank you for the amazing project you are developing. Just a huge pleasure to use it.
Had you been thinking about expanding pattern abilities? Search for a word at the end of an address or inside an address? What do you think about the implementation of regular expressions?
I know regex in vanitygen working with CPU only. I don't know if this is possible but I think it would be just awesome to see something like a hybrid algo for finding regex patterns faster.
Thank you!
What do you think about using wildcard and using pattern like 1*Bit*Coin* ?
No, this is not difficult to implement.
I'll add this feature in the new release.
I'll add this feature in the new release.
can you add an option to search all address in lowercase or upper case?
Hello, @Jean_Luc!
First of all I want to say a big thank you for the amazing project you are developing. Just a huge pleasure to use it.
Had you been thinking about expanding pattern abilities? Search for a word at the end of an address or inside an address? What do you think about the implementation of regular expressions?
I know regex in vanitygen working with CPU only. I don't know if this is possible but I think it would be just awesome to see something like a hybrid algo for finding regex patterns faster.
Thank you!
First of all I want to say a big thank you for the amazing project you are developing. Just a huge pleasure to use it.
Had you been thinking about expanding pattern abilities? Search for a word at the end of an address or inside an address? What do you think about the implementation of regular expressions?
I know regex in vanitygen working with CPU only. I don't know if this is possible but I think it would be just awesome to see something like a hybrid algo for finding regex patterns faster.
Thank you!
No, this is not difficult to implement.
I'll add this feature in the new release.
I'll add this feature in the new release.
@Jean_Luc, what about case sensitive addresses? Is there any ETA on this feature? How difficult is it to implement such feature?
Do you plan to add support for P2SH (segwit starting with 3) adresses anytime soon to your tool? That would be a nice to have.
This is already supported in the current version afaik.
It is a first attempt, this is just to allow to run VanitySearch like this (for those who want a private address starting with 3).
Code:
C:\C++\VanitySearch\x64\ReleaseSM30>VanitySearch.exe -stop 3Priv
VanitySearch v1.11
Difficulty: 4553521
Search: 3Priv [Compressed]
Start Tue Apr 2 07:43:52 2019
Base Key:B0A317C56CF0CF3C63E118687C153CD1336F2D5DCE33A3ADB3CE5E4EEA401436
Number of CPU thread: 8
Pub Addr: 3PrivG5uq7hwXLyAHbYkFTnFkzx1FEWQdf
Priv (WIF): p2wpkh-p2sh:L2wAVD273GwAxGuEDHvrCqPfuWg5wWLZWy6H3hjsmhCvNVuCERAQ
Priv (HEX): 0xAA83217B3A11FCCFF8142EF0681AD774D7AB6822F574C4BB99CBF9B9DD01E7F2
Bech32/native segwit supported as well
Hello,
I just published the release 1.11 of VanitySearch:
https://github.com/JeanLucPons/VanitySearch/releases/tag/1.11
- Added support for segwit address P2SH and BECH32
I upload the windows release for CUDA8 asap.
Thanks for testing
I just published the release 1.11 of VanitySearch:
https://github.com/JeanLucPons/VanitySearch/releases/tag/1.11
- Added support for segwit address P2SH and BECH32
I upload the windows release for CUDA8 asap.
Code:
C:\C++\VanitySearch\x64\Release>VanitySearch.exe -stop bc1queen
VanitySearch v1.11
Difficulty: 1048576
Search: bc1queen [Compressed]
Start Wed Apr 3 08:56:32 2019
Base Key:6F907FDE30067DCDE802739E47C6463FE49C32791242458C2D141212DB107A55
Number of CPU thread: 8
Pub Addr: bc1queenu8kq0vjrl509w88mwefdu4pztkdvlst4at
Priv (WIF): p2wpkh:L24UVC7ZYgYjy4cStQvBHD3quJkeYN3xHYBqFjTYjJjwmht84jsg
Priv (HEX): 0x906F8021CFF9823217FD8C61B839B9BED612AA6D9D065AAF92BE4C79F5251BBA
Thanks for testing
Edit: Now I see you are just another multi account spammer. => https://bitcointalksearch.org/topic/multi-account-ban-evasion-rkum-rkzone1-mrasika-fistbump-5134513
Edit2: You are banned, goodbye.
Salut Jean-Luc Smiley
Do you plan to add support for P2SH (segwit starting with 3) adresses anytime soon to your tool? That would be a nice to have.
For instance this project by nullios implemented both P2SH and bech32 addies.
Is this included in your roadmap?
Nice work anyway!
Do you plan to add support for P2SH (segwit starting with 3) adresses anytime soon to your tool? That would be a nice to have.
For instance this project by nullios implemented both P2SH and bech32 addies.
Is this included in your roadmap?
Nice work anyway!
No, for the moment, nobody has proposed an OpenCL kernel for VanitySearch and I didn't find a good bigint library for OpenCL.
If somebody has some infos, it would be appreciated
If somebody has some infos, it would be appreciated
I know a few pages back you said that you needed some help with OpenCL, did you find anyone able to help?
I am sitting on a bunch of older RX470 cards and figure this would be a good way for them to spend their retirement years :-)
If not, no big deal but I can always hope.
Thanks,
Dave
I am sitting on a bunch of older RX470 cards and figure this would be a good way for them to spend their retirement years :-)
If not, no big deal but I can always hope.
Thanks,
Dave
why the result is not saved in txt?
You can use the -o option to save within a file.
why the result is not saved in txt?
Effectively
everything works perfectly
Code:
VanitySearchCUDA10.113.exe -gpu -s "laurent123456" -kp
Priv : KxFuiDGdGLoMKGnVfZ4x4sXLs6GPkp2a7teATCyLV65XKxt65s35
Pub : 026F6F0A6D845EA109C837976BC06040F4C1DA98881B7E165C9431FE1A7198AAD8
VanitySearchCUDA10.113.exe -gpu -stop -sp 026F6F0A6D845EA109C837976BC06040F4C1DA98881B7E165C9431FE1A7198AAD8 -o keyinfo.txt 1Laure
VanitySearch v1.13
Difficulty: 264104224
Search: 1Laure [Compressed With Public Key]
Start Thu Apr 18 17:31:42 2019
Base Key: 4C4F9EA9EC872852E88364D461C68A8B17B4A49A3556C0B1FD97B341CA64E495
Number of CPU thread: 5
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
VanitySearchCUDA10.113.exe -rp KxFuiDGdGLoMKGnVfZ4x4sXLs6GPkp2a7teATCyLV65XKxt65s35 keyinfo.txt
Pub Addr: 1LaureFDXZ7qs9cWU8PgiZ5fhWHgQJ5eNY
Priv (WIF): p2pkh:KzpFMQA6UcDJCDWDYFpz9LdV4VAFSm8EiQbonHx48s9MEAcB3B7p
Priv (HEX): 0x6B478EFA094CFDD0A1030610C25F223DB4D95C0639634C042A1711B8A6B2C2F2
Jump to: