VanitySearch (Yet another address prefix finder)

[Nika_e621]

Simply said, the version you're referring to is broken and not working correctly. This is an unofficial version where NotATether tried to implement regex funcationality but it does not work as expected, there are lots of bugs. I do not recommend to use and rely on it. Your mileage may vary. Good luck though

citb0in

It's from "https://github.com/JeanLucPons/VanitySearch/releases", I thought that this is the official version but if it's not, where can I get the official version?

[NotATether]

Simply said, the version you're referring to is broken and not working correctly. This is an unofficial version where NotATether tried to implement regex funcationality but it does not work as expected, there are lots of bugs. I do not recommend to use and rely on it. Your mileage may vary. Good luck though

citb0in

Don't use that version, it's been unmaintained for a couple of years 

[citb0in]

Simply said, the version you're referring to is broken and not working correctly. This is an unofficial version where NotATether tried to implement regex funcationality but it does not work as expected, there are lots of bugs. I do not recommend to use and rely on it. Your mileage may vary. Good luck though

citb0in

It's from "https://github.com/JeanLucPons/VanitySearch/releases", I thought that this is the official version but if it's not, where can I get the official version?

You obviously confusing two different programs. The original one is from JLP and this version does not support RegEx. This genuine applications works fine ! but it does not support RegEx

The other version was a fork from NotATether where he tried to implement RegEx funcationality. It does not work correctly and you should avoid using it. Just my coins

[nc50lc]

It's from "https://github.com/JeanLucPons/VanitySearch/releases", I thought that this is the official version but if it's not, where can I get the official version?

That link is the official version.
The command provided by NotATether will only work in his experimental build.

When I try to run "c:\Users\Main\VanitySearch.exe -t 8 '^1[fF][iI].{2,4}[sS][hH]'" in Windows, it says "Ignoring prefix " -t 8 '^1[fF][iI].{2,4}[sS][hH]'" (must start with 1 or 3 or bc1q)", does anyone know what I'm doing wrong?

For the official version, just start it with your preferred args followed by your address prefix.
e.g.: VanitySearch.exe -stop bc1qsegwt
use: VanitySearch.exe -h to see all the available options.

[Nika_e621]

ok, now it makes sense, thank you guys for clarifying that for me, appreciate it 👍

[NotFuzzyWarm]

Interesting: Just ran some tests to generate my new non-legacy donation address seen in my sig.
EDIT: Having issues importing the new Bech32 address into Blockchain.com so reverted back to original Legacy tips address

Tested times using Legacy (1), Segwit (3) and Bech32 (btc1q) prefixes and was astounded at the reported times to generate it. For all of them the same 9 characters (FuzzyWarm) were added to the prefix.

Hardware is my ThinkPad P15 workstation laptop using Vanity Search1.19
CPU is Intel(R) Core(TM) i7-10750H CPU @ 2.60GHz, reports 57% usage
16GB ram
GPU is nVidia Quadro T1000 (14x64 cores), reports 80% usage
All runs are using GPU and 6 of the 12 core threads.

Speeds:
   Legacy speed:  [541.45 Mkey/s][GPU 516.45 Mkey/s][Total 2^34.46][Prob 0.0%][50% in 44.5d][Found 0]
   Segwit speed:  [288.25 Mkey/s][GPU 271.25 Mkey/s][Total 2^31.43][Prob 0.0%][50% in 83.6d][Found 0]
   Bech32 speed: [545.76 Mkey/s][GPU 515.95 Mkey/s][Total 2^32.36][Prob 0.0%][50% in 12:24:35][Found 0]

Summary of initial reported times:
    Legacy 44.5 DAYS
    Segwit 83.6 DAYS
    Bech32 12.5 hrs

Bech32 is the clear winner for speed and was the only one allowed to run to completion & generate my new address, run time was 17hrs 42min.

Question for OP: Why are Legacy and Segwit search times so astonishingly long vs Bech32 search time?

[LoyceV]

Why are Legacy and Segwit search times so astonishingly long vs Bech32 search time?

Bech32 addresses aren't case sensitive. Or better: they're only lower-case, so there are less possibilities per position.

[alexeyneu]

The other version was a fork from NotATether where he tried to implement RegEx funcationality. It does not work correctly and you should avoid using it. Just my coins

idk who is author but there's vanitygen which supports regex and is included say to archlinux via aur .

[raritycheck]

Hey guys

Please provide feedback on any vulnerabilities for https://github.com/raritycheck/BTCMiniKeyGenerator
We want to use this to create BTC mini private keys for our various projects.

Can vanitygen or vanitysearch create mini keys, please? (We dont need vanity addresses just want 30 char min keys)

Regards
Team RC

[LoyceV]

Question: what is currently the best software for generating vanity addresses? It's been years since I did it, and oclvanitygen stopped working for me years ago. Both vanitygen and VanitySearch projects seem to be abandoned, and I can't combile either one of them on a standard Linux installation.
What's the current go-to place to create new vanity addresses?

[citb0in]

Question: what is currently the best software for generating vanity addresses? It's been years since I did it, and oclvanitygen stopped working for me years ago. Both vanitygen and VanitySearch projects seem to be abandoned, and I can't combile either one of them on a standard Linux installation.
What's the current go-to place to create new vanity addresses?

https://github.com/JeanLucPons/VanitySearch

What kind of compiling issues do you have? Post them here -including the GPU used so we can see if the CCAP matches- and we'll try to assist.

[LoyceV]

What kind of compiling issues do you have? Post them here -including the GPU used so we can see if the CCAP matches- and we'll try to assist.

I wasn't even trying to install GPU drivers (yet). This is what I get:

Code:

~/VanitySearch-master$ make
cd obj &&       mkdir -p GPU
cd obj &&       mkdir -p hash
g++ -m64 -mssse3 -Wno-write-strings -O2 -I. -I/usr/local/cuda-8.0/include -o obj/main.o -c main.cpp
In file included from main.cpp:18:
Timer.h:36:10: error: ‘uint32_t’ does not name a type
   36 |   static uint32_t getSeed32();
      |          ^~~~~~~~
Timer.h:23:1: note: ‘uint32_t’ is defined in header ‘<cstdint>’; did you forget to ‘#include <cstdint>’?
   22 | #include <string>
  +++ |+#include <cstdint>
   23 | #ifdef WIN64
Timer.h:37:27: error: ‘uint32_t’ has not been declared
   37 |   static void SleepMillis(uint32_t millis);
      |                           ^~~~~~~~
main.cpp: In function ‘int main(int, char**)’:
main.cpp:372:16: error: ‘getSeed32’ is not a member of ‘Timer’
  372 |   rseed(Timer::getSeed32());
      |                ^~~~~~~~~
make: *** [Makefile:70: obj/main.o] Error 1

I opened a new topic yesterday: Question: what is currently the best software for generating vanity addresses?. I'll continue with the suggestions posted there.

[willi9974]

Did we have overview what for a Speed we get with a NVIDIA 4080 or 4090 card?
Or any other better cards, that we know for highspeed with vanitysearch.

I would like put my 3 NVIDIA 3070 out and buy the latest top model if i have the information, how the speed is.

Best regards,
Willi

[WanderingPhilospher]

Did we have overview what for a Speed we get with a NVIDIA 4080 or 4090 card?
Or any other better cards, that we know for highspeed with vanitysearch.

I would like put my 3 NVIDIA 3070 out and buy the latest top model if i have the information, how the speed is.

Best regards,
Willi

A 4090 should get 5,000 - 6,200 MKeys/s; depending on your setup and power %. And that's just searching for a specific prefix/address, in a single range. If you are using it with endo and symmetry, it will be a little faster than the 5k-6.2 MKeys/s.

[alexeyneu]

what i don't understand in vanity mania: you have a bot that catches all addresses that have human-readable part. So at this point you already know it's generated with this stuff. 'if this dude could generate this i can too' . then you have his private key very fast . ofc you(dude that first generated it) have random part in address and hope it's unique but i really doubt about this. we already have vanitygen(search)eth-gpu-whatever example where all those wallets was cracked at once.

[LoyceV]

'if this dude could generate this i can too' . then you have his private key very fast

By all means: try it!

[alexeyneu]

'if this dude could generate this i can too' . then you have his private key very fast

By all means: try it!

https://www.reddit.com/r/EtherMining/comments/83o6xd/comment/k9l2g1i/?utm_source=share&utm_medium=web3x&utm_name=web3xcss&utm_term=1&utm_content=share_button


https://www.linkedin.com/posts/amberbtc_exploiting-the-profanity-flaw-activity-6981447584473124865-IlZ_


i'm not a thief fuck you

[citb0in]

What kind of compiling issues do you have? Post them here -including the GPU used so we can see if the CCAP matches- and we'll try to assist.

I wasn't even trying to install GPU drivers (yet). This is what I get:

Code:

~/VanitySearch-master$ make
cd obj &&       mkdir -p GPU
cd obj &&       mkdir -p hash
g++ -m64 -mssse3 -Wno-write-strings -O2 -I. -I/usr/local/cuda-8.0/include -o obj/main.o -c main.cpp
In file included from main.cpp:18:
Timer.h:36:10: error: ‘uint32_t’ does not name a type
   36 |   static uint32_t getSeed32();
      |          ^~~~~~~~
Timer.h:23:1: note: ‘uint32_t’ is defined in header ‘<cstdint>’; did you forget to ‘#include <cstdint>’?
   22 | #include <string>
  +++ |+#include <cstdint>
   23 | #ifdef WIN64
Timer.h:37:27: error: ‘uint32_t’ has not been declared
   37 |   static void SleepMillis(uint32_t millis);
      |                           ^~~~~~~~
main.cpp: In function ‘int main(int, char**)’:
main.cpp:372:16: error: ‘getSeed32’ is not a member of ‘Timer’
  372 |   rseed(Timer::getSeed32());
      |                ^~~~~~~~~
make: *** [Makefile:70: obj/main.o] Error 1

I opened a new topic yesterday: Question: what is currently the best software for generating vanity addresses?. I'll continue with the suggestions posted there.

Hey Loyce,

since this fits well in this topic and should also help other people looking for help in the future, I will answer you here.

Manual procedure:

1) start from scratch by cloning the git repository in a fresh new folder on your local disk

Code:

git clone https://github.com/JeanLucPons/VanitySearch

Code:

cd VanitySearch

2) open each of the following files

   - Timer.h (capital 'T')
   - hash/sha256.cpp
   - hash/sha512.cpp
   - hash/sha256.h

and search from in the beginning for lines like:

Code:

#include <string>

   or

Code:

#include <string.h>

3) add this new line after the line you found in step 2)

Code:

#include <cstdint>

... and save the changes you made.

4) compile it now, it should hopefully work

Code:

make

For a wrap-up, finally this is the resulting patch file which you can manually create into your cloned folder on your local disk and apply it.

fix_by_citb0in.patch

Code:

diff --git a/Timer.h b/Timer.h
index b649bf0..0407c79 100644
--- a/Timer.h
+++ b/Timer.h
@@ -20,6 +20,7 @@

 #include <time.h>
 #include <string>
+#include <cstdint>
 #ifdef WIN64
 #include <windows.h>
 #endif
diff --git a/hash/sha256.cpp b/hash/sha256.cpp
index 30cde56..fa92dc5 100644
--- a/hash/sha256.cpp
+++ b/hash/sha256.cpp
@@ -16,6 +16,7 @@
 */

 #include <string.h>
+#include <cstdint>
 #include "sha256.h"

 #define BSWAP
diff --git a/hash/sha256.h b/hash/sha256.h
index 7f106b7..a4476d1 100644
--- a/hash/sha256.h
+++ b/hash/sha256.h
@@ -18,6 +18,7 @@
 #ifndef SHA256_H
 #define SHA256_H
 #include <string>
+#include <cstdint>

 void sha256(uint8_t *input,int length, uint8_t *digest);
 void sha256_33(uint8_t *input, uint8_t *digest);
@@ -32,4 +33,4 @@ void sha256sse_checksum(uint32_t *i0, uint32_t *i1, uint32_t *i2, uint32_t *i3,
 std::string sha256_hex(unsigned char *digest);
 void sha256sse_test();

-#endif
\ No newline at end of file
+#endif
diff --git a/hash/sha512.cpp b/hash/sha512.cpp
index 2ab9bae..240e438 100644
--- a/hash/sha512.cpp
+++ b/hash/sha512.cpp
@@ -16,6 +16,7 @@
 */

 #include <string.h>
+#include <cstdint>
 #include "sha512.h"

 #define BSWAP

I've made the mentioned patch file for the required adjustments to fix the issue and created a pull-request to have it merged into JeanLucPons' repository. However, whether and when he will check and approve this is written in the stars You can of course view, download and apply the fix at any time as follows.

visit the URL <https://github.com/JeanLucPons/VanitySearch/pulls> and click on the pull request named "Fix Undefined Type 'uint32_t' by Including <cstdint>"


Simple and quick solution:

alternatively you can download the finished solution with my patch already applied, directly from my repository.

Code:

git clone https://github.com/citb0in/VanitySearch.git

Code:

cd VanitySearch

Code:

make

I hope I have been able to help you and wish you every success. All the best.
citb0in

[LoyceV]

alternatively you can download the finished solution with my patch already applied, directly from my repository.

Code:

git clone https://github.com/citb0in/VanitySearch.git
cd VanitySearch
make

This is what I used. I don't need it for anything secure^*, so I took the easiest solution.
Thanks!

But: when saving to file, I get a continuous stream of Warnings on my console:

Code:

Warning, wrong private key generated !"

So I'll just stick to the wine solution with the Windows executable. I already have 5 GB of output data to search through.

^* This is for another time, when I'm done

[citb0in]

But: when saving to file, I get a continuous stream of Warnings on my console:

Code:

Warning, wrong private key generated !"

what does your command look like, I'm curious.

I cannot reproduce this on my side. It works on my side and I used three different hosts and operating systems with different hardware. All work fine for me. I compiled simply with "make" and I am not using GPU for this test because this is the scenario you explained before.

Code:

$ ./VanitySearch 1try

VanitySearch v1.19
Difficulty: 4553521
Search: 1try [Compressed]
Start Thu Dec 19 17:05:22 2024
Base Key: EF34BA5BA02CCF41AE36124D91E5B9212E93E8C8AB1B81BDA14B821589A0068F
Number of CPU thread: 1

PubAddress: 1trykc9Ah11NVCNHVVt3orKjhgK8A84pu
Priv (WIF): p2pkh:L2miMJCwxyiH4tFx3gt2RK9q1iGzzz4wdGdkN7eYQ6Q9Qs4skmRy
Priv (HEX): 0xA5A68522A409A4A74E9FF31676531BEA96E38294815FEA218A700F7C368D4D03

PubAddress: 1tryWESn6mzaor1Te5sf3Nrdm181dxfFt
Priv (WIF): p2pkh:L5EhKgiE17Uzs2PPimJKhHX62uPDZ3yeFrbu1WmpGTPpe9wh6LUX
Priv (HEX): 0xEF34BA5BA02CCF41AE36124D91E5B9212E93E8C8AB1B81BDA14B821589AB5F32

PubAddress: 1tryJdNgYShLv9yFuLFhRNNoWRiJR876C
Priv (WIF): p2pkh:L5EhKgiE17Uzs2PPimJKhHX62uPDZ3yeFrbu1WmpGWGjd5fo1qRU
Priv (HEX): 0xEF34BA5BA02CCF41AE36124D91E5B9212E93E8C8AB1B81BDA14B821589BC93C4

PubAddress: 1tryseTSYxF5SqyLW7oKijhnPsgYcgj1n
Priv (WIF): p2pkh:L24p7EMx4SP62UWm6Y1v3TmeZig11KAE2unc5httpzvUexs81SLu
Priv (HEX): 0x909C0D9F227E47E12834C1EF91711C35510A5E0DA5632CA8F0B4E714696D3848