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

nc50lc

legendary

Activity: 2534

Merit: 6080

Self-proclaimed Genius

Quote from: ?? on ??

yes, people who create a beautiful address using Bitcrack are very risky

Who'll do that anyways, it's not designed nor advertised to make vanity addresses Tongue

BitCrack is for "bitcracking" addresses' private keys which are purposely generated to be weak.
Like the puzzle transaction (unofficial thread) for example.
BTW, some of those are the private keys with balance that LBC had found over the years.

TryNinja

legendary

Activity: 2758

Merit: 6830

Quote from: blue Snow on October 24, 2020, 08:48:43 PM

why windows always deleting that file? and how to protect it from the defender?

Ideally, you would move away from Windows. Cheesy

But you can also whitelist their software on the Windows Defender: Add an exclusion to Windows Security

blue Snow

legendary

Activity: 1526

Merit: 1032

Up to 300% + 200 FS deposit bonuses

Windows 10 always deleting VanitySearch.exe (0 kb) every restart. I have to redownload again and again.

why windows always deleting that file? and how to protect it from the defender?

bigvito19

full member

Activity: 706

Merit: 111

Quote from: ?? on ??

does it not calculate private keys? Is it not possible to select from the list of addresses?

No, that program as is, you can't modify or do anything else with it.

ymgve2

full member

Activity: 161

Merit: 230

Quote from: ?? on ??

why the speed is low, it takes two days for this program to find 8 characters 40 bit, but Pairgen takes 5 seconds

https://github.com/basil00/pairgen/releases

That program is for finding two "similar" BTC addresses, like 53e1f4f491509f9012bd901be5147447f770018b and 53e1f4f491509f9012bd825ce1e9599b253188ef, which is completely different from creating a BTC address with a prefix that you specify.

It is fast because you have no control over what the matching part will be since it uses https://en.wikipedia.org/wiki/Birthday_attack

NotATether

legendary

Activity: 1568

Merit: 6660

bitcoincleanup.com / bitmixlist.org

Quote from: ?? on ??

You've been warned, checking an address on list of address doesn't have O(1) complexity.

I don't understand what this means

He means it's not going to take 1 second/millisecond/microsecond to check one address, it could take 28,000,000 time units to check one address which is linear time, it could also take 28,000,000^2 time units - quadratic time, to check a single address, or it could take cubic time, you get the idea. The amount of time it takes depends entirely on the algorithm Jean_Luc is using to check the addresses. I haven't studied the code so I don't know which running time it'll take.

The idea is if you run a computation several thousand times, the time complexity of the algorithm makes a huge difference. An algorithm running in cubic time might never finish doing 28,000,000 runs, but quadratic time might finish that size.

Quote from: ?? on ??

only the CPU has a chance because the addresses were created on the CPU, you can wait for the same thermal noise that Intel uses as a source of entropy. But the video card will not be able to find the key because the addresses were created on the CPU, and the probability of a random match is negligible.

This assumes that the random number generator on Intel hardware can be programmed to use the same seed, which it can't. Since the seed comes from thermal noise, two Intel processors will never have the same entropy.

Even if vanity generators used Xorshift software RNG that you can set the seed of, vanitysearch can't export the seed that it used. That isn't implemented.

bigvito19

full member

Activity: 706

Merit: 111

Quote from: ?? on ??

only the CPU has a chance because the addresses were created on the CPU, you can wait for the same thermal noise that Intel uses as a source of entropy. But the video card will not be able to find the key because the addresses were created on the CPU, and the probability of a random match is negligible. For this reason, the pool LBC finds an addresses, it uses processors, otherwise it would not be possible https://lbc.cryptoguru.org/trophies

An example:
We have a hardware capable of generating 1GKey/s and we have an input list of 106 addresses, the following table shows the probability of finding a collision after a certain amount of time:

Time   Probability
1 second   6.8e-34
1 minute   4e-32
1 hour   2.4e-30
1 day   5.9e-29
1 year   2.1e-26
10 years   2.1e-25
1000 years   2.1e-23
Age of earth   8.64e-17
Age of universe   2.8e-16 (much less than winning at the lottery)

LBC generates keys in incremental mode starting from key 1, so it won't find no more collisions really it stop at bit 54 and the same goes with bitcrack too.

PawGo

legendary

Activity: 952

Merit: 1385

Quote from: ?? on ??

You've been warned, checking an address on list of address doesn't have O(1) complexity.

I don't understand what this means

https://en.wikipedia.org/wiki/Time_complexity

nc50lc

legendary

Activity: 2534

Merit: 6080

Self-proclaimed Genius

Quote from: alevlaslo on October 18, 2020, 08:29:54 AM

is there a 1-day probability of CPU detecting a private key for the full address, or is it zero?
-snip-

It's in the image: half of the search space in 6.31275e+33 years, that's equivalent to 6,312,750,000,000,000,000,000,000,000,000,000 x 2 years.
But since you insist that "it's the same as a lottery" in the deleted thread, you can try and no one will hold you back.

alevlaslo

hero member

Activity: 1988

Merit: 593

thank you, but the speed is 2 times lower

but the probability is higher by 580 thousand times

I deleted all addresses of less than 50 bitcoins, there are 47,000 addresses left, with them the speed drop is only 10%

addresses with less than 50 bitcoins unethical to attack, people's savings there are

bigvito19

full member

Activity: 706

Merit: 111

Quote from: alevlaslo on October 18, 2020, 09:39:37 AM

Core i5 4t
Vanytygen64 - 550 kkeys per second
Vanitysearch - 5 mkeys per second

how can I import 580,000 addresses to check at the same time, will it slow down the speed?

Use the -i inputfile

alevlaslo

hero member

Activity: 1988

Merit: 593

Core i5 4t
Vanytygen64 - 550 kkeys per second
Vanitysearch - 5 mkeys per second

how can I import 580,000 addresses to check at the same time, will it slow down the speed?

alevlaslo

hero member

Activity: 1988

Merit: 593

is there a 1-day probability of CPU detecting a private key for the full address, or is it zero?

this address was used by scammers to steal bitcoins from the exchange

alevlaslo

hero member

Activity: 1988

Merit: 593

Radeon VII how many MKeys?

bitcoinunide

newbie

Activity: 17

Merit: 38

Thank you @Jean_Luc for the Code!

We've created a browser tool, for non technical users, that they can easy merge split keys offline in their browser client!

https://github.com/sashmaaan/VanityAddressMerger

MrFreeDragon

sr. member

Activity: 443

Merit: 350

Quote from: xhomerx10 on October 11, 2020, 01:24:50 PM

-snip-
I've noticed that is you duplicate the seed value, you will generate the same addresses each time the program is run. Would the same seed value result in the same addresses on another computer?
-snip-

As far as I know this soft works, it starts with the base key (as the starting private key) and increment it by 1 calculating the bitcoin address for every key (together with additional keys due to symmetry and endomorphism). For better security the random start key is used.
However if you use the same base key, you should receive the same final results (probably not in the same order as the work is performed not by one core, but by multi CPU/GPU cores)

Jean_Luc

sr. member

Activity: 462

Merit: 701

Yes, if you specify manually the same seed, the calculation will be the same.

xhomerx10

legendary

Activity: 3808

Merit: 7912

Quote from: Jean_Luc on October 11, 2020, 12:51:12 PM

Quote from: shlomogold on October 11, 2020, 12:11:13 PM

does this mean that if we could've recreated someone's system at a time (same OS, processor, time and date, etc.), we could be closer
to generating the same keys this person generated back then or am I completely misunderstanding how it works?

Theoretically it is not possible. The system gets entropy from keyboard inputs, disk usage, network, etc... Then it computes secure hashes from that inputs to generate random number.

I've noticed that is you duplicate the seed value, you will generate the same addresses each time the program is run. Would the same seed value result in the same addresses on another computer?

Anyone care to try?

Code:

vanitysearch -t 2 -gpu -gpuId 0 -c -s 0000000000000000000000000000000000000000000000000000000000000001 -u -o seetest.txt 1vanity

output

Code:

PubAddress: 1vaNitynLfQsJRMYQKMkbdSg8rLkSjhwv
Priv (WIF): p2pkh:5KbzFV78qNVj1PLRHXYBhG7icZTkifPZEKLchTGDWy5b7mv69qq
Priv (HEX): 0xEB775B6D709EF23F77B4D4A83A9B2EFDDEC07EF17B198320AB0BE94D128FCB9F
PubAddress: 1vaNity5aynUujBya8CMdrvZgx61sK5bZ
Priv (WIF): p2pkh:5Jn7TQNRSgjKaHfTbUEB3GuPxPaEeYAXDbKXhi8ptZLHZiXDhcJ
Priv (HEX): 0x7EC229EA229D8EE34BBC733ADC99ECA1DDCCC543D9C5714DC9626D13CBCD311D
PubAddress: 1vaniTySykD7CsMLDe79zEgRtzmsLDjkx
Priv (WIF): p2pkh:5Jh8WUtmjHQZkDPix71P78RPJu7KaCQt3sUBJVxtYknog3ZVTyZ
Priv (HEX): 0x73725230D841E056B39063C84D3D721BA08616210B1614B6E0F61FA20BA5D660
PubAddress: 1vaNiTyNULTxWy1W9y5u65YypG4mnjfXk
Priv (WIF): p2pkh:5Jn7TQNRSgjKaHfTbUEB3GuPxPaEeWxyHSCYURBzPZjaoT8Loxy
Priv (HEX): 0x7EC229EA229D8EE34BBC733ADC99ECA1DDCCC543D00F714DC9626D13CBC665D5
PubAddress: 1VAniTyzcxeBzAviTpjdoVwu6Pdda4eus
Priv (WIF): p2pkh:5JoCtBynZf5t5YgoPWHd69BYs4LQtUE61eA4cc2YQXTBgNcnWCh
Priv (HEX): 0x813DD615DD62711CB4438CC52366135CDCE217A2EE6A2EEDF66FF17904702C64

Jean_Luc

sr. member

Activity: 462

Merit: 701

Quote from: shlomogold on October 11, 2020, 12:11:13 PM

does this mean that if we could've recreated someone's system at a time (same OS, processor, time and date, etc.), we could be closer
to generating the same keys this person generated back then or am I completely misunderstanding how it works?

Theoretically it is not possible. The system gets entropy from keyboard inputs, disk usage, network, etc... Then it computes secure hashes from that inputs to generate random number.

shlomogold

jr. member

Activity: 75

Merit: 2

Quote from: Jean_Luc on October 09, 2020, 10:20:21 AM

Note that with VanitySearch, the generation of the base key (if no seed specified) is done through secure RNG of the system:
CryptGenRandom() for windows and /dev/urandom for linux.

does this mean that if we could've recreated someone's system at a time (same OS, processor, time and date, etc.), we could be closer
to generating the same keys this person generated back then or am I completely misunderstanding how it works?

Topic: VanitySearch (Yet another address prefix finder) - page 22. (Read 32072 times)