Keyhunt - development requests - bug reports

[Spawnx]

Code:

[+] 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 ?

[1715296393]

1715296393

[1715296393]

1715296393

[1715296393]

1715296393

[1715296393]

1715296393

[1715296393]

1715296393

[bigvito19]

Code:

[+] 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

[GR Sasa]

Hello albert0bsd,

Did you see the new challenge/puzzle that is worth 500 Bitcoins? it's called wif500. I

It's a challenge where a wallpaper has been burned so it misses the first 12 letters of the WIF private key. The address has 500 BTC in total.

Can you please give us your opinion about this puzzle? is it real? is it possible to solve it by any chance? is this a scam? What kind of coding/program does it need so it can be solved? (since the beginning of the private key that it's missing)

if it's real can you please develop something to get the first 12 letters of the WIF? (even by trying with luck i believe in luck and it's big money 20 millions euros so yeah,,)

regards,,

Challenge/puzzle link: https://github.com/phrutis/wif500

[albert0bsd]

Hello albert0bsd,

Did you see the new challenge/puzzle that is worth 500 Bitcoins? it's called wif500. I

It's a challenge where a wallpaper has been burned so it misses the first 12 letters of the WIF private key. The address has 500 BTC in total.

Can you please give us your opinion about this puzzle? is it real? is it possible to solve it by any chance? is this a scam? What kind of coding/program does it need so it can be solved? (since the beginning of the private key that it's missing)

if it's real can you please develop something to get the first 12 letters of the WIF? (even by trying with luck i believe in luck and it's big money 20 millions euros so yeah,,)

regards,,

Challenge/puzzle link: https://github.com/phrutis/wif500

Is fake

[GR Sasa]

This is very true. this challenge is so suspicious actually because why in hell does he publish a closed source program?
maybe if someone finds the key it encrypt it so no one can unlock it except him? (assuming if it's real)

[WanderingPhilospher]

This is very true. this challenge is so suspicious actually because why in hell does he publish a closed source program?
maybe if someone finds the key it encrypt it so no one can unlock it except him? (assuming if it's real)

Yes, that is exactly why...but he says that if you read the github.
If he did not encrypt (I imagine he shifted target key, sub or add), then anyone could run the unran/free ranges and claim (if there is actually a prize) all of the BTC.

[fxsniper]

I think all tools should be open-source code for transparent
it is dangerous to use tools not show code may use GPU for calculating some hidden when using it

for user
use all tools should block internet access on that tools before using or unplug wifi and use it offline

[GR Sasa]

Yes exactly.

Well i actually suspect that the creator of the ''challenge'' has claimed that he lost 500 bitcoins and want us to search for him for the remaining 12 private key characters, where in reality we might actually be searching for something else,,,,, like for puzzle 64's private key!!

he might actually have lied to us and to anyone who is searching and using his closed-program they might just be searching for puzzle 64 private key for him instead of the claimed 500 bitcoins private key....

Could be that case, that we fell in trap and he is letting us search for puzzle 64 instead?

That's why he is using a closed-program, so we can't notice that we're searching for something else rather than the 500 BTC's key.

that is my suspecting only. I can be wrong though.

[WanderingPhilospher]

Yes exactly.

Well i actually suspect that the creator of the ''challenge'' has claimed that he lost 500 bitcoins and want us to search for him for the remaining 12 private key characters, where in reality we might actually be searching for something else,,,,, like for puzzle 64's private key!!

he might actually have lied to us and to anyone who is searching and using his closed-program they might just be searching for puzzle 64 private key for him instead of the claimed 500 bitcoins private key....

Could be that case, that we fell in trap and he is letting us search for puzzle 64 instead?

That's why he is using a closed-program, so we can't notice that we're searching for something else rather than the 500 BTC's key.

that is my suspecting only. I can be wrong though.

Def not for  #64 or #120...not enough ranges covered and not enough firepower, for long enough.

I used a closed source for the #64 pool b/c we had 15-20 people working on it and if I would have left it open source, someone could have tweaked the code and if they found the key, kept it for themselves.

I wonder if the puzzle is real and if the letters and numbers have been deciphered correctly. It took me 10 minutes to get the second address correctly and still did not decipher it's wif, even though all characters are present LOL!

[math09183]

I think there is nothing extra, as phrutis is too stupid to develop any software. He is just a regular russian thief, he takes someone's software, copy/paste to his repo, changes name and sells like his own.
In that case he took WifSolveCuda, hardcoded ranges and removed printing data to the screen.
WIF is obviously fake, known for months, but as long as russians waste their time and electricity on that, I am fine.

[albert0bsd]

Please guys stay on keyhunt topic, avoid any comment of those fake wifs

[Spawnx]

Hey albert0bsd,

I assume that in BSGS mode there no no such option as random changed key after a given key value searched?

Something like in VanitySearch there is -r as for random but also a value after how many searched keys the key is changed

[fxsniper]

Please guys stay on keyhunt topic, avoid any comment of those fake wifs

Hi, albert0bsd

I would like to understand BSGS, Can you help to explain some methods? (I can study in detail more)
I understand kangaroos (a little some part) and understand some entropy or scalar for the Elliptic curve convert private key to public key
a lot of bitcoin and cryptography I do not yet understand clear

[albert0bsd]

Imagine that you have one Single operation to check if some Publickey P(x) is between some fixed range lets to say from 1 to 1M such operation will be like:

Code:

if 1 <= P(x) <= 1M
	print "Found :)"
else
	print "Not Found :("

That operation doesn't exist because Public keys are hidden numbers they hide the x value (Private key)

So, what happened if you have the Cache of the first million keys, you only need to have a function that let you know if some publickey is inside of one array

Code:

if is_publickey_in_array(P(x),array)
	print "Found :)"
else
	print "Not Found :("

to be computationally efficient, that function need to be fast O(1), There are a lot of Data structures that can do that, Hashtables, maps, bloomfilters etc, or some combinations between them.

What BSGS Do?

The first step is try to translate the P(x) to the keyspace between 1 to 1M (This amount can be changed this depends of the available memory), this operation is done by one single subtraction.

Lets to say that the value of x is 100123987

Code:

P(100123987) = 03992723319651c25a1e3dc624af41a8625a90c3c455f806a4a2b385175750b211
P(100000000) = 03df77e24113f1c6093dc99e62e63737c97821c854bf03b171b7fefbd81acec408
P(100123987) - P(100000000) = P(123987)
P(123987) = 02ee35e4236c7b0b269c88b1da75b9a068a7227bd847a931c55587ec4017b2cd98

If we check for the function that value of P(123987) is in the array is_publickey_in_array(P(x),array) then the the result will be that we found the key, you only need to find what of those Million of values is your key and then just do some additions to recover the original KEY.

For the previous example imagine that you start from 1 to reach 100M you only need 100 Point Subtractions and 100 checks in the arrays, so instead of bruteforce that publickey 100 Million times you only need 100 basic operations that is why bsgs is some fast

This is a basic example, the real BSGS need some extra considerations like work with Perfect squares numbers, and also will be better if we work with Base 2 numbers like  2^Y numbers

This is an example with One million of publickeys in cache, now imagine what you can do with with some Billions of keys in your cache.

you can read more of BSGS in https://andrea.corbellini.name/2015/06/08/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa/

I assume that in BSGS mode there no no such option as random changed key after a given key value searched?

The -R option enable the random search, every time that one thread do a search it chose a different random number, this is EVERY single cycle one random number is chossen.

Regards!

[CoinMagus]

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.

Code:

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)

[bigvito19]

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.

Code:

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.

[CoinMagus]

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.

I don't quite understand what you are trying to convey. We're already looking for a ^120-bit range, how come in BSGS mode you detect a ^120-bit field as ^60-bits?

Also, loading 2 billion 700 million points in BSGS mode will not be efficient. Searching for a point with the -R option will take much longer.

[fxsniper]

Thank you albert0bsd
I will try to read and make understand

Did BSGS have code in python so I can read the code and run a test it to make understand?

[WanderingPhilospher]

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.

Code:

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)

Wow! Impressive; 2,700,000,001 unique xpoints?!?! How long did that take to create and what is the size of that file? How much RAM does your system have lol?!
Also, how long did it take for the program to load all of those xpoints before it started working?

[CoinMagus]

Wow! Impressive; 2,700,000,001 unique xpoints?!?! How long did that take to create and what is the size of that file? How much RAM does your system have lol?!
Also, how long did it take for the program to load all of those xpoints before it started working?

I don't remember exactly, but on average:

It took 5-6 hours to generate the file with keysubtructer.

Code:

-rw-r--r-- 1 root root 180900000067 May 12 23:20 200.txt

Booting with keyhunt took about 3 hours.

Code:

/0/4                      processor      Intel(R) Xeon(R) Platinum 8370C CPU @ 2
/0/6                      memory         64GiB System Memory