Pages:
Author

Topic: Keyhunt - development requests - bug reports - page 15. (Read 11571 times)

newbie
Activity: 48
Merit: 0
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

hero member
Activity: 828
Merit: 657
Please guys stay on keyhunt topic, avoid any comment of those fake wifs
member
Activity: 170
Merit: 58
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.
full member
Activity: 1050
Merit: 219
Shooters Shoot...
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!
member
Activity: 177
Merit: 14
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.
member
Activity: 406
Merit: 45
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


full member
Activity: 1050
Merit: 219
Shooters Shoot...
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.
member
Activity: 177
Merit: 14
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)
hero member
Activity: 828
Merit: 657
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
member
Activity: 177
Merit: 14
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
full member
Activity: 706
Merit: 111
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
newbie
Activity: 48
Merit: 0
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 ?
newbie
Activity: 48
Merit: 0
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  Huh

Try this one instead doesn't give errors https://github.com/XopMC/keyhunt-win

Thanks!!!
full member
Activity: 706
Merit: 111
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  Huh

Try this one instead doesn't give errors https://github.com/XopMC/keyhunt-win
newbie
Activity: 48
Merit: 0
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  Huh
full member
Activity: 706
Merit: 111
albert0bsd, would it be better to use a .bin than a .blm to store the public keys?
That shouldn't effect the overall speed.
hero member
Activity: 828
Merit: 657
a probably stupid question, but is it actually possible to mine Bitcoin using BSGS algorithm? If not possible, why not?

Is not possible.

Because Mining for bitcoin is a proof of work with sha256.

BSGS is only an algorithm for computing discrete logarithms on elliptic curve.

If you want to know more about it please READ the next two links:

https://andrea.corbellini.name/2015/06/08/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa/

https://www.oreilly.com/library/view/mastering-bitcoin/9781491902639/ch04.html
jr. member
Activity: 37
Merit: 1
Hello Albert0bsd,

a probably stupid question, but is it actually possible to mine Bitcoin using BSGS algorithm? If not possible, why not?

much regards!
jr. member
Activity: 70
Merit: 1
Yes in a perfect bsgs that is the amount:

(2^120)^(1/2) = 1152921504606846976 = 2^60

But just make the calculations how many memory is necessary to store 2^60 of precalculated data using 20 bytes per item in the bloom filter and hashtable:

20971520 Terabytes of RAM

And that is only the first part (Baby steps) we need to iterate over the other half 2^60 to make subtractions of the publickey with our current range (Giant step).



test.txt
Code:
./keyhunt -m bsgs -f 120 -r 7357a4501ddfe92f46681b20a0:d576e7357a4501ddff92f46681b20ff
./keyhunt -m bsgs -f 120 -r 3fffffffffffffffffffffffffffffff:3fffffffffffffffffffffffffffffffaeaff
./keyhunt -m bsgs -f 120 -r bfffffffffffffffffffffffffffffff0c0325ad0376782ccfddc6e99c28b0f0:bfffffffffffffffffffffffffffffff0c0325ad0376782cffddc6e99c28b0ff
etc...
etc..
etc..

hi guys, how to run my test.txt because, every time i copy past and Run ./keyhunt
small update please,once range complete open my test.txt and run the next range
understand my problom ,sorry i speak little english

so, please tell how to run one by one my custom range>>>my test.txt

any python method to run ./keyhunt
hero member
Activity: 828
Merit: 657
Yes in a perfect bsgs that is the amount:

(2^120)^(1/2) = 1152921504606846976 = 2^60

But just make the calculations how many memory is necessary to store 2^60 of precalculated data using 20 bytes per item in the bloom filter and hashtable:

20971520 Terabytes of RAM

And that is only the first part (Baby steps) we need to iterate over the other half 2^60 to make subtractions of the publickey with our current range (Giant step).

Pages:
Jump to: