 Show Posts
|
|
Pages: « 1 2 3 4 [5] 6 »
|
avw - This is the source code, you need to compile it in executable file (section "Building in Windows/Linux")How to install is understandable. How to compile - https://github.com/pikachunakapika/BitCrack ? Maybe somewhere there is a step-by-step explanation of how to COMPILE -?
|
|
|
|
|
If to add function " -r, - randoom " in last version, it is desirable to make two variants it is functions:
1 - " -r, - randoom " - the search by casual jumps in all space is made;
2 - " -r START:END, - randoom START:END " - the search by casual jumps in the given (desirable) space is made
OR
1 - if not the function - keyspace - is given then the search by casual jumps in all space is made;
2 - if the function - keyspace - is specified then the search by casual jumps only in the specified space is made;
|
|
|
|
Here it is necessary to load completely (green button " Clone or download ") all in ZIP archive, and then to open archive on the computer? in this fork - https://github.com/pikachunakapika/BitCrack*** Whether and there is a combined variant of use of functions " - keyspace " and " -r, - randoom ", i.e. that worked so: For example - we write -- keyspace 100000000000:500000000000 and -- random OR -- random 100000000000:500000000000 then The search is made only in a range 100000000000:500000000000, but casual (random like a flea or a kangaroo ) by jumps? |
|
|
|
|
This function
-r, --random
Each point will start in random KEYSPACE
must work in software clBitCrack.exe ?
I tried running on my laptops ( AMD A6-3420M APU with HD Graphics AMD Radeon HD 6520G ) - getting an error.
|
|
|
|
|
almightyruler - It is clear, THANKS!
|
|
|
|
|
I thought that all addresses and the keys are located in space
From - 0000000000000000000000000000000000000000000000000000000000000001
Up to - FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
For the processor AMD A6-3420M APU with HD Graphics AMD Radeon HD 6520G I can use only software clBitCrack
Completely casually I have found out that this software clBitCrack can work in space
From - 0000000000000000000000000000000000000000000000000000000000000001
Up to - FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFebaaedce 6af48a03bbfd25e8cd0364140
Can someone explain, why software clBitCrack is limited?
Or I incorrectly have understood something?
|
|
|
|
|
C:\Users\Alex>F:\BRichard\clBitCrack.exe -d 1 -c -u --keyspace 001:180 --continue sess.txt 12FotmxA4hT2dbsibS8SmB4fXbLk8rtSpU
[2019-08-12.13:33:06] [Info] Compression: both
[2019-08-12.13:33:06] [Info] Starting at: 0000000000000000000000000000000000000000000000000000000000000001
[2019-08-12.13:33:06] [Info] Ending at: 0000000000000000000000000000000000000000000000000000000000000180
[2019-08-12.13:33:06] [Info] Counting by: 0000000000000000000000000000000000000000000000000000000000000001
[2019-08-12.13:33:06] [Info] Compiling OpenCL kernels...
[2019-08-12.13:33:22] [Info] Initializing AMD A6-3420M APU with Radeon(tm) HD Graphics
[2019-08-12.13:33:22] [Info] Generating 262,144 starting points (10.0MB)
[2019-08-12.13:33:40] [Info] 10.0%
[2019-08-12.13:33:55] [Info] 20.0%
[2019-08-12.13:34:09] [Info] 30.0%
[2019-08-12.13:34:24] [Info] 40.0%
[2019-08-12.13:34:38] [Info] 50.0%
[2019-08-12.13:34:53] [Info] 60.0%
[2019-08-12.13:35:08] [Info] 70.0%
[2019-08-12.13:35:23] [Info] 80.0%
[2019-08-12.13:35:38] [Info] 90.0%
[2019-08-12.13:35:52] [Info] 100.0%
[2019-08-12.13:35:52] [Info] Done
[2019-08-12.13:35:53] [Info] Address: 12FotmxA4hT2dbsibS8SmB4fXbLk8rtSpU
Private key: 0000000000000000000000000000000000000000000000000000000000000168
Compressed: no
Public key:
953365CF99092ECDB2F9A546E05CB0119CB012D173167742943296B9AEBB30D8
87AECB174E5018B2D7E5F7ECC00FFF007548DF4996FBA1C7132EDA351B0E6A8B
[2019-08-12.13:35:53] [Info] No targets remaining
[2019-08-12.13:35:53] [Info] Reached end of keyspace
|
|
|
|
[quote author=Telariust link=topic=4453897.msg52106273#msg52106273 date=1565320320]
4) BitCrack Performance Tips.
BitCrack may not optimally calculate the -t and -p parameters (halving the speed).
run with the option "--continue sess.txt", any address, for example
xxBitCrack --continue sess.txt 17GD2bc5b7SvU7bzN7CYUSc6h4zBJ36Rx6
wait a little longer than a minute until the file of saving the progress will not be created, turn off;
open sess.txt, for example, "threads = 256" (this is the -t option) and "points = 32" (this is the -p option)
try to double the value, the speed should double;
remember them and always add when running BitCrack, for example
xxBitCrack -t 512 -p 64 17GD2bc5b7SvU7bzN7CYUSc6h4zBJ36Rx6
[/quote] In which folder is the sess.txt file saved - in the one where BitCrack is located OR in some other? |
|
|
|
Hello, in which wallet should i recover the found keys (wif,hex format) , i need a decentralized wallet , so people can't seize the money even if they want,
i need solution for this please
And ELECTRUM can be a reliable wallet? It has a "do not spend" function Who used this function and can tell? |
|
|
|
|
On a background 545 years an error per 0,5 years to make all any +/- 0,1 percents
|
|
|
|
|
If I calculated everything correctly, then the space from 2000000000000001 to 4000000000000001 can be scanned
in about 545 years if the average key generation rate is about 134 Mkey / s
Confirm or disprove my calculations.
|
|
|
|
Thanks!
But I can multiply numbers.
Me the dimension of size MKey / s interests.
For example, 1 MKey / s - is how much the private keys are: 1, 10, 100, 1000, 10000, 100000, 1000000 or other meaning ?
Author can correct me if necessary, but I presume 1 MKey/s would mean mega-keys, ie it's trying 1 000 000 (one million) key combinations per second? It's brute forcing so every raw private key attempt has to be mapped (through public key generation plus hashing) to an address. Thanks! I know many different units of measurements: meters, kilometers, minute, seconds, ft, km / hour, the mile / hour etc., with this unit (MKey/s) has met for the first time. I assumed, that 1 MKey/s it can be 1 000 000 Key/s, but has decided to ask the connoisseurs. |
|
|
|
Explain - if the speed 134.23 MKey/s - how much variants the private keys is generated for one hour?
134.23 MKey/s * 60 * 60 = 483228 MKey/ hThanks! But I can multiply numbers. Me the dimension of size MKey / s interests. For example, 1 MKey / s - is how much the private keys are: 1, 10, 100, 1000, 10000, 100000, 1000000 or other meaning ? |
|
|
|
GeForce RTX 2080 3232/8192MB | 1681329 targets 134.23 MKey/s (85,816,508,416,000 total) .... and running
GeForce RTX 2080 3232/8192MB | 1681329 targets 134.16 MKey/s (109,259,259,904,000 total).... and running
Explain - if the speed 134.23 MKey/s - how much variants the private keys is generated for one hour? |
|
|
|
Hi, folks! Great topic!
Need some of your guru's help. As far as I understood, if we have i.e.
61. 00000000000000000000000000000000000000000000000013C96A3742F64906 - 1AVJKwzs9AskraJLGHAZPiaZcrpDr1U6AB
62. - 1Me6EfpwZK5kQziBwBfvLiHjaPGxCKLoJi
63. - 1NpYjtLira16LfGbGwZJ5JbDPh3ai9bjf4
64. - 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
65. 000000000000000000000000000000000000000000000001a838b13505b26867 - 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe
means that privat keys for #62, 63 & 64 will be somewhere between 13C96A3742F64906:1a838b13505b26867. Am I right?
If yes, how can I narrow the keyspace for #62 only? Even approximate range I believe will be ok fo try. Can a simple hex math be used in this case?
Sorry if its a noob question.
And who prevents you to narrow a range of search? For search the private keys for address 62 is selected keyspace 2000000000000000 - 3FFFFFFFFFFFFFFF In this space it is possible to find about 2305843009213693952 variants. The project has started for a long time, therefore it is possible to assume, that about three quarters of addresses is checked up and among them no required. I.e. it is necessary to you to check up 2305843009213693952:4 = 576460752303423488 variants Can try to begin with 3800000000000001 - keyspace 3800000000000001:3FFFFFFFFFFFFFFF If this quantity of variants 576460752303423488 you divide into speed of generation of keys of your computer that receive a rough operating time Good luck! Since the entire search space for #62 is 2000000000000000 to 3FFFFFFFFFFFFFFF If you search the last 1/4 of the space from 3800000000000001 to 3FFFFFFFFFFFFFFF you will have exactly a 25% chance of finding the key assuming nobody else with much faster hardware finds it first. Good luck! You are going to need it. I with you completely agree! In a post № 1018 on page 51 I wrote about factors (on statistics) found Private Key Minimal - K*1.2561547139608029 It is possible to assume, that Private Key for addresses 62 can be in space From 2000000000000000 х K*1.2561547139608029 up to 3FFFFFFFFFFFFFFF i.e. approximately From 2800000000000001 and up to 3FFFFFFFFFFFFFFF I think, that the minimum half of way from 2000000000000001:3FFFFFFFFFFFFFFF already and key is not found. Then it is possible to try from 3000000000000001 up to 3FFFFFFFFFFFFFFF In any case on my computer with speed only 0.63 MKey/s to participate in this competition it is senseless. |
|
|
|
Hi, folks! Great topic!
Need some of your guru's help. As far as I understood, if we have i.e.
61. 00000000000000000000000000000000000000000000000013C96A3742F64906 - 1AVJKwzs9AskraJLGHAZPiaZcrpDr1U6AB
62. - 1Me6EfpwZK5kQziBwBfvLiHjaPGxCKLoJi
63. - 1NpYjtLira16LfGbGwZJ5JbDPh3ai9bjf4
64. - 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
65. 000000000000000000000000000000000000000000000001a838b13505b26867 - 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe
means that privat keys for #62, 63 & 64 will be somewhere between 13C96A3742F64906:1a838b13505b26867. Am I right?
If yes, how can I narrow the keyspace for #62 only? Even approximate range I believe will be ok fo try. Can a simple hex math be used in this case?
Sorry if its a noob question.
And who prevents you to narrow a range of search? For search the private keys for address 62 is selected keyspace 2000000000000000 - 3FFFFFFFFFFFFFFF In this space it is possible to find about 2305843009213693952 variants. The project has started for a long time, therefore it is possible to assume, that about three quarters of addresses is checked up and among them no required. I.e. it is necessary to you to check up 2305843009213693952:4 = 576460752303423488 variants Can try to begin with 3800000000000001 - keyspace 3800000000000001:3FFFFFFFFFFFFFFF If this quantity of variants 576460752303423488 you divide into speed of generation of keys of your computer that receive a rough operating time Good luck! |
|
|
|
|
We already know exactly how the author of the puzzle generated the private keys because he told us exactly how he did it right here in this thread.
The private keys were made by taking a random number and then masking it to the desired bit length:
#1 = 256 bit random number bit wise ANDed with (21 - 1)
#2 = 256 bit random number bit wise ANDed with (22 - 1)
#3 = 256 bit random number bit wise ANDed with (23 - 1)
...
#60 = 256 bit random number bit wise ANDed with (260 - 1)
#61 = 256 bit random number bit wise ANDed with (261 - 1)
#65 = 256 bit random number bit wise ANDed with (265 - 1)
#70 = 256 bit random number bit wise ANDed with (270 - 1)
#75 = 256 bit random number bit wise ANDed with (275 - 1)
...
#160 = 256 bit random number bit wise ANDed with (2160 - 1)
So, there is no pattern to be discovered.
[/quote]
Yes I understand.
Just thought - what if .....
|
|
|
|
|
I do not know English - I use GOOGLE TRANSLATER.
I shall try to write. As on a condition of health I can not work on the computer more than three hours per day.
At me the very weak computer (the processor AMD A6-3420M APU with HD Graphics AMD Radeon HD 6520G) - gives speed only 0.63 MKey/s
I use the CPU (-d 1), not the video card (for software clBitCrack.exe)
Really I can search in a range with accuracy
FROM - XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX0000000001:
TO - XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXFFFFFFFFFF
Here all meanings X for each of 54 positions should be known, i.e. I can search only in the first 10 positions
Therefore I am compelled to search for other method to narrow keyspace of search in hexadecimal
For this purpose I have seen(overlooked) all found variants and has counted factor of increase (step) from the previous address to the next.
The positions from addresses #50 up to addresses #70 were interesting to me
For this purpose I each position of "grown-up" of the address I divided into a position of the "younger" address.
In a result I have received such factors (K*):
50 00000000000000000000000000000000000000000000000000022bd43c2e9354 1MEzite4ReNuWaL5Ds17ePKt2dCxWEofwk - K*3.3687335859160928
51 00000000000000000000000000000000000000000000000000075070a1a009d4 1NpnQyZ7x24ud82b7WiRNvPm6N8bqGQnaS - K*2.048065899832177
52 000000000000000000000000000000000000000000000000000efae164cb9e3c 15z9c9sVpu6fwNiK7dMAFgMYSK4GqsGZim - K*1.6041007864337676
53 00000000000000000000000000000000000000000000000000180788e47e326c 15K1YKJMiJ4fpesTVUcByoz334rHmknxmT - K*1.4747074651267212
54 00000000000000000000000000000000000000000000000000236fb6d5ad1f43 1KYUv7nSvXx4642TKeuC2SNdTk326uUpFy - K*3.0122337265933986
55 000000000000000000000000000000000000000000000000006abe1f9b67e114 1LzhS3k3e9Ub8i2W1V8xQFdB8n2MYCHPCa - K*1.4717313228011604
56 000000000000000000000000000000000000000000000000009d18b63ac4ffdf 17aPYR1m6pVAacXg1PTDDU7XafvK1dxvhi - K*3.126406400159927
57 00000000000000000000000000000000000000000000000001eb25c90795d61c 15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz - K* 1.4465302194572583
58 00000000000000000000000000000000000000000000000002c675b852189a21 1Dn8NF8qDyyfHMktmuoQLGyjWmZXgvosXf - K*2.6256582308911342
59 00000000000000000000000000000000000000000000000007496cbb87cab44f 1HAX2n9Uruu9YDt4cqRgYcvtGvZj1rbUyt - K*2.1616937162108232
60 0000000000000000000000000000000000000000000000000fc07a1825367bbe 1Kn5h2qpgw9mWE5jKpk8PP4qvvJ1QVy8su - K*1.2561547139608029
61 00000000000000000000000000000000000000000000000013C96A3742F64906 1AVJKwzs9AskraJLGHAZPiaZcrpDr1U6AB - K*21.4396439850506547
62 Unknown Private Key 1Me6EfpwZK5kQziBwBfvLiHjaPGxCKLoJi
63 Unknown Private Key 1NpYjtLira16LfGbGwZJ5JbDPh3ai9bjf4
64 Unknown Private Key 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
.....
65 000000000000000000000000000000000000000000000001a838b13505b26867 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe - K*31.7464340386176884
66 Unknown Private Key 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
67 Unknown Private Key 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
68 Unknown Private Key 1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ
69 Unknown Private Key 19vkiEajfhuZ8bs8Zu2jgmC6oqZbWqhxhG
.....
70 0000000000000000000000000000000000000000000000349B84B6431A6C4EF1 19YZECXj3SxEZMoUeJ1yiPsw8xANe7M7QR
71 Unknown Private Key 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU
72 Unknown Private Key 1JTK7s9YVYywfm5XUH7RNhHJH1LshCaRFR
73 Unknown Private Key 12VVRNPi4SJqUTsp6FmqDqY5sGosDtysn4
74 Unknown Private Key 1FWGcVDK3JGzCC3WtkYetULPszMaK2Jksv
.....
75 0000000000000000000000000000000000000000000004c5ce114686a1336e07 1J36UjUByGroXcCvmj13U6uwaVv9caEeAt
Accuracy of "hit" rather high and the error makes no more than +128 addresses.
But factors (steps) have the very large difference:
Minimal - K*1.2561547139608029
Maximal - K*3.3687335859160928
I think, that after addresses #61 presumably factor will be even more in a range from K*4 up to K*6
It is possible, that the organizer specially has arranged addresses with balance with such different steps.
My idea has appeared " complete delirium "!
|
|
|
|
It seems that this opens a new perspective. We do have now spending scripts for these puzzle wallet #65 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe (0.00001 BTC - Sortie) #70 19YZECXj3SxEZMoUeJ1yiPsw8xANe7M7QR (0.00001 BTC - Sortie) #75 1J36UjUByGroXcCvmj13U6uwaVv9caEeAt (0.00001 BTC - Sortie) #80 1BCf6rHUW6m3iH2ptsvnjgLruAiPQQepLe (0.00001 BTC - Sortie) #85 1Kh22PvXERd2xpTQk3ur6pPEqFeckCJfAr (0.00001 BTC - Sortie) #90 1L12FHH2FHjvTviyanuiFVfmzCy46RRATU (0.00001 BTC - Sortie) #95 19eVSDuizydXxhohGh8Ki9WY9KsHdSwoQC (0.00001 BTC - Sortie) #100 1KCgMv8fo2TPBpddVi9jqmMmcne9uSNJ5F (0.00001 BTC - Sortie) #105 1CMjscKB3QW7SDyQ4c3C3DEUHiHRhiZVib (0.00001 BTC - Sortie) #110 12JzYkkN76xkwvcPT6AWKZtGX6w2LAgsJg (0.00001 BTC - Sortie) #115 1NLbHuJebVwUZ1XqDjsAyfTRUPwDQbemfv (0.00001 BTC - Sortie) #120 17s2b9ksz5y7abUm92cHwG8jEPCzK3dLnT (0.00001 BTC - Sortie) #125 1PXAyUB8ZoH3WD8n5zoAthYjN15yN5CVq5 (0.00001 BTC - Sortie) #130 1Fo65aKq8s8iquMt6weF1rku1moWVEd5Ua (0.00001 BTC - Sortie) #135 16RGFo6hjq9ym6Pj7N5H7L1NR1rVPJyw2v (0.00001 BTC - Sortie) #140 1QKBaU6WAeycb3DbKbLBkX7vJiaS8r42Xo (0.00001 BTC - Sortie) #145 19GpszRNUej5yYqxXoLnbZWKew3KdVLkXg (0.00001 BTC - Sortie) #150 1MUJSJYtGPVGkBCTqGspnxyHahpt5Te8jy (0.00001 BTC - Sortie) #155 1AoeP37TmHdFh8uN72fu9AqgtLrUwcv2wJ (0.00001 BTC - Sortie) #160 1NBC8uXJy1GiJ6drkiZa1WuKn51ps7EPTv (0.00001 BTC - Sortie) a GPU version of this code https://gist.github.com/jhoenicke/2e39b3c6c49b1d7b216b8626197e4b89 or arulbero code is worthed .... It is possible that all these addresses will be reset to zero in the next few days. |
|
|
|
|
