 Show Posts
|
|
Pages: « 1 2 3 4 [5] 6 »
|
Search speed will increase or not if you use:
- HDD, SSD, M.2 or DDR vertual disk?
-32 cores or 64 processor cores?
HDD speed doesn't matters. If you using CPU then more cores => more threads => more speed. |
|
|
|
Thanks for the answer. i always wondered because if there was just one point then why could I merge two files and solve the key with kangaroo unless there were at least two points to merge to give the answer. That would be the wild and tame?
If K is unknown private key, W - known wild distance, T - known tame distance, then in case of collision (when wild and tame kangaroos meets in same distinguished point), you have the following equation: K+W = T whose solution is trivial. |
|
|
|
That is the public key for puzzle 120, same number on the blockchain and published in your source code too (puzzle32.txt). Also no matter what public key I put in i get the same error. The error can't be in the in.txt file. I have made new ones for each computer and copied the one from the computer that does not get the error. Required text encoding for the in.txt file? All my computers save text in UTF-8
You can try run kangaroo -check to make sure that basic calculations performing without errors. If you see any errors, than something wrong with your hardware. |
|
|
|
I got another question, so what type of gpu's work with kangaroo?
Is Geforce and Nvidia the same thing?
Nvidia, along with other manufacturers, sell the Geforce cards; EVGA, Zotac, Gigabyte, ASUS, etc. The GTX and RTX cards work with Kangaroo, those are Geforce cards. There are other, older cards, that if they are Geforce cards, will work as well. How many number of cuda core require for use cuda gpu? my dell nvidia gpu GT 720M have only 96 CUDA core (very old) it is can not using cuda function can not use CuBitcrack, can use only OpenCL version but GTX 1050 have 640 CUDA core can work with cuda function normal no problem look like it require to have cuda core over 500 cuda core or some require of cuda core, then nvidia gt, gtx old version that have very low cuda core can not using with cuda function I not sure may be can use with old version like cuda 8.0 There is no limit to number of cores, but minimal compute capability 3.0 is required. Gt 720m has only 2.1 ccap, therefore it doesn't work |
|
|
|
My thinking was to create a lot of private keys from hex and save them to files then you only need to search with some programm all the files to find the BTC Adress inside this file and next to the adress is written the wif key to access the BTC Adress.
First i have try to crawl the website privatekeys.pw but they block crowling then i found a script like privatekeys.pw but it also wasnt possible to save this websites because of ajax that must load first then i have installed it on my own server but also no way because of ajax. Last i wanted to use iMacros to let klick him the website and download it and go to next website but there are to mutch data.
Do you imagine how much space is required for such amount of keys? Even if you will store just one byte from address, puzzle 64 space will require 2^63 bytes, or 8 388 608 Terabytes. All that databases like privatekeys.pw generates key lists on the fly, and don't stores them. |
|
|
|
Well then your program is broke. All TAMES, not WILDS, distances will match x coord of point x.
So this means G•Td = Tx (I'm using that as the x-coordinate of the tame kangaroo), but somehow, this doesn't apply for wilds, i.e G•Wd != Wx (Would-be x-coordinate of wild kangaroo)? What's different about wild kangaroos that breaks the ECC multiply for it? TamePoint = TameDistance * G WildPoint = SearchPoint - LowerRange*G + WildDistance*G |
|
|
|
On V100 speed is drastically slower than normal:
Tesla V100-SXM2- 10809 / 16160MB | 1 target 224.55 MKey/s (6,422,528,000 total) [00:00:26]
Does anyone know the average speed for V100 on original Bitcrack? Average speed with optimal grid settings is 1500 Mkey/s Unfortunately at this moment all my 3090 is busy, I have to wait few days to check your version on RTX. |
|
|
|
Good to hear that speeds aren't abysmal on GeForce cards. Maybe it was because I used the default points/blocks/threads and never bothered turning them for my Tesla card.
On V100 speed is drastically slower than normal: Tesla V100-SXM2- 10809 / 16160MB | 1 target 224.55 MKey/s (6,422,528,000 total) [00:00:26] |
|
|
|
Can possible to create Pollards kangaroo have multi kangaroo ?
1. multi multi set of kangaroo
multiple kangaroo (may be like opem kagaroo.ext multi set in same time
2. multi wild and tame
may be like wild-A wild-B wild-C wild-D and tame-A tame-B tameC tameD
make it multiple may be powerful
If we talking about JeanLucPons implementation, there are 1024 kangaroos for each CPU core and 128 for each GPU grid point by default. |
|
|
|
All four mods are not working in 30 series GPUs  waiting for your 5th mod  Can you try #5? Does it work?
C:\Users\Admin\Desktop\Bitcrack-spmod5>cuBitCrack.exe --keyspace 8000000000000000:ffffffffffffffff 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
Bitcrack sp-mod #5 (https://github.com/sp-hash)
[2021-03-26.15:07:12] [Info] Compression: compressed
[2021-03-26.15:07:12] [Info] Starting at: 0000000000000000000000000000000000000000000000008000000000000000
[2021-03-26.15:07:12] [Info] Ending at: 000000000000000000000000000000000000000000000000FFFFFFFFFFFFFFFF
[2021-03-26.15:07:12] [Info] Counting by: 0000000000000000000000000000000000000000000000000000000000000001
[2021-03-26.15:07:12] [Info] Initializing GeForce RTX 3090
[2021-03-26.15:07:12] [Info] Generating 48,617,472 starting points (1854.6MB)
[2021-03-26.15:07:20] [Info] 10.0%
[2021-03-26.15:07:20] [Info] 20.0%
[2021-03-26.15:07:20] [Info] 30.0%
[2021-03-26.15:07:20] [Info] 40.0%
[2021-03-26.15:07:21] [Info] 50.0%
[2021-03-26.15:07:21] [Info] 60.0%
[2021-03-26.15:07:21] [Info] 70.0%
[2021-03-26.15:07:21] [Info] 80.0%
[2021-03-26.15:07:21] [Info] 90.0%
[2021-03-26.15:07:21] [Info] 100.0%
[2021-03-26.15:07:21] [Info] Done
[2021-03-26.15:07:21] [Info] Error: misaligned address
Execution time = 9 seconds
|
|
|
|
As you can see, not only MKey/s on screen is faster, but also time to solve is ~5% faster. Unfortunally I cannot test sp_'s mod on my Tesla GPUs, because, as I said earlier, it all working under Ubuntu. So I'll waiting for Linux release to made a more complex and interesting tests. TBH, kinda hard to read it all but looks like 8 or 9 seconds faster. I'll take your word for it and we will say 5%. But not 20%? Also, what is oBitCrack? 9 sec from 180 sec total is ~5%. 20% will probably be on more powerful GPUs of a different architecture, which is why I wrote about the need for tests on powerful video cards. oBitCrack it is just renamed original cuBitCrack.exe. |
|
|
|
Again, here you are talking about speed in MKey/s...why?
Take away random, because my program kicks his backside, period. Small range.
What I am talking about is getting through a range and finding the key(s)...the results!
So are you willing to buy a program I created that will SHOW you on the screen that you are getting 2000 MKey/s with an old Nvidia or AMD card? Because I can sure fudge the speed on the screen to appear to be getting 2000 MKey/s
Or would you rather use a program that gets through a range quicker and finds all keys in the range? That is my point. Someone can posts speed and increases in speed but unless you compare them, actually working through an entire range, not just finding one random key, then it's all talk and quite frankly, BS.
I did a test with the original bitcrack with a less powerful card than what sp was using with his mod and the numbers didn't compute. My lesser card only trailed his by a few seconds in finding the key, but his speed showed 450+ MKey/s while mine was at 93 or 113 MKey/s ... see the problem there? His program and card should have finished 4x faster than mine. But it didn't.
Of course I'm talking about real MKeys/sec, not about some digits on screen. I have my own Vanity modification for range searching, but I still have not fixed the speed multiplier by 6 when outputting to the screen, because the numbers on the screen are not the most important thing. I asked someone do a true comparison test, through a range, with 1 key up front, 1 key in middle, and 1 at the end. That's how you compare the two programs, not by MKey/s on a screen.
I made a simple syntetic test within puzzle 33 range, and run it on my old laptop. The grid on original and mod versions is same, to ensure that number of starting points not affecting the speed. Keys generation: import random
import btc
a = 0x100000000
b = 0x1ffffffff
for i in range(1,10):
k = random.randint(a,b)
print(hex(k), btc.key_to_address(k, True))
------
0x1e5594206 15MjvwJbHtbxJKy8AmZWXjXppk66qxYaoV
0x15ab52be9 15CvUrFPRuTmRfrqdyeJmzJyBm5XSgG2pF
0x16750f92f 13ePh5jTqAScHpHn64veJCjsNercbY2Vk8
0x16e34fd54 1FHcbX4NRHyM7czubge2qGvTyWbm7mpHAj
0x1377cdc0c 131P4vKA1Udm4pYLR6AdxqTS8MicrtHwAP
0x1a80ec32e 1CXTEzbAATX1D5YB3Ncci1gtBEEchT2JJs
0x1d3667a73 1KGqdarqVdTDS7qDxb4haaMqBMRZ4kJvEU
0x1343f12f9 13vN1zbeNJaLEAapSEB5q6Tx2u8Czbg3PC
0x1a7ceb1e9 1F7GmqBsaijtTzubeuk32qC6Nn5MYAyfkT
Original BitCrack: oBitCrack.exe -b 6 -t 512 -p 512 --keyspace 100000000:1ffffffff -i addresses.txt
[2021-03-26.10:07:36] [Info] Compression: compressed
[2021-03-26.10:07:36] [Info] Starting at: 0000000000000000000000000000000000000000000000000000000100000000
[2021-03-26.10:07:36] [Info] Ending at: 00000000000000000000000000000000000000000000000000000001FFFFFFFF
[2021-03-26.10:07:36] [Info] Counting by: 0000000000000000000000000000000000000000000000000000000000000001
[2021-03-26.10:07:36] [Info] Initializing GeForce 940M
[2021-03-26.10:07:36] [Info] Generating 1,572,864 starting points (60.0MB)
[2021-03-26.10:07:38] [Info] 10.0%
[2021-03-26.10:07:38] [Info] 20.0%
[2021-03-26.10:07:38] [Info] 30.0%
[2021-03-26.10:07:38] [Info] 40.0%
[2021-03-26.10:07:39] [Info] 50.0%
[2021-03-26.10:07:39] [Info] 60.0%
[2021-03-26.10:07:39] [Info] 70.0%
[2021-03-26.10:07:40] [Info] 80.0%
[2021-03-26.10:07:40] [Info] 90.0%
[2021-03-26.10:07:40] [Info] 100.0%
[2021-03-26.10:07:40] [Info] Done
[2021-03-26.10:07:40] [Info] Loading addresses from 'addresses.txt'
[2021-03-26.10:07:40] [Info] 9 addresses loaded (0.0MB)
GeForce 940M 503 / 2048MB | 9 targets 31.25 MKey/s (849,346,560 total) [00:00:25][2021-03-26.10:08:08] [Info] Address: 13vN1zbeNJaLEAapSEB5q6Tx2u8Czbg3PC
Private key: 00000000000000000000000000000000000000000000000000000001343F12F9
Compressed: yes
Public key:
03C9A5A30DBEDAF27F315A0C7A1F4BFDF2A1537396F500CDD51101CDB0B131F4C7
GeForce 940M 503 / 2048MB | 8 targets 30.96 MKey/s (905,969,664 total) [00:00:27][2021-03-26.10:08:10] [Info] Address: 131P4vKA1Udm4pYLR6AdxqTS8MicrtHwAP
Private key: 00000000000000000000000000000000000000000000000000000001377CDC0C
Compressed: yes
Public key:
02452A6D3FB3C4EBF93EDC7EFE5ABB1C1F953FFA033D9D397FE9E68261EFDA1E25
GeForce 940M 503 / 2048MB | 7 targets 31.23 MKey/s (1,478,492,160 total) [00:00:45][2021-03-26.10:08:29] [Info] Address: 15CvUrFPRuTmRfrqdyeJmzJyBm5XSgG2pF
Private key: 000000000000000000000000000000000000000000000000000000015AB52BE9
Compressed: yes
Public key:
02DC0DF5814157C4134F4FC16B47CE49CDB20597EBDC5F3F71265BB75152C20416
GeForce 940M 503 / 2048MB | 6 targets 31.23 MKey/s (1,706,557,440 total) [00:00:52][2021-03-26.10:08:36] [Info] Address: 13ePh5jTqAScHpHn64veJCjsNercbY2Vk8
Private key: 000000000000000000000000000000000000000000000000000000016750F92F
Compressed: yes
Public key:
0307CD9AA9FEB167423BA03675FCC911BFCE47D860FAB89E9E6CF2E8ABC7C181F8
GeForce 940M 503 / 2048MB | 5 targets 31.29 MKey/s (1,821,376,512 total) [00:00:56][2021-03-26.10:08:39] [Info] Address: 1FHcbX4NRHyM7czubge2qGvTyWbm7mpHAj
Private key: 000000000000000000000000000000000000000000000000000000016E34FD54
Compressed: yes
Public key:
02D58BEA141737AE1B010188BDDAB3D91729E2E4385C85451F8BC47002099FFBCF
GeForce 940M 503 / 2048MB | 4 targets 31.56 MKey/s (2,801,270,784 total) [00:01:27][2021-03-26.10:09:10] [Info] Address: 1F7GmqBsaijtTzubeuk32qC6Nn5MYAyfkT
Private key: 00000000000000000000000000000000000000000000000000000001A7CEB1E9
Compressed: yes
Public key:
03FD0E95164339B2F228CCF60A95F596FC706F5C5559F2D06AC7BBEED4BE1B2578
[2021-03-26.10:09:10] [Info] Address: 1CXTEzbAATX1D5YB3Ncci1gtBEEchT2JJs
Private key: 00000000000000000000000000000000000000000000000000000001A80EC32E
Compressed: yes
Public key:
020C60BB4BED07723B7D4537E4C7A6C437477EDD9CF19FDD458EFDA1EFDE1C02FE
GeForce 940M 503 / 2048MB | 2 targets 31.58 MKey/s (3,493,330,944 total) [00:01:49][2021-03-26.10:09:34] [Info] Address: 1KGqdarqVdTDS7qDxb4haaMqBMRZ4kJvEU
Private key: 00000000000000000000000000000000000000000000000000000001D3667A73
Compressed: yes
Public key:
0218FEB4168B89B4A118C8B1DA28309FD97405D979CA96165BC86FBA8E2C59A7E1
GeForce 940M 503 / 2048MB | 1 target 31.84 MKey/s (3,840,933,888 total) [00:02:00][2021-03-26.10:09:43] [Info] Address: 15MjvwJbHtbxJKy8AmZWXjXppk66qxYaoV
Private key: 00000000000000000000000000000000000000000000000000000001E5594206
Compressed: yes
Public key:
0259B67380B41AD100F4592503C2F260B13334374238724105BE03EE1602C1F1AE
[2021-03-26.10:09:43] [Info] No targets remaining
sp_'s mod: cuBitCrack.exe -b 6 -t 512 -p 512 --keyspace 100000000:1ffffffff -i addresses.txt
Bitcrack sp-mod #4 (https://github.com/sp-hash)
[2021-03-26.10:10:15] [Info] Compression: compressed
[2021-03-26.10:10:15] [Info] Starting at: 0000000000000000000000000000000000000000000000000000000100000000
[2021-03-26.10:10:15] [Info] Ending at: 00000000000000000000000000000000000000000000000000000001FFFFFFFF
[2021-03-26.10:10:15] [Info] Counting by: 0000000000000000000000000000000000000000000000000000000000000001
[2021-03-26.10:10:15] [Info] Initializing GeForce 940M
[2021-03-26.10:10:15] [Info] Generating 1,572,864 starting points (60.0MB)
[2021-03-26.10:10:16] [Info] 10.0%
[2021-03-26.10:10:16] [Info] 20.0%
[2021-03-26.10:10:17] [Info] 30.0%
[2021-03-26.10:10:17] [Info] 40.0%
[2021-03-26.10:10:17] [Info] 50.0%
[2021-03-26.10:10:18] [Info] 60.0%
[2021-03-26.10:10:18] [Info] 70.0%
[2021-03-26.10:10:18] [Info] 80.0%
[2021-03-26.10:10:18] [Info] 90.0%
[2021-03-26.10:10:19] [Info] 100.0%
[2021-03-26.10:10:19] [Info] Done
[2021-03-26.10:10:19] [Info] Loading addresses from 'addresses.txt'
[2021-03-26.10:10:19] [Info] 9 addresses loaded (0.0MB)
GeForce 940M 505 / 2048MB | 9 targets 32.99 MKey/s (871,366,656 total) [00:00:23][2021-03-26.10:10:45] [Info] Address: 13vN1zbeNJaLEAapSEB5q6Tx2u8Czbg3PC
Private key: 00000000000000000000000000000000000000000000000000000001343F12F9
Compressed: yes
Public key:
03C9A5A30DBEDAF27F315A0C7A1F4BFDF2A1537396F500CDD51101CDB0B131F4C7
[2021-03-26.10:10:46] [Info] Address: 131P4vKA1Udm4pYLR6AdxqTS8MicrtHwAP
Private key: 00000000000000000000000000000000000000000000000000000001377CDC0C
Compressed: yes
Public key:
02452A6D3FB3C4EBF93EDC7EFE5ABB1C1F953FFA033D9D397FE9E68261EFDA1E25
GeForce 940M 505 / 2048MB | 7 targets 30.36 MKey/s (1,480,065,024 total) [00:00:42][2021-03-26.10:11:04] [Info] Address: 15CvUrFPRuTmRfrqdyeJmzJyBm5XSgG2pF
Private key: 000000000000000000000000000000000000000000000000000000015AB52BE9
Compressed: yes
Public key:
02DC0DF5814157C4134F4FC16B47CE49CDB20597EBDC5F3F71265BB75152C20416
GeForce 940M 505 / 2048MB | 6 targets 34.14 MKey/s (1,711,276,032 total) [00:00:49][2021-03-26.10:11:11] [Info] Address: 13ePh5jTqAScHpHn64veJCjsNercbY2Vk8
Private key: 000000000000000000000000000000000000000000000000000000016750F92F
Compressed: yes
Public key:
0307CD9AA9FEB167423BA03675FCC911BFCE47D860FAB89E9E6CF2E8ABC7C181F8
GeForce 940M 505 / 2048MB | 5 targets 32.97 MKey/s (1,830,813,696 total) [00:00:53][2021-03-26.10:11:14] [Info] Address: 1FHcbX4NRHyM7czubge2qGvTyWbm7mpHAj
Private key: 000000000000000000000000000000000000000000000000000000016E34FD54
Compressed: yes
Public key:
02D58BEA141737AE1B010188BDDAB3D91729E2E4385C85451F8BC47002099FFBCF
GeForce 940M 505 / 2048MB | 4 targets 27.78 MKey/s (2,809,135,104 total) [00:01:22][2021-03-26.10:11:43] [Info] Address: 1F7GmqBsaijtTzubeuk32qC6Nn5MYAyfkT
Private key: 00000000000000000000000000000000000000000000000000000001A7CEB1E9
Compressed: yes
Public key:
03FD0E95164339B2F228CCF60A95F596FC706F5C5559F2D06AC7BBEED4BE1B2578
[2021-03-26.10:11:43] [Info] Address: 1CXTEzbAATX1D5YB3Ncci1gtBEEchT2JJs
Private key: 00000000000000000000000000000000000000000000000000000001A80EC32E
Compressed: yes
Public key:
020C60BB4BED07723B7D4537E4C7A6C437477EDD9CF19FDD458EFDA1EFDE1C02FE
GeForce 940M 505 / 2048MB | 2 targets 34.42 MKey/s (3,496,476,672 total) [00:01:42][2021-03-26.10:12:05] [Info] Address: 1KGqdarqVdTDS7qDxb4haaMqBMRZ4kJvEU
Private key: 00000000000000000000000000000000000000000000000000000001D3667A73
Compressed: yes
Public key:
0218FEB4168B89B4A118C8B1DA28309FD97405D979CA96165BC86FBA8E2C59A7E1
GeForce 940M 505 / 2048MB | 1 target 34.14 MKey/s (3,792,175,104 total) [00:01:51][2021-03-26.10:12:14] [Info] Address: 15MjvwJbHtbxJKy8AmZWXjXppk66qxYaoV
Private key: 00000000000000000000000000000000000000000000000000000001E5594206
Compressed: yes
Public key:
0259B67380B41AD100F4592503C2F260B13334374238724105BE03EE1602C1F1AE
[2021-03-26.10:12:14] [Info] No targets remaining
As you can see, not only MKey/s on screen is faster, but also time to solve is ~5% faster. Unfortunally I cannot test sp_'s mod on my Tesla GPUs, because, as I said earlier, it all working under Ubuntu. So I'll waiting for Linux release to made a more complex and interesting tests. |
|
|
|
And I don't care about speed at all; I care about results...in time.
On the one hand, of course you are right. But we are discussing a bruteforce program here. For bruteforce, the only indicator of the quality of work is important - it is the number of keys/addresses per second. If we are talking about randomness, then it is obvious that the program can select starting points in such a way that one target key is far from them, and the other is close, but this is not at all an indicator of the quality of work. For example, it is possible that someone wrote a program that instantly solved a some key in a wide range, due to the fact that one of the starting points coincided with the key - will this be an indicator of the speed of work? Personally, I'm interested in testing different algorithms, but in this case your program is not available, you only show some working logs. I also cannot fully test the modification from the sp_, since only executables for Windows are available, and 99% of my GPUs on Ubuntu. However, I saw a slight increase in speed on Windows machines, so in my opinion this modification at least has the right to life. |
|
|
|
puzzle #34 solved in 25 seconds with 1 1070ti. (44 seconds including the generation of starting points) https://github.com/sp-hash/Bitcrack/releases/tag/4#4 cuda 10.2 ptx With more speed. Might work on compute 8.0 devices as well, But the default thread/block/points configuration is using alot of memory. GeForce RTX 2080 8547 / 11264MB | 1 target 1404.22 MKey/s (12,834,570,240 total) [00:00:07][2021-03-24.22:28:20] [Info] Address: 1PWABE7oUahG2AFFQhhvViQovnCr4rEv7Q
Private key: 000000000000000000000000000000000000000000000000000000034A65911D
Compressed: yes
Public key:
033CDD9D6D97CBFE7C26F902FAF6A435780FE652E159EC953650EC7B1004082790
[2021-03-24.22:28:20] [Info] No targets remaining
Execution time = 27 seconds
Also your version throws an error when launched with default parameters: [Info] Initializing GeForce RTX 2080 Ti [Info] Generating 142,606,336 starting points (5440.0MB) [Info] Error: out of memory Successfully launched with -b 68 |
|
|
|
yes, it faster
my test
VanitySearch is faster
I am not sure can compare or not with method search for bitcrack and vanitysearch
brichard19 BitCrack ==> 11 MK/s
Bitcrack-sp-mod1 ==> 50 MK/s (full memory)
Bitcrack-spmod2 ==> 50 MK/s
VanitySearch-bitcrack ==> 70 MK/s
VanitySearch ==> 149 MK/s
command test
VanitySearch.exe -gpu 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
VanitySearch-bitcrack
GPU: GPU #0 GeForce GTX 1050 (5x128 cores) Grid(40x512)
80.121 MK/s (GPU 70.098 MK/s) (2^29.91) [00:00:12 lost_TIME_left infinity][0]
VanitySearch
GPU: GPU #0 GeForce GTX 1050 (5x128 cores) Grid(40x128)
[169.91 Mkey/s][GPU 149.29 Mkey/s][Total 2^29.95][Prob 0.0%][50% in 1.89065e+32y][Found 0]
problem
VanitySearch fast but it search full key 265bits
can not search by keyspace for puzzle #64
Original VanitySearch uses endomorphisms to perform fast additional checks for each key generated. For each key it checks K, K*lambda, K*lambda*lambda, -K, -K*lambda, -K*lambda*lambda - total 6 possible addresses. So, for original VanitySearch speed means addresses per second, not keys per second. These checks are not needed to find addresses in the range. That is why BitCrack and Vanity with bitcrack mode is much slower. |
|
|
|
Tesla V100 and Tesla P100 shows no difference between original and modified versions
What is the speed on the V100 and the P100, and what is the launch config? V100 -b 80 -t 512 -p 2800 ~1575Mkey P100 -b 112 -t 512 -p 2000 ~580Mkey |
|
|
|
Tesla V100 and Tesla P100 shows no difference between original and modified versions |
|
|
|
As for me, I observe the topic from time to time - you can be sure. However, I do not understand the question. I am not the creator of this challenge, but only run the main thread about it and take an active part in it. At this stage, I can only say that there is a problem with VanitySearch and BitCrack on the new NVIDIA GPU hardware (all RTX 30xx) with SM80 and SM86 architecture. If anyone has a desire and I can see the solution to the problem -> I refer to GitHub where I described as many details as possible: https://github.com/JeanLucPons/VanitySearch/issues/81#issuecomment-800473778As far as I know, you worked with JeanLucPons together to solve #115. Has he no longer interested in this project? On the Github, you can see that he is active, but is engaged in some other projects. |
|
|
|
Let's assume I roll the dice and get this 5 word diceware password:
unlinked graffiti trapeze tumble snoring
This diceware password is considered to have an entropy of ~12.92 bits (Math.log2(7776)).
Now I change the password to the following:
trapeze tumble snoring graffiti link
I changed one word (unlinked -> link) and I changed the sequence.
How can I calculate now entropy change of modified Diceware password?
If diceware dictionary consists of 7776 words, then each word adds 12.92 bits to entropy, so any 5-words passphrase has 64.6 bits entropy. Or do you want to calculate the entropy of the modified phrase, taking into account that someone knows the original phrase and the method by which it was modified? |
|
|
|
It is theoretically possible that during a tame and wild kangaroo collision test that the public key is hashed with SHA256d followed by RIPEMD160 to check these kind of hashes while still using the kangaroo method, however these would most certainly have to be GPU accelerated (will slow down the MKeys/s rate too much on CPU).
You cannot run wild kangaroos without public key, because you don't know starting point for them. If you know some address (or RIPEMD hash), you cannot calculate "next" or "previous" addresses. Every EC calculations requires point coordinates, which can be obtained from public or private keys only. Without public key the only possible use of birthday paradox, which is used in kangaroo method, it is to generate random points in range, then calculate distances between them. According to the birthday paradox, you will require sqrt(range) points to solve the key. But, since calculating the distances between random points requires the same amount of computation as brute force, this makes such an algorithm inapplicable in this case. |
|
|
|
|
