|
thank you, I already figured it out, I have an old hard drive, I had to wait 1 hour.
|
|
|
|
|
I have Notepad++, but I don't have enough RAM, it freezes after selecting all the text and ALT+SHIFT+>>>
|
|
|
|
|
how do I remove extra characters? The program does not accept with them, each line only must has an address only, there should be nothing else
|
|
|
|
|
thank you, but I have Windows, where do I need to set this command and what program to install?
|
|
|
|
Просто находка для тех кто занимается подбором адресов чтобы искать в куче сгенерированых адреса с ненулевым балансом.
Для чего этот функционал обычному человеку может пригодиться?
понижение срока поиска по сравнению с поиском среди одного адреса с 34-значного количества лет до 27 значного за счет увеличения количества адресов особой погоды не делает   |
|
|
|
|
Hello, please divide the addresses into three groups, we can not import different types into the Vanitysearch program at the same time
|
|
|
|
That's where y'all get it wrong at, y'all keep trying to brute force the whole space. You have to know exactly where the range of the address is in then brute force that. But you can't know within what range was the private key of the address once it was chosen. Can you explain it a little more? I'm not an expert. First of all you should be going after addresses with its public key already exposed. That's 2^128 search range right there. You should be generating addresses/keys from the desired public key. The next step would be to find a partial collision of the key and brute force the remaining of the key or half 2^128 to 2^64. is there a probability of calculating the key in 1 second? |
|
|
|
Возможно, только полсрока это 6 с 33 нулями лет на цпу, если на ферме то на 3 нуля поменьше срок, но за свет так накладно уже, если не среди одного а среди миллиoна адресов искать, то еще 6 нулей убираем, если была исходящая транзакция с адреса то известен публичный ключ, по нему еще выше вероятность будет чем с миллиона адресов, но срок всё равно огромный в итоге, однако есть вероятность и за 1 секунду вычислить, если очень повезет или управлять событиями умеете, спец по этой части Валентина Красина, прошу любить и жаловать https://www.youtube.com/watch?v=scKfO_BfZCE |
|
|
|
|
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
|
|
|
|
From 2^160 to 2^128 And you can find the key in 1 second, if you are lucky, the probability is small, but above zero the cost of busting is very high, the production will be less, it is better to tune in to luck and low power  |
|
|
|
|
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?
|
|
|
|
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 |
|
|
|
|
Radeon VII how many MKeys?
|
|
|
|
there is no difference between 1 and 580000 addresses, the speed is limited by the random number generator
why can't I set more than 19 characters to Vanitygen64, in case I get lucky and the whole address is generated quickly? Probably the fact is that this is a calculation and not a random generation, faster than the estimated time calculation is impossible, unlike random generenation in another program
This one you can put in the whole address https://bitcointalk.org/index.php?topic=5112311.0https://github.com/JeanLucPons/VanitySearchthank you! |
|
|
|
|
low probability is not a hindrance, there is a person who won the lottery twice on the same combination, just adjust your thoughts correctly, and the result will attract
|
|
|
|
|
there is no difference between 1 and 580000 addresses, the speed is limited by the random number generator
why can't I set more than 19 characters to Vanitygen64, in case I get lucky and the whole address is generated quickly? Probably the fact is that this is a calculation and not a random generation, faster than the estimated time calculation is impossible, unlike random generenation in another program
|
|
|
|
|
I only know the address and public key, and I want to use them to calculate the private key
|
|
|
|
please tell me the settings for the richest address with a known public key for 1060 3GB and how many years will it take to calculate the key? |
|
|
|
it takes a million years to select one address, but 2 years is enough to select one of 590 thousands 1+ BTC addresses
however, 12000 keys per second is very small on the processor, how much will the video card give if you write the same program? [blah] This discussion is off-topic on the Vanitygen thread; but I feel a need to stick a spike in what is essentially idiot-FUD over Bitcoin’s security. To be clear, you are full of shit.- 2160 search space of Hash160s
- 12000 trials per second
- 590000 Bitcoin addresses with ≥ 1 BTC (assuming that your information is correct; I can’t be bothered to investigate, when it cannot make any appreciable difference)
- 86400 seconds per day, 365.2425 days per year
Ignoring the question of how different script types are handled: On average, what is the expected number of years for you to hit any one of the desired addresses? $ bc -l
((2^160 / 590000) / 12000) / (86400 * 365.2425)
6541404408567194639988331071041.54191444061112656733
Well, have fun trying, as I said. you forgot to divide the result by 2^96 because there are so many private keys for each address |
|
|
|
|
Show Posts
