Keyhunt - development requests - bug reports

[mausuv]

albert why my post deleted auto

i need some tips for  subtract i am not understand
how to work to point subtract
any easy example


please dont remove my post again

[1715295761]

1715295761

[1715295761]

1715295761

[mausuv]

witch method use your code ./keysubtract  and ./keymath

./keymath 03d01115d548e7561b15c38f004d734633687cf4419620095bc5b0f47070afe85a - 3
Result: 03acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe
^
how to behind work ./kemath sub(-)
i know tow point add,multiple ,but subtracter not understand https://github.com/albertobsd/keysubtracter/blob/main/keysubtracter.c please

atleast  this c code https://github.com/albertobsd/keysubtracter/blob/main/keysubtracter.c decode to mathematical explain
for example :

c = K(qy-py)/(qx-px)
rx1 = K(c^2-px-qx)
ry2 = K(c*(px-rx)) #sorrymybadenglishspeak

[nomadsena]

adding more than one pub key to the input file in BSGS mode is severely  decreasing the performance like halving for every one extra pub key added to the input file. but somewhere in the thread i read that more pub keys dosent really effect the performance adversely. did anyone test. with one pub key i am getting 8pkeys/s add one more to the input file it drops to 4pkeys/s and so on.

[bigvito19]

adding more than one pub key to the input file in BSGS mode is severely  decreasing the performance like halving for every one extra pub key added to the input file. but somewhere in the thread i read that more pub keys dosent really effect the performance adversely. did anyone test. with one pub key i am getting 8pkeys/s add one more to the input file it drops to 4pkeys/s and so on.

You just answered your own question then, I only see people complain about if you add more public keys to BSGS it will decrease the performance.

[albert0bsd]

./keymath 03d01115d548e7561b15c38f004d734633687cf4419620095bc5b0f47070afe85a - 3
Result: 03acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe
^
how to behind work ./kemath sub(-)
i know tow point add,multiple ,but subtracter not understand

Subtraction is the same operation that addition.
A = C + B
But instead of using a positive value for B, B is negative

A = C + (-B)

did you see it now? It is the same Point Addition operation but with some value Negated

[toinou21]

hi guys,
Im running WSL2 and still got an error

~/keyhunt$ make
g++ -O3 -c oldbloom/bloom.cpp -o oldbloom.o
make: g++: No such file or directory
make: *** [Makefile:2: default] Error 127

Did I miss a step  ?




nevermind....it is working now, and I have no idea why. 

[albert0bsd]

nevermind....it is working now, and I have no idea why. 

Maybe you installed the build-essentials packages.

[mausuv]

hi my all questions...? please reply.


btc private keys brute force other tool compare best for ./keyhunt i am recommended for ,all cpu user
i use ./keyhunt tool i am reach 990 Pkeys/s 120Puzzle.txt its good 

i am see other people ./.keyhunt speed for 100 to 200 Ekeys/s its good

Questions:
 
     1. i am not gpu user, you can show ./keyhunt gpu speed screenshot
     2. how to increase speed for my target  how many cpu i need
     3. my  site show 64 puzzle result  https://hashkeys.club/64/results/ all pepole show your 120puzzle final range easy to find me
     4. share with me how to learn bloom filter quickly for 3 days form the scratch C,C++ java and Python #i_am_fast_learner
     5.@albert0bsd your code limited Ykeys/s why? any update tips for my target




                                                                    1000000000000000000000000000000000000000000000000000000000000000 #1+63zero
my target One Novemdecillion/persecond  1000000000000000000000000000000000000000000000000000000000000 #1+60zero

your reply write for question number specify like 12345.. #my_bad_english

Something is not right with your errors

For K = 1024 the bloom filter is only 4294967296  elements and your error show 110010218577920 that is something more, DID YOU EDIT THE CODE?

Another question is WHY THE FUCK are you using  YELLOW COLOR TO POST TEXT? Are you retard or just one more troll?

I hate python and i will never going to write one python.

hi albert solve my problem
my question k value i am increaae error bloom_init error why?..
my pc upgrade for 160cpu 256ram 1Tp stroage 990 Pkeys/s


./keyhunt -m bsgs -f 120.txt -r 0:fffffffffffffffffffffff

• Version 0.2.211031 Trick or treat ¡Beta!, Developed by AlbertoBSD
• Mode BSGS secuential
• Opening file 120.txt
• Added 1 points from file
• Range
• -- from : 0x0
• -- to   : 0xfffffffffffffffffffffff
• N = 0x100000000000
• Bloom filter for 4194304 elements : 14.38 MB
• Bloom filter for 209716 elements : 0.72 MB
• Allocating 3.00 MB for 209716 bP Points
• processing 4194304/4194304 bP points : 100%
• Making checkums .. done
• Sorting 209716 elements... Done!

^C] Thread 0x1200000000001

usermanu111@root:~$ ./keyhunt -m bsgs -f 120.txt -r 0:fffffffffffffffffffffff -k 1024

• Version 0.2.211031 Trick or treat ¡Beta!, Developed by AlbertoBSD
• K factor 1024
• Mode BSGS secuential
• Opening file 120.txt
• Added 1 points from file
• Range
• -- from : 0x0
• -- to   : 0xfffffffffffffffffffffff
• N = 0x100000000000
• Bloom filter for 4294967296 elements [E] error bloom_init [106]

usermanu111@root:~$ ./keyhunt -m bsgs -f 120.txt -r 0:fffffffffffffffffffffff -k 512

• Version 0.2.211031 Trick or treat ¡Beta!, Developed by AlbertoBSD
• K factor 512
• Mode BSGS secuential
• Opening file 120.txt
• Added 1 points from file
• Range
• -- from : 0x0
• -- to   : 0xfffffffffffffffffffffff
• N = 0x100000000000
• Bloom filter for 2147483648 elements [E] error bloom_init [213]

usermanu111@root:~$./keyhunt -m bsgs -f 120.txt -r 0:fffffffffffffffffffffff -k 412

• Version 0.2.211031 Trick or treat ¡Beta!, Developed by AlbertoBSD
• K factor 412
• Mode BSGS secuential
• Opening file 120.txt
• Added 1 points from file
• Range
• -- from : 0x0
• -- to   : 0xfffffffffffffffffffffff
• N = 0xfffdc000000
• Bloom filter for 1728053248 elements : 5923.57 MB

[E] error bloom_init for 86402663 elements

./keyhunt -m bsgs -f 120.txt -r 0:fffffffffffffffffffffff -k 160 -n 0x10000000000000

• Version 0.2.211031 Trick or treat ¡Beta!, Developed by AlbertoBSD
• K factor 160
• Mode BSGS secuential
• Opening file 120.txt
• Added 1 points from file
• Range
• -- from : 0x0
• -- to   : 0xfffffffffffffffffffffff
• N = 0xfffff00000000
• Bloom filter for 10737418240 elements [E] error bloom_init [42]

./keyhunt -m bsgs -f 120.txt -r 0:fffffffffffffffffffffff -k 160 -n 0x400000000000

• Version 0.2.211031 Trick or treat ¡Beta!, please dont ban me....
• K factor 160
• Mode BSGS secuential
• Opening file 120.txt
• Added 1 points from file
• Range
• -- from : 0x0
• -- to   : 0xfffffffffffffffffffffff
• N = 0x3fffc0000000
• Bloom filter for 1342177280 elements : 4600.83 MB
• Bloom filter for 67108864 elements : 230.04 MB
• Allocating 1024.00 MB for 67108864 bP Points
• processing 0/1342177280 bP points : 0%

[moderator's note: consecutive posts merged]

[albert0bsd]

    1. i am not gpu user, you can show ./keyhunt gpu speed screenshot

No because my keyhunt is only for CPU

    2. how to increase speed for my target  how many cpu i need

What?

    3. my  site show 64 puzzle result  https://hashkeys.club/64/results/ all pepole show your 120puzzle final range easy to find me

What is the question here?

    4. share with me how to learn bloom filter quickly for 3 days form the scratch C,C++ java and Python #i_am_fast_learner

Check the code of the bloom filter that im using, it is pretty easy to understand.
https://github.com/jvirkki/libbloom
Also this video is pretty descriptive:

https://www.youtube.com/watch?v=Z9_wrhdbSC4

    5.@albert0bsd your code limited Ykeys/s why? any update tips for my target

Because no one ever will reach more than some Exakeys / s in this century.

[mausuv]

keyhunt not find this public keys try  why?....
i use this verison https://github.com/albertobsd/keyhunt/tree/9f33eda2354249ea984db37613f4a0a6869c9114

./keyhunt -m bsgs -f 120.txt -r 900000000000000000000000000000:a00000000000000000000000000000 -t 2

i test some keys
039c069f5b3d1e4ac53e7c93b4b9cbc2a8b520ad25b227ecd5222f5f73e7ef8c92 private key 90000000000000000000f000000000
02b33f524226b0db26cb8bcb2b374100bd1b3e07900f0be5402d1277e80d392479 private key 90000000000000000000000f000000
028445b96038e322d51c173b19f3def3113e228d948fbaa0d4ebe6fdf1f21f834d private key 900000000000000000000f00000000

guys try this publickey https://brainwalletx.github.io/


edit: can not find try this
./keyhunt -m bsgs -f 120.txt -r a00000000000000000000000000000:ffffffffffffffffffffffffffffff -t 2
02ea7309a8087be07f2b303bf274ce9d1749ced28807fd23c12f14eab57a441556 private key a00000000000000000000f00000000
031df078c3f87ac4aec65597106906c88edaeb45a5ba2ea49eca2d80ca8e5a42b6 private key a000000000000000000f0000000000

[albert0bsd]

Well i try to find those keys and it only found one of the first three.

Code:

albertobsd $ cat test.txt
039c069f5b3d1e4ac53e7c93b4b9cbc2a8b520ad25b227ecd5222f5f73e7ef8c92 # 90000000000000000000f000000000
02b33f524226b0db26cb8bcb2b374100bd1b3e07900f0be5402d1277e80d392479 # 90000000000000000000000f000000
028445b96038e322d51c173b19f3def3113e228d948fbaa0d4ebe6fdf1f21f834d # 900000000000000000000f00000000
albertobsd $ ./keyhunt -m bsgs -f test.txt -r 900000000000000000000000000000:900000000000000010000000000000 -k 128 -S -q
[+] Version 0.2.211117 SSE Trick or treat ¡Beta!, developed by AlbertoBSD
[+] K factor 128
[+] Quiet thread output
[+] Mode BSGS secuential
[+] Opening file test.txt
[+] Added 3 points from file
[+] Range
[+] -- from : 0x900000000000000000000000000000
[+] -- to   : 0x900000000000000010000000000000
[+] N = 0x100000000000
[+] Bloom filter for 536870912 elements : 1840.33 MB
[+] Bloom filter for 16777216 elements : 57.51 MB
[+] Bloom filter for 524288 elements : 1.80 MB
[+] Allocating 8.00 MB for 524288 bP Points
[+] Reading bloom filter from file keyhunt_bsgs_4_536870912.blm .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_6_16777216.blm .... Done!
[+] Reading bP Table from file keyhunt_bsgs_2_524288.tbl .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_7_524288.blm .... Done!
[+] Thread Key found privkey 90000000000000000000000f000000
[+] Publickey 02b33f524226b0db26cb8bcb2b374100bd1b3e07900f0be5402d1277e80d392479

End

Thanks for report it

The weird thing is that if I look for the next publickeys it found all:

Code:

021fc9e584dc824cb5b566bb7125aef1e31c95fb2fbabc7c315686b3c211d69ed8 # 90000000000000000000f000000001
02df23c15df7b3ba9fdb14fd5a994d7ba4c694f172ddf3f644fb47b4b399e214bb # 90000000000000000000000f000001
03e3a37d2332821cfe5ca644b26d640a707497870298e084c443d94670b00c5552 # 900000000000000000000f00000001

Code:

albertobsd $ ./keyhunt -m bsgs -f test1.txt -r 900000000000000000000000000000:900000000000000010000000000000  -S  -k 128 -q
[+] Version 0.2.211117 SSE Trick or treat ¡Beta!, developed by AlbertoBSD
[+] K factor 128
[+] Quiet thread output
[+] Mode BSGS secuential
[+] Opening file test1.txt
[+] Added 3 points from file
[+] Range
[+] -- from : 0x900000000000000000000000000000
[+] -- to   : 0x900000000000000010000000000000
[+] N = 0x100000000000
[+] Bloom filter for 536870912 elements : 1840.33 MB
[+] Bloom filter for 16777216 elements : 57.51 MB
[+] Bloom filter for 524288 elements : 1.80 MB
[+] Allocating 8.00 MB for 524288 bP Points
[+] Reading bloom filter from file keyhunt_bsgs_4_536870912.blm .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_6_16777216.blm .... Done!
[+] Reading bP Table from file keyhunt_bsgs_2_524288.tbl .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_7_524288.blm .... Done!
[+] Thread Key found privkey 90000000000000000000f000000001
[+] Publickey 021fc9e584dc824cb5b566bb7125aef1e31c95fb2fbabc7c315686b3c211d69ed8
[+] Thread Key found privkey 90000000000000000000000f000001
[+] Publickey 02df23c15df7b3ba9fdb14fd5a994d7ba4c694f172ddf3f644fb47b4b399e214bb
[+] Thread Key found privkey 900000000000000000000f00000001
[+] Publickey 03e3a37d2332821cfe5ca644b26d640a707497870298e084c443d94670b00c5552
All points were found

[mausuv]

@albertobsd

iknow r s1s2  value
i need z1z2 how to calculate
i read this post explain testnet ,i am not understad https://bitcointalk.org/index.php?topic=5327054.msg56686056#msg56686056
https://bitcointalk.org/index.php?topic=977070.msg10669517#msg10669517 #read 1,3page

please explain stepy by step calulate z1z2  from bitcoin mainet or write code

[albert0bsd]

@albertobsd

iknow r s1s2  value
i need z1z2 how to calculate

please learn algebra

if you have doubt of those post, please write your doubt there NOT HERE.

[Alpaste]

Hello albertobsd i have a Questions outside and inside this awesome program that you have made.
i've been looking for correct answers for weeks, but everyone says differently so your the one who to ask, because you're a bitcoin expert here.
Questions:


So total  possible public keys are 2^256 and are mapped to a set of 2^160 (160 bits) addresses. Since there are more public keys and private keys than addresses, but every public key can be mapped to an 160 bits address, there must be then in average 2^256 / 2^160 = 2^96 keys to each address. so if there are 2^96 addresses for each bitcoin address, so does all that 2^96 addresses that one Address have, share ALL the same public key? because that's what you need  in order to have the same RIPEMD-160 hash. so only private key which changes, not public key with the 2^96 key possible keys per Address right?

==========

Another Question related:

So if all my thoughts are right, then from what i understood, All addresses of bitcoin exists only 1 TIME from the range ( 160 bits ) 0 - ( FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF ), and the rest 2^96 addresses per address start to exists after the range of 2^160, so starting from 2^161. Is that also correct?


==========


Last Question.

Then if bitcoin addresses have 160 bits, can't we just try to Bruteforce that 160 bits from ( 0 - FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF )  Hex-Range with  high number of  Random peta/keys checks - - using BSGS, won't we have a 1 of 2^160 chance of unlocking any addresses that have the public key? can that work using BSGS right, or with BSGS that method doesn't work? (even with low chance, i still believe in luck)

==========

if you could answer all this three Question, then i really appreciate it!
Best regards.

[albert0bsd]

So total  possible public keys are 2^256 and are mapped to a set of 2^160 (160 bits) addresses. Since there are more public keys and private keys than addresses, but every public key can be mapped to an 160 bits address, there must be then in average 2^256 / 2^160 = 2^96 keys to each address. so if there are 2^96 addresses for each bitcoin address, so does all that 2^96 addresses that one Address have, share ALL the same public key? because that's what you need  in order to have the same RIPEMD-160 hash. so only private key which changes, not public key with the 2^96 key possible keys per Address right?

In theory there are 2^96 privatekeys for each bitcoin address. Yes! that is correct. And each one of those 2^96 private keys will generate a different publickey but all those 2^96 publickeys will generate the same rmd160 hash.

Also one address can be generated from compressed or uncompressed publickey

But actually no one has ever found one example.

So if all my thoughts are right, then from what i understood, All addresses of bitcoin exists only 1 TIME from the range ( 160 bits ) 0 - ( FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF ), and the rest 2^96 addresses per address start to exists after the range of 2^160, so starting from 2^161. Is that also correct?

All addresses of bitcoin exists only 1 TIME from the range... there are no proof of that "ONLY ONE TIME..." maybe yes but repeat there is no proof of that.

There are the possibility that one address have 1 or more private keys under the range of 2^0 to 2^160
If my previous sentence is correct then that means that there are ranges of 160 bits that can haven't a specific address for example the "1111111111111111111114oLvT2" hash rmd160:  0000000000000000000000000000000000000000

We haven't enough computer power to prove  or disprove that, proof of that is that the puzzle 64 is still there.

Then if bitcoin addresses have 160 bits, can't we just try to Bruteforce that 160 bits from ( 0 - FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF )  Hex-Range with  high number of  Random peta/keys checks - - using BSGS, won't we have a 1 of 2^160 chance of unlocking any addresses that have the public key? can that work using BSGS right, or with BSGS that method doesn't work? (even with low chance, i still believe in luck)

Not really because there are 2^256 publickeys different for each other so unless that publickey was under that 2^160 range, only in that case it will be found.

But we still can't solve the publickey for the puzzle 120

Times to solve the puzzle 160 at specific speeds:

Code:

Puzzle 160 @ 1 Megakeys/s  (10^6):      23171956451847141650870193314248525 years
Puzzle 160 @ 1 Gigakeys/s  (10^9):      23171956451847141650870193314248 years
Puzzle 160 @ 1 Terakeys/s  (10^12):     23171956451847141650870193314 years
Puzzle 160 @ 1 Petakeys/s  (10^15):     23171956451847141650870193 years
Puzzle 160 @ 1 Exakeys/s  (10^18):      23171956451847141650870 years
Puzzle 160 @ 1 Zettakeys/s  (10^21):    23171956451847141650 years
Puzzle 160 @ 1 Yottakeys/s  (10^24):    23171956451847141 years

[PawGo]

Also one address can be generated from compressed or uncompressed publickey

Did you mean "one private key may generate two different addresses, depending which public key is used"?

All we may talk about are only numbers, and that's true that using hash which may produce maximally 2^160 results limits somehow the number of addresses. BUT: nowadays we do not have power to try each of them. We know there are collisions, but we cannot USE them.
And that's true that one private key produce public key which may be used in any of two forms, and that's true that it would be possible that uncompressed public key from one priv key generates the same address as compressed pubkey from another priv key. But we have only assumptions, no tools.

If one day we would create addresses based on other transformation of public key, we would be in completely different situation.

One remark - people have problems with exponentiation, as it is not in common use in every day life. We add, multiply... But in general it is no obvious to understand what is the difference between 2^10 and 2^11 comparing to 2*10 and 2*11.
And then to realize the difference between 2^60 and 2^64...

[albert0bsd]

Did you mean "one private key may generate two different addresses, depending which public key is used"?

No, i mean the other thing that you said after:

and that's true that it would be possible that uncompressed public key from one priv key generates the same address as compressed pubkey from another priv key.

[bigvito19]

Let me ask this about keyhunt, if we are searching for public keys, how come we have to search in the whole range? For example, if we are looking for key #120 we have to search in the whole range of 2^120?

[mynonce]

Let me ask this about keyhunt, if we are searching for public keys, how come we have to search in the whole range? For example, if we are looking for key #120 we have to search in the whole range of 2^120?

#120: private key is between 2^119 and 2^120 - 1
...
and the last key
#160: private key is between 2^159 and 2^160 - 1

[PawGo]

Let me ask this about keyhunt, if we are searching for public keys, how come we have to search in the whole range? For example, if we are looking for key #120 we have to search in the whole range of 2^120?

For puzzle ranges are coming one by one and each range is bigger (wider?). But you do not launch search from the beginning (key=1), but in the specific range, which is in fact result of previous ranges.