Topic: VanitySearch (Yet another address prefix finder) (Read 32072 times)

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

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

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

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?

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

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

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.

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

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

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?

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

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?

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?

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.

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.

 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:

 

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.

The performance of the RTX 4090 is pretty amazing indeed, not just for games. You may reach even higher results by using something like "4096,128" as the grid option. At least, I get between 9300 and 9600 Mkey/s.

Given that the CPU (AMD 7800X3D) alone only achieves 60 or so Mkey/s, it's crazy.


If you're refering to VanitySearch, being open source - can't you improve it then?

i have noticed when checking out this thing that 30% or more processing power is spent to just compare if address met pattern conditions. really not good. they didnt use any simd stuff even where it needs two may be five instructions to be done and some more on preparation stage

The rekey option is not default. You have to pass the flag -r and whatever number.

Here is the code that separates the threads:


So if you use the rekey option, it will generate (whatever your CPU thread x 1024 or your GPU grid size X x Y) random points throughout the curve and then work sequentially, until rekey number is met.

If no rekey flag is passed, the program generates a new base key, every time the program starts, then shifts out 112 bits and 80 bits. The odds of someone starting at the same base key is well, a little less than 2^256.




Also note, the program also checks the current points, Point +  endo1 + endo2 + symmetries.

Remember, a smaller vanity will result in many matches. If a vanity is 1Bf2f, that's what, roughly 58^4 checks before a match is found?  Which is 11,316,496, which means, roughly every 11,316,496 keys checked, a match will be found. GPUs nowadays, can check up to 25,000,000,000 key/s.

Normally, a person is searching for a longer Vanity address, if they plan on using it, or to distinguish it from other addresses.

I am sure the code can be tweaked to regen points after a match is found, if that would really make someone feel more secure.  Finding matches with close proximity private keys is small with a more difficult vanity address.

I have never seen this behaviour in vanitygen. I think it should always get a new random starting point after finding a match, otherwise the private keys you create are linked together, and compromising one means someone could brute force your other addresses.

Is "rekey" an option instead of the default?