I already told you to just change lines 17 and 18 to 256 and it will work https://asecuritysite.com/ecc/ecdk1 = random.randrange(1, pow(2, 256)) k2 = random.randrange(1, pow(2, 256)) private key ot found. only message"private kwy", but no second message "privatevkey found" What private key it was looking for because it was random |
|
|
|
I already told you to just change lines 17 and 18 to 256 and it will work https://asecuritysite.com/ecc/ecdk1 = random.randrange(1, pow(2, 256)) k2 = random.randrange(1, pow(2, 256)) |
|
|
|
|
I was attempting to use this but did get a lot if errors.
|
|
|
|
I can't believe it, there are 2 billion 700 million points and I watch in amazement that it can't find it. Hey Alberto, I appreciate your work, but we're not going to find the private key this way, man. root@os:/mnt/keyhunt# ./keyhunt -t 8 -m xpoint -f 200.txt -r 800000000000000000000000000000:80000FFFFFFFFFFFFFFFFFFFFFFFFF -I 0x10000000000000000000000000 -n 0x80000 -R -q
[+] Version 0.2.211117 SSE Trick or treat ¡Beta!, developed by AlbertoBSD
[+] Threads : 8
[+] Mode xpoint
[+] Random mode
[+] Quiet thread output
[+] Stride : 1267650600228229401496703205376
[+] Opening file 200.txt
[+] N = 0x80000
[+] Range
[+] -- from : 0x800000000000000000000000000000
[+] -- to : 0x80000fffffffffffffffffffffffff
[+] Allocating memory for 2700000001 elements: 51498.41 MB
[+] Bloom filter for 2700000001 elements.
[+] Loading data to the bloomfilter total: 9255.29 MB
[+] Bloomfilter completed
[+] Sorting data ... done! 2700000001 values were loaded and sorted
[+] Total 2626285058048 keys in 155310 seconds: ~16 Mkeys/s (16909954 keys/s)
Try BSGS mode instead of xpoint mode because in xpoint mode the search space is 2^120 not 2^60. Most likely you won't find anything in xpoint mode. |
|
|
|
Just change lines 17 and 18 to 256 k1 = random.randrange(1, pow(2, 256)) k2 = random.randrange(1, pow(2, 256)) |
|
|
|
|
What algorithm or tool so far that can do 2^160 or 2^96 search range. Only thing I can think is vanitygen and vanity search.
|
|
|
|
Use whatever you want, just not from that russian thief. All he does is copy/paste from other repos (not fork), he changes name and says like it belongs to him. I also cannot recommend his tools, especially when he ran shady brute-force challenge[1]. But i'm not sure he can be called thief when AFAIK he don't violate original repository license. Although i can understand uneasiness that he don't use GitHub fork feature when the original source code also hosted on GitHub. [1] https://bitcointalk.org/index.php?topic=5394745.0If his tools work, they work. If the challenge is fake or if you think its fake just don't participate in it. |
|
|
|
@fxsniper
Hello
You won't notice much speed difference on this case.
Only thing pubkey bruteforce fastest is BSGS, because it's come after only 1 step(value*G). no need double SHA2,RIPEMD160,BASE8
address or RIPEMD160 won't make much noticeable difference in bruteforce.
OK, I just think simple maybe calculate SHA-256 and RIPEMD160 it is maybe fast that Elliptic curve point calculate I think with 1 step(value*G). it is calculated 256 times (loop) for each bit maybe make full key brute-force slow You can use this too for Hash160 https://github.com/phrutis/Rotor-Cuda you can use a GPU with this. |
|
|
|
Brainless hack this adresses ? Are you sure it was Brainless, if so, I wonder how he did it? |
|
|
|
[+] Version 0.2.211222 SSE Server Edition ,modify Dusky Kam 3,compiled by @XopMC for t.me/brythbit, developed by AlbertoBSD, developed by AlbertoBSD
[+] Random mode
[+] K factor 4096
[+] Quiet thread output
[+] Threads : 50
[E] Unknow opcion -p
[+] Mode BSGS random
[+] Opening file 4000.txt
[+] Added 1 points from file
[+] Bit Range 256
[+] -- from : 0x8000000000000000000000000000000000000000000000000000000000000000
[+] -- to : 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141
[+] N = 0x100000000000
[+] Bloom filter for 17179869184 elements : 58890.60 MB
[+] Bloom filter for 536870912 elements : 1840.33 MB
[+] Bloom filter for 16777216 elements : 57.51 MB
[+] Allocating 256.00 MB for 16777216 bP Points
[+] processing 17179869184/17179869184 bP points : 100%
[+] Making checkums .. ... done
[+] Sorting 16777216 elements... Done!
[+] Total 21063423857946682982400 keys in 18450 seconds: ~1 ExaKeys/s (1141648989590606123 keys/s)
In random mode, how often does the range change ? Can we set the parameter somehow ? Every second it hashes its random |
|
|
|
I tested via Windows 10 and all modes work.
Code and exe files are on github.
Thank you so much Hey WanderingPhilospher , how do You run Your version on win 10? , using standard command promp in Win gives missing libraries errors, complete Linux noob here btw  Try this one instead doesn't give errors https://github.com/XopMC/keyhunt-win |
|
|
|
|
albert0bsd, would it be better to use a .bin than a .blm to store the public keys?
That shouldn't effect the overall speed.
|
|
|
|
|
Its 80 bits in the 120 bit range, not 80 bits in the 80 bit range. Its not like that at all, its a 80 bit difference on the 120 key.
|
|
|
|
I found a method to find any private key within 2^255 bit space. Is that new?
Depends on what the method is, what is the method? |
|
|
|
000000000000000
fffffffffffffff
0230960F9F8099D13485EDE4817C4C9B88620A99F96060434E4E47B4FB07C6A73B
Priv: 0x555555555555555
I use Jean-Luc kangaroo version 2.2 and I found it. I notice it solved when I didn't have the grid on it like (240,128) (256,256)
Bro. What DP you use ? Waiting answer of CoinMagus maybe hi use another soft Does JLP kangaroo support A4000 - A6000 VIDEO CARD ? Thank you bro Jean-Loc uses Cuda, so if its Cuda yea. Long as it NVIDIA it should work. I didn't put a DP, it used 7 automatically. It solved in a couple of seconds My cmd line was Kangaroo.exe -t 0 -gpu in.txt |
|
|
|
|
000000000000000
fffffffffffffff
0230960F9F8099D13485EDE4817C4C9B88620A99F96060434E4E47B4FB07C6A73B
Priv: 0x555555555555555
I use Jean-Luc kangaroo version 2.2 and I found it. I notice it solved when I didn't have the grid on it like (240,128) (256,256)
|
|
|
|
|
How come no one has attempted to put a bloom filter on kangaroo. Kangaroo hasn't been updated of modified.
JeanLucPons commented on May 7, 2020
Yes, I added load/save/work
The multi key will be done with the help of theses new features.
The idea is to allow to pre compute large tame kangaroo file and to solve multiple key using this file.
Then when a key is solved, all the wild will become tame and more keys are solved more chance to solve the others....
JeanLucPons commented on May 8, 2020
Yes,
I will add some note about this on the readme. It is a bit tricky.
Multi key support is not yet supported, for this you will need first to create a large tame array for a given range and then attack keys with it.
|
|
|
|
|
Show Posts
