2019-07-19 13:53:38 62:161##a:0(4)##9:0(4)##8:6(4)##5:28(1)##2:98(9)##1:127(30) C1:373261 Str='11111111122222889a1111111112228a1a19111921811a511119' Av1:2.359 in sec Av2:290692446961262 in sec: CurDec:142042932044673649537278731434510563946471548172750992
2019-07-19 13:56:56 62:161##a:0(4)##9:0(4)##8:6(4)##5:28(1)##2:98(9)##1:127(30) C1:373267 Str='11111111122222889a1111111112228a1a1911192911811a1115' Av1:2.3561 in sec Av2:290329139949209 in sec: CurDec:142042932044673649537278731434510563946471739286467672
2019-07-19 13:59:00 62:161##a:0(4)##9:0(4)##8:6(4)##5:28(1)##2:98(9)##1:127(30) C1:373559 Str='11111111122222889a1111111112228a1a19112111181111959a' Av1:2.3561 in sec Av2:290102131961043 in sec: CurDec:142042932044673649537278731434510563946480663124511842
2019-07-19 14:01:00 62:161##a:0(4)##9:0(4)##8:6(4)##5:28(1)##2:98(9)##1:127(30) C1:374096 Str='11111111122222889a1111111112228a1a1911211119a8111159' Av1:2.3577 in sec Av2:289882730216322 in sec: CurDec:142042932044673649537278731434510563946480663526645012
2019-07-19 14:04:09 62:161##a:0(4)##9:0(4)##8:6(4)##5:28(1)##2:98(9)##1:127(30) C1:374319 Str='11111111122222889a1111111112228a1a19112111811a911159' Av1:2.3563 in sec Av2:289537844712345 in sec: CurDec:142042932044673649537278731434510563946480678146854792
Searcing in range from 62 to 161 bits. Speead over 280 Trillion addresses in second. Finding more than 2 addresses per second, matching a specific pattern. Found applicants are compared with more than 6 thousand addresses. And then sent to another thread to search the current block. PHP and one core on cpu.  PS. Str not hex priv key. This is own format data. And CurDec not deceminal priv key. |
|
|
|
https://brainwalletx.github.io/Select "Secret exponent" Enter in input "Secret exponent" 3 Uncompresed 1NZUP3JAc9JkmbvmoTv7nVgZGtyJjirKV1 Compressed 1CUNEBjYrCn2y1SdiUMohaKUi4wpP326Lb And view all variable, Public Key, Privat Key, hash160 and etc.
|
|
|
|
|
2Babi Ngetot Try calculate not real privat key. Example pkey+1, pkey+2, pkey+3 and etc.
|
|
|
|
Is it real?
Yes, spellchecking is real. ... In some parts of this planet at least. An so spead 48-50Mkeys/sec!
For that matter already, the LBS also does not find everything, but only from the list given to him. And how much is there given to him? 100K addresses? 200? 300?
I thought I mentioned beyond reasonable doubt: 16M addresses - those that have at least 1 Satoshi on them. Well, well, you can even specify a couple of millions through the bloom filter. But there are currently about 400 million known addresses!
And to check every address on the block, even if your ABD is raised, then the speed will be completely different, much less.
Last time I checked there were 270M known addresses, but maybe that is bigger now. So? People usually don't want to search for empty addresses. For the topic of finding collisions, it would actually be preferable to look up all of them (and an instant speedup factor of ~20) and these proposals have been made. Maybe in the next version of LBC. I don't know what ABD is, sorry. Sorry. Not ABD. Is it ABC https://www.bitcoinabc.org/ . Upped full node and checking present address in DB. After all, even those 16 million which are now incorporated in the LBC, in a month are not entirely relevant. That is, to talk about 100 percent coverage is not entirely correct. But the conversation is not about that. Just where was the conclusion that the bitcrake checked not all the addresses? In may 2019 i calculate address. Found 496 millions. But this and simple 1, and multi 3 addresses. |
|
|
|
1CNX4yi8ceB3Yv1t9uG38s7Q8S68zVgyLR
What is it? puzzle Realy puzzle qusteion. Guess what it is! |
|
|
|
1CNX4yi8ceB3Yv1t9uG38s7Q8S68zVgyLR
What is it? |
|
|
|
English is not my native language and sorry for mistakes.
Rico666 i watch you work long time ago and its so good, but what about bitcrack adoption to your pool ? Why not ? It will have moar power and we can solve puzzel really fast ? I think this is the next stage of bitcoin soon or later pepople will start to brute keys, also im wondering is it possible to adopt fpga cluster to mine keys what do u think ?
Well, first off - if bitcrack did all the work LBC is doing (watching all 16M addresses AND computing compressed and uncompressed addresses), the speed difference would not be that big anymore. The reason people use bitcrack is just because of the usual little greedy minds of the common crypto crowd: quick buck from the puzzle transaction bitcoins. As I mentioned before, with that approach something falls through the cracks and LBC finds what bitcrack misses. Second, I believe I could write (with the help of certain 1-2 people I know) something much faster than bitcrack. Essentially a LBCv2 doing as usual a complete search (all addresses, all privkeys sequentially) - way faster than bitcrack, but I'm working now on bigger things, so LBC has not the priority. Is it real? Currently runnnig at my one RX 560 (4GB), checked all addrees compressed and uncmpressed, with step 1 key, and list searched address about 7K. An so spead 48-50Mkeys/sec! For that matter already, the LBS also does not find everything, but only from the list given to him. And how much is there given to him? 100K addresses? 200? 300? Well, well, you can even specify a couple of millions through the bloom filter. But there are currently about 400 million known addresses! And to check every address on the block, even if your ABD is raised, then the speed will be completely different, much less. |
|
|
|
Where can i buy VPS with Nvidia Tesla or any other good GPU and hourly plan?
Found parsecgaming . com but not sure if is working, anyone tested them, can i use BitCrack on their servers?
Thanks
At amazon |
|
|
|
|
Now to modify application for getted ranges private keys from list?
|
|
|
|
Why speed at pool is to slow "24h Pool Performance: 233.52 Mkeys/s"? This in one GPU GeForce GTX 1080 TI. Info from here https://bitcointalk.org/index.php?topic=4453897.msg49793258#msg49793258GeForce GT 640 = 9.11 MKeys/s
GeForce GTX 1060 3GB = compressed = 60.61 MKeys/s
GeForce GTX 1060 3GB = both = 46.93 MKeys/s
GeForce GTX 1070 = compressed = 109 MKeys/s
GeForce GTX 1070 = compressed = 85 MKeys/s (with 40k targets)
GeForce GTX 1070 TI = compressed = 80 MKeys/s (with 87k targets)
GeForce GTX 1080 TI = compressed = 1030 MKeys/s (with 40k targets)
GeForce GTX 1080 TI = compressed = 350.28 MKeys/s (-b 224 -t 128 -p 1024)
GeForce GTX 1080 TI = compressed = 350.28 MKeys/s
GeForce GTX 2070 TI = compressed = 805 MKeys/s (with 200 targets)
GeForce RXT 2080 TI = both = 631.57 MKeys/s
GeForce GTX 1050 TI = 64 MKeys/s (with 81 targets)
Tesla K80 = compressed = 39.76 MKeys/s
Tesla K80 = compressed = 68.21 MKeys/s (config)
Tesla P100 = compressed = 76 MKeys/s
Tesla P100 = compressed = 251 MKeys/s (config)
Tesla V100 = compressed = 174 MKeys/s
Tesla V100 = compressed = 603 MKeys/s (with 40k targets) (config)
Tesla V100 = compressed = 715 MKeys/s (with 40k targets) (config = -b 72 -t 512 -p 1024) = |
|
|
|
#63 - 1NpYjtLira16LfGbGwZJ5JbDPh3ai9bjf4
Hex PK: 0000000000000000000000000000000000000000000000007CCE5EFDACCF6808
Private key: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYv5Z9J7hv7VYYN3XL3Y
62 is still in progress ... I just found 63 faster :-)
Eh, who would share the find. :-) |
|
|
|
Selection of private keys with a pass is unlikely, and with an increase in entropy. |
|
|
|
Yes, like I read everything, you can link to a certain post.
You sure a a lazy shit. Sure, I will give you the link for a fee. How much is it worth to you? I will accept BTC for payment. Looks like someone has found some kind of trick or regularity in calculations. Not really
Definitely it can't be luck with stepping 5 No, it is not luck
and and can't be hashing or brute-forcing. no hashing needed on these anymore, faster algorithm available for every fifth one
Just only if pentagon's admin decided to test the most powerful PC in the world with this puzzle address Probably not but, well maybe
https://bitcointalk.org/index.php?topic=1306983.msg51466379#msg51466379https://bitcointalk.org/index.php?topic=1306983.msg51474410#msg51474410Sorry. I forgot that the public keys are open there by the author himself. Head brewed from the numbers. |
|
|
|
|
Yes, like I read everything, you can link to a certain post.
|
|
|
|
|
Why steping is 5???
Maybe reality collision found?
|
|
|
|
Well, it depends on which side to look at. And as in a joke. Blondie is asked how likely she is to see a live dinosaur on the street. She answers, 50 percent! Ask how it is  ?? Well, either I will see, or I will not see! If we speak within this puzzle. Then, having some "random" private key generation statistics, we can try to predict in which range to search for the next key. Purely mathematical analysis. At the same time, different values, repetition in bit form, in decimal, hexahedral, etc. can take part in the analysis. Either repetition, or the number of all numbers and sequences. And first, more possible keys are checked, and then less possible. If we talk about all keys in general, then on the basis of already known private keys it will not be possible to analyze. Since different keys were generated by different software products, with different random generators, some were generated by user actions (pull the mouse, enter a phrase), others are based on random words, etc. That is, it cannot be said that such a private key cannot exist in the current range. They are all valid in the known range. But! They are not all valid for the required public keys or addresses! Then here it is necessary to analyze the frequency repetitions of the received keys or addresses. To find a certain dependence and then the search is divided into two levels, the search for matches, the transition to the next range of possible matches, the search by small steps until the next match is found. But the search for these hits also takes time and power. It also reduces the speed of the search, as it is necessary to carry out an additional analysis of the result obtained.For example. The probability that in the range of 1 trillion private addresses on the output will be two addresses with a difference of only 1,2,3 bytes, almost zero. And if we have found such an address, which matches the desired one with a difference of 1,2,3 bytes. Then with great probability we can continue the search by adding 1 trillion to the current private key. |
|
|
|
I decided to drive the statistics. Calculate the partial repetition of a part of a public address, starting from the end or from the beginning. Bit repetitions. I.e 10101010111......0101010101 1101010101001011010100......0101010010 11010101010Match the end to 11 bits. 1101011011011010101010111......010101010110101010101 1101011011011001011010100......010101001010010101010 Match from the beginning to 14 bits. Private keys get over in a row. And looking for repetition in a public address. When repetition is found, the difference in the private key is calculated. At the moment, found such a minimum range. 24 bits: 2970 * 128 = 380160 (+-128) pkeys
23 bits: 330 * 128 = 42240 (+-128) pkeys
22 bits: 33 * 128 = 4244 (+-128) pkeys
21 bits: 11 * 128 = 1408 (+-128) pkeys
20 bits: 10 * 128 = 1280 (+-128) pkeys
Matching 19 or less bits are found with ranges of less than 128 keys. Of course, a jump (pass) to 380k keys, at a search speed of 1M per second, is nothing. But finding large ranges, you can make big jumps. |
|
|
|
I will answer in Russian. Как будем делить не убитого кабанчика? |
|
|
|
|
Show Posts
