VanitySearch (Yet another address prefix finder) - page 2.

WanderingPhilospher

full member

Activity: 1232

Merit: 242

Shooters Shoot...

Quote from: willi9974 on December 18, 2024, 05:56:23 PM

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.

willi9974

legendary

Activity: 3654

Merit: 3003

Top-tier crypto casino and sportsbook

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

LoyceV

legendary

Activity: 3290

Merit: 16489

Thick-Skinned Gang Leader and Golden Feather 2021

Quote from: citb0in on December 18, 2024, 01:18:07 AM

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 ‘’; did you forget to ‘#include ’?
   22 | #include 
  +++ |+#include 
   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.

citb0in

hero member

Activity: 630

Merit: 731

Bitcoin g33k

Quote from: LoyceV on December 16, 2024, 10:40:28 AM

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

legendary

Activity: 3290

Merit: 16489

Thick-Skinned Gang Leader and Golden Feather 2021

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?

raritycheck

copper member

Activity: 577

Merit: 171

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

alexeyneu

member

Activity: 392

Merit: 44

Quote from: citb0in on June 07, 2024, 06:16:00 AM

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 .

LoyceV

legendary

Activity: 3290

Merit: 16489

Thick-Skinned Gang Leader and Golden Feather 2021

Quote from: NotFuzzyWarm on June 10, 2024, 07:53:30 PM

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.

NotFuzzyWarm

legendary

Activity: 3892

Merit: 2797

Evil beware: We have waffles!

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?

Nika_e621

newbie

Activity: 3

Merit: 0

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

nc50lc

legendary

Activity: 2646

Merit: 6681

Self-proclaimed Genius

Quote from: Nika_e621 on June 07, 2024, 05:06:03 AM

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.

Quote from: Nika_e621 on June 07, 2024, 04:29:29 AM

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.

citb0in

hero member

Activity: 630

Merit: 731

Bitcoin g33k

Quote from: Nika_e621 on June 07, 2024, 05:06:03 AM

Quote from: citb0in on June 07, 2024, 04:55:01 AM

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

NotATether

legendary

Activity: 1568

Merit: 6660

bitcoincleanup.com / bitmixlist.org

Quote from: citb0in on June 07, 2024, 04:55:01 AM

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

Nika_e621

newbie

Activity: 3

Merit: 0

Quote from: citb0in on June 07, 2024, 04:55:01 AM

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?

citb0in

hero member

Activity: 630

Merit: 731

Bitcoin g33k

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

Nika_e621

newbie

Activity: 3

Merit: 0

Quote from: NotATether on February 07, 2023, 07:14:10 AM

Quote from: digaran on February 07, 2023, 06:22:22 AM

WOW you are really true code master man, how long do you think will this take you to have a working GPU build?

Well, I wouldn't call myself that. Wink

citb0in actually asked me that question already, and we both thought it would take max. a week or two. This was in the beginning of January. But unfortunately (among other things) I discovered that adding the GPU support wasn't as simple as changing a few lines of code (and I refunded him his money last night).

So as it stands, there's only a working CPU build - just now I pushed the code that will enable you to run queries like "./VanitySearch ^1abc" to search for 1abc prefix at the beginning, and also you could already do ./VanitySearch 1abc$ to search for 1abc at the end of the address, and some other things I will list below.

Wildcard searches with *, +, and {m,n} work but they are not very useful as current hardware can only reasonably search for 6-7 characters at a time:

(difficulty estimation is currently wrong for {m,n} and will report much longer time than actual)

Character classes and quantifier example:

./VanitySearch -t 8 '^1[fF][iI].{2,4}[sS][hH]'

Code:

time ./VanitySearch -t 8 '^1[fF][iI].{2,4}[sS][hH]'
VanitySearch v1.19
Benchmarking regex matching speed of prefix "^1[fF][iI].{2,4}[sS][hH]" (case sensitive) for 1 second, please wait... done
Difficulty: 9225725494
Search: ^1[fF][iI].{2,4}[sS][hH] [Compressed]
Start Tue Feb 7 12:12:39 2023
Base Key: CA21EDE5142917948E79FEFD98EBBB2E485ECA54E1C814B482C39A2C8B8D5B37
Number of CPU thread: 8

PubAddress: 1FiF7Sh6Ei8ezjMASNdED1ixyTZ9HY4DbP
Priv (WIF): p2pkh:Kxsq34CD5UBCqhRMZi4WNH1oQjnr3FHjzQqS2kEDb6CN3EpZYauo
Priv (HEX): 0x317261FB480D6C92F777B4F3B18176433CAED4D61E8A3E507A0414E3A6BCCAD4

PubAddress: 1FiZ9bmpedPk1ksHRtUtZEDZ2n7fNz68LP
Priv (WIF): p2pkh:L3zdVyH3kWaRtzJ4eLEc6FwcbrzBRpVgoPZjCC3Gq1d2ZCEENuM6
Priv (HEX): 0xCA21EDE5142917948E79FEFD98EBBB31485ECA54E1C814B782C39A2C8B8D6ACE
[0.20 Mkey/s][GPU 0.00 Mkey/s][Total 2^18.63][Prob 0.0%][50% in 08:45:41][Found 2]
PubAddress: 1FidbgsHsR9B2iEu5KkfYxRE7SPjadWSiS
Priv (WIF): p2pkh:L12uW3KSdEkLQzPutC9E6cpGJe6w9R9udHi4tLCrVEJKkCeikoJJ
Priv (HEX): 0x71CA8897DFCA52F8649A489E5C34216517D724D6E9710FE937FEE419F019AA9F
[0.19 Mkey/s][GPU 0.00 Mkey/s][Total 2^19.55][Prob 0.0%][50% in 09:15:06][Found 3] ^C

real 0m8.447s
user 0m51.466s
sys 0m0.075s

Note: Make sure you put the regex in single quotes '' otherwise bash might mess them up!

Anyway, I'm going to try to optimize the CPU build first before working on the GPU (regex mode is currently 2x slower than non-regex mode), maybe put some SSE or AVX in there somehow.

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?

DecipherBTC

newbie

Activity: 9

Merit: 13

Is it possible to remove the "base key" or atleast edit the actual "base key" ??

I understand that you can set your own seed, but you cannot select an exact base key.

How can you edit the base key, or atleast - how is the base key calculated so that this can be reversed?

citb0in

hero member

Activity: 630

Merit: 731

Bitcoin g33k

Quote from: ?? on ??

Brothers, I have input file format like this:
...

foo
bar
lore ipsum...
blah
bla

This has now become totally off-topic again. Please stick to the topic, the thread is unnecessarily cluttered. This is in the interest of everyone. VanilaSearch has created a new account just to spam this thread, even choosing a similarity to the topic. Don't feed the troll.

NeuroticFish

legendary

Activity: 3668

Merit: 6382

Looking for campaign manager? Contact icopress!

Quote from: ?? on ??

So it is my own lottery where a winner is only me.

Apart of the fact you are just wasting electricity (you'd be better with mining some altcoins), but you don't care about this detail, I want only to add that if (the hell freezes off and) you jackpot, if you move those coins away that's called stealing.

xhomerx10

legendary

Activity: 3808

Merit: 7912

Quote from: ?? on ??

Quote from: LoyceV on April 28, 2024, 02:53:10 AM

Quote from: ?? on ??

etc, all about additionally 10 millions similar strings.

That's cute. You're wasting computing power to prove to yourself that you'll never find the private key to someone else's Bitcoin address by brute-forcing it. Keep it up, convince yourself how secure Bitcoin is.

Thank you for your wishes.
Do you think my input file is correct? And why some errors or warnings pop up when I load it?

So rather than take LoyceV's advice about the larger problem you have using VanitySearch with such an input file, you prefer to fix the minor issue of computer memory allocation to continue the insanity? Maybe it's cold where you are and you need a warm computer to take the chill off. To each his own. Provided you have enough memory available, here's the potential fix:

Quote from: Jean_Luc on January 06, 2020, 03:16:18 AM

The memory needed to transfer results from GPU to CPU depends on the number of prefixes your search for, the number of threads and the rareness of the prefix(es).
The maximum number of hits per kernel call is maxFound = gridSize*1024*6
If you have enough memory available, you can specify -m gridSize*1024*6 to avoid the error.

Note: The corresponding amount of shared memory needed is 28*maxFound + 4 bytes.

Topic: VanitySearch (Yet another address prefix finder) - page 2. (Read 33086 times)