 Show Posts
|
|
Pages: « 1 2 3 [4] 5 6 »
|
|
To MrFreeDragon you confirm that I have written.
Main to appear in the necessary time in the necessary place, i.e. to begin search maximum close to a required point.
Then speed of search and computing capacity of the computer will leave on the second place.
As against a lottery here you know that search - #62 1Me6EfpwZK5kQziBwBfvLiHjaPGxCKLoJi and provisional place 200000000000000 - 3FFFFFFFFFFFFFFF
In this range the people can vary an index point of search, bat in a lottery the man takes that ticket, which him is given by(with) the seller.
Even if the man himself fills in numbers of the lottery ticket nobody knows what numbers will be happy.
And here there is more detailed information - #62 1Me6EfpwZK5kQziBwBfvLiHjaPGxCKLoJi and provisional place 200000000000000 - 3FFFFFFFFFFFFFFF
There are more chances than in the lottery. Moreover, the rules of the game are constantly changing in the lottery
|
|
|
|
|
To MrFreeDragon
I wanted to say another.
For example we shall take #62 1Me6EfpwZK5kQziBwBfvLiHjaPGxCKLoJi
Presumably he should be 200000000000000 - 3FFFFFFFFFFFFFFF
If I shall begin search with 200000000000000 - me there will be no life to find the necessary address.
But, if I for any reason shall begin search not with 200000000000000 and from another 363D540000000000 that even at small speed of my computer
The true address 363D541EB611ABEE will be found rather quickly.
It will be equivalent of your theory about hit of a lightning in the separate man.
|
|
|
|
I am using bitcrack on RTX 2080 Ti and has speed of 1130 Mkeys/s. I am scanning from last 4 days. Now I am thinking to scan random.
One more participant in the digital lottery  For 80 years (like for the whole your life) it just 0.031% [but actually some less because your random could generate the same keys during these 80 years] For comparison, there are 16,000,000 thunder storms annually, 25,000,000 cloud lightings come to earth. Such lightings kill approximately 55 humans during a year. Considering the average life of 80 years, te chances to be killed by a storm lighting are 1:3000, so it is like 0.033%, which is more than the chances to find a key for #64 with the speed 1130MKey/s for 80 years  Perhaps these 55 people thought so too? |
|
|
|
Заинтересовала статья Recovering Bitcoin private keys using weak signatures from the blockchainhttp://www.nilsschneider.net/2013/01/28/recovering-bitcoin-private-keys.htmlМы сможем восстановить закрытый ключ для этого открытого ключа:
private key = (z1 * s2 - z2 * s1) / (r * (s1-s2))
Нам просто нужно найти z1 и z2! Это хеши выходов, которые должны быть подписаны. Давайте выберем выходные транзакции и вычислим их (он вычисляется OP_CHECKSIG): Вопрос: а как их вычислить эти хеши (z1 и z2)? Есть ли для этого специальный скрипт или программа? Ну а если удалось найти (вычислить) z1 и z2 , то что с ними делать дальше? Как по ним найти или восстановить закрытый ключ ? Имеется ли для этого какой-то скрипт или программа ? |
|
|
|
|
racminer - THANK !
I missed those numbers - I just didn’t notice (my mistake)
Congratulations to 57fe on getting # 105.
57fe has proven several times that his method works!
|
|
|
|
|
Who can write the supposed keyspace for addresses
# 66 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
# 67 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
# 68 1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ
# 69 19vkiEajfhuZ8bs8Zu2jgmC6oqZbWqhxhG
# 71 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU
# 72 1JTK7s9YVYywfm5XUH7RNhHJH1LshCaRFR
# 73 12VVRNPi4SJqUTsp6FmqDqY5sGosDtysn4
# 74 1FWGcVDK3JGzCC3WtkYetULPszMaK2Jksv
# 76 1DJh2eHFYQfACPmrvpyWc8MSTYKh7w9eRF
# 77 1Bxk4CQdqL9p22JEtDfdXMsng1XacifUtE
# 78 15qF6X51huDjqTmF9BJgxXdt1xcj46Jmhb
# 79 1ARk8HWJMn8js8tQmGUJeQHjSE7KRkn2t8
# 81 15qsCm78whspNQFydGJQk5rexzxTQopnHZ
# 82 13zYrYhhJxp6Ui1VV7pqa5WDhNWM45ARAC
# 83 14MdEb4eFcT3MVG5sPFG4jGLuHJSnt1Dk2
# 84 1CMq3SvFcVEcpLMuuH8PUcNiqsK1oicG2D
# 86
# 87
# 88
# 89
# 91
# 92
# 93
# 94
# 96
# 97
# 98
# 99
# 105 1CMjscKB3QW7SDyQ4c3C3DEUHiHRhiZVib
# 110 12JzYkkN76xkwvcPT6AWKZtGX6w2LAgsJg
# 115 1NLbHuJebVwUZ1XqDjsAyfTRUPwDQbemfv
# 120 17s2b9ksz5y7abUm92cHwG8jEPCzK3dLnT
# 125 1PXAyUB8ZoH3WD8n5zoAthYjN15yN5CVq5
# 130 1Fo65aKq8s8iquMt6weF1rku1moWVEd5Ua
# 135 16RGFo6hjq9ym6Pj7N5H7L1NR1rVPJyw2v
# 140 1QKBaU6WAeycb3DbKbLBkX7vJiaS8r42Xo
# 145 19GpszRNUej5yYqxXoLnbZWKew3KdVLkXg
# 150 1MUJSJYtGPVGkBCTqGspnxyHahpt5Te8jy
# 155 1AoeP37TmHdFh8uN72fu9AqgtLrUwcv2wJ
# 160 1NBC8uXJy1GiJ6drkiZa1WuKn51ps7EPTv
in this format
# 62 2000000000000000 - 3FFFFFFFFFFFFFFFF
# 63 4000000000000000 - 7FFFFFFFFFFFFFFFFF
# 64 8000000000000000- FFFFFFFFFFFFFFFFF
|
|
|
|
This "another" key works as well. Try to check it in bitcoin address generator, or try to import this file into your wallet. You will receive the access to the same address of wallet #62 lol )
Maximum value for secp256k1 is: FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFE BAAEDCE6 AF48A03B BFD25E8C D0364141Your key is above this value: FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFE BAAEDCE6 AF48A03B F60FB2AB 8647ED2FSome software will correctly reject this out of range value, but others will just overflow and wrap max+1 to 0. The result of F60FB2AB 8647ED2F minus BFD25E8C D0364141 is 363D541E B611ABEE, which is the "proper" key. That's why your key works: when wrapped around it ends up being the same calculated value. (If this was a clever joke, sorry that I spoiled it.  ) It turns out the transition to the second round (to a new ring)? |
|
|
|
|
I have a GPU brainflayer, 1 billion hashes /sec on 8 x RX570
You can send me PM if interested
[/quote]
bartekjagoda
How to send you PM if you have "closed"?
|
|
|
|
Yeah I know vanitygen has been around a while but I found another vanity program called vanitysearch that is 10 times faster than vanitygen and 3 times as fast as bitcrack, at least it is with my 1080ti! https://github.com/JeanLucPons/VanitySearchThis one ( VanitySearch.exe 1.15 ) is infected with a virus. Ah crap is it? what virus? Edit: I just scanned it with kaspersky online and it said no threats found, also my windows defender didn't pick anything up? Edit 2: Zielar already found it lol https://github.com/JeanLucPons/VanitySearch/issues/23SecureAge APEX - MaliciousSophos ML - Heuristic |
|
|
|
Yeah I know vanitygen has been around a while but I found another vanity program called vanitysearch that is 10 times faster than vanitygen and 3 times as fast as bitcrack, at least it is with my 1080ti! https://github.com/JeanLucPons/VanitySearchThis one ( VanitySearch.exe 1.15 ) is infected with a virus. |
|
|
|
How to compile, anyone know?
This does not need to be compiled - https://github.com/pikachunakapika/BitCrack/releases . Download to your hard drive software "clBitCrack.exe" . You start from the command line (cmd) - you specify the path to clBitCrack.exe and search parameters. |
|
|
|
|
vimp666 - THANK !!! It works, this is what I was looking for.
|
|
|
|
|
Where to take for AMD the ready version clBitcrack.exe (which it is not necessary to compile and simply to start from a command line) with functions -r, --random
Each point will start in random KEYSPACE :
xxBitCrack.exe [OPTIONS] [TARGETS]
Where [TARGETS] are one or more Bitcoin address
Options:
-i, --in FILE
Read addresses from FILE, one address per line. If FILE is "-" then stdin is read
-o, --out FILE
Append private keys to FILE, one per line
-d, --device N
Use device with ID equal to N
-b, --blocks BLOCKS
The number of CUDA blocks
-t, --threads THREADS
Threads per block
-p, --points NUMBER
Each thread will process NUMBER keys at a time
-r, --random
Each point will start in random KEYSPACE
--keyspace KEYSPACE
Specify the range of keys to search, where KEYSPACE is in the format,
START:END start at key START, end at key END
START:+COUNT start at key START and end at key START + COUNT
:END start at key 1 and end at key END
:+COUNT start at key 1 and end at key 1 + COUNT
-c, --compressed
Search for compressed keys (default). Can be used with -u to also search uncompressed keys
-u, --uncompressed
Search for uncompressed keys, can be used with -c to search compressed keys
--compression MODE
Specify the compression mode, where MODE is 'compressed' or 'uncompressed' or 'both'
--list-devices
List available devices
--stride NUMBER
Increment by NUMBER
--share M/N
Divide the keyspace into N equal sized shares, process the Mth share
--continue FILE
Save/load progress from FILE
|
|
|
|
|
This btcpass - clean (without a virus). It is necessary to pay for this btcpass?
|
|
|
|
|
To zielar
bcpsetup and bcpnoinst infected with viruses.
And for this they are asking to pay dollars!
|
|
|
|
Just one question - what was the principle that the ranges are not incremental, i.e. there are some "spaces" between ranges?
It is the different people scanned these all keyspace, and someone one man has reduced all results in one table. Therefore between different keyspace there are "blanks", which also need to be scanned if *62 will not be found |
|
|
|
|
--keyspace 34cccd52e9154d01:34cccd7f9d2cd300
|
|
|
|
|
Start Hex Finish Hex
--keyspace 28326b5ee5b13781:28326b6bb3f29d81
--keyspace 34ccccbde61a2d01:34cccd086798cd01
--keyspace 34cccccdc0f0cd01:34cccd086798cd01
--keyspace 3ddc8bab2da2c001:3ddc9bab2da2cf01
--keyspace 3ddc8bb176f60f01:3ddc9bab2da2cf01
|
|
|
|
|
