Topic: Keyhunt - development requests - bug reports - page 23. (Read 15202 times)

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

No because my keyhunt is only for CPU


What?


What is the question here?


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


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

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

---

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]

Maybe you installed the build-essentials packages.

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. 

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

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.

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.

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

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

Is using intel optane persistent memory has any effect on the speed compared to the regular Dram? Has anyone tested with it ?

---

And one more thing dose the refersh rate of the RAM effect the performance in anyway

[moderator's note: consecutive posts merged]

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.

my question update
edit: https://bitcointalksearch.org/topic/keyhunt-development-requests-bug-reports-5322040

Please post here your error

please guide me

my pc for 80 cpu 256 GP ram, 1TP stroage

 ./keyhunt -m bsgs -f 120.txt -b 120 -S -t 2 - k 10 >>>>>>>>>> k value i am increaae system bloom filter error why
only one public key use 2 petakeys / per seconed
how to reached 10 Exabyte keys per second please solve my problem

Exactly. i was testing the code, if i have compiled it right and the code is working.

In those case you need to use a small N value, like 0x40000000 (30 bits) or 0x1000000 (24 bits)



the default N value is 0x100000000000 enough to cover some 44 bits in  a single operation using only some 1 or 2 MB of RAM


So i dont see the necessity to specify a lower range, unless you are doing some test for your self.

While specifying bit rage with -b in bsgs when giving 30 bit range -b 30 its throwing error "range too small". Do i need to change anything in the code or just use -r instead.

Hi, that is not OK but i seen that you are using an old version, that problem is already solved in the newest version.


It can take from one day to one trillion trillion years or more.

Dear alberto,
how is this not ok? or is it ok?
how much time should this last processing take,
already a long few hrs. passed,. thanks
./keyhunt -m bsgs -f pubs.txt -b 120 -k 1024 -q -t 6
+] Version 0.1.20210412 secp256k1

• Setting mode BSGS
• Min range: 800000000000000000000000000000
• Max range: 1000000000000000000000000000000
• Setting k factor to 1024
• Set quiet thread output
• Setting 6 threads
• Opening file pubs0-65.txt
• Added 1129 points from file
• Bit Range 120
• Setting N up to 17592186044416.
• Init 1st bloom filter for 4294967296 elements : 14722.00 MB
• Init 2nd bloom filter for 214748365 elements : 736.13 MB
• Allocating 0.5 MB for 4096 aMP Points
• Precalculating 4096 aMP points
• Allocating 3276.80 MB for 214748365 bP Points
• processing 4294963200/4294967296 bP points : 99%