Keyhunt - development requests - bug reports

[gsciservices]

I think you can try xor filter, it's more faster.
https://github.com/FastFilter/xor_singleheader

You are supposed to tag & challenges mores faster of tools :  https://github.com/FastFilter/xor_singleheader.git I just want ensure you to that it is cracking brute-forcing private key from public key or anything else..........

[1715350071]

1715350071

[1715350071]

1715350071

[1715350071]

1715350071

[1715350071]

1715350071

[batareyka]

Hello
I'm trying to run the program.
./keyhunt -m pub2rmd -f tests / puzzleswopublickey.txt -q -b 19


In the file puzzleswopublickey.txt I use only this key
ebfbe6819fcdebab061732ce91df7d586a037dee

And find the public key.
It takes a long time. Nothing found.
What could be the problem?

[albert0bsd]

I am confused if 120 address and public key are compressed why do you say we need to use "uncompress" for 120?

Sorry that was a mistake, the program accept now both compress or uncompress.

Would someone explain please, what's the point of generating the bPfile.bin file? I run tests with it and without, the speed performance seems to be about the same.
Thank you.

If you are goin to stop and restart the program to often is better to have the bPfile already precalculate to save some time between stop/restart the program.

I think you can try xor filter, it's more faster.
https://github.com/FastFilter/xor_singleheader

I need to make some test but Im pretty sure that the speed will be closer. BTW the bottleneck is the ECC Operations not the bloom filter

And find the public key.
It takes a long time. Nothing found.
What could be the problem?

You don't have idea of what are you doing right?
pub2rmd was a experiment it have the same difficulty of crack a 256 bit key.

regards!

[bigvito19]

I'm just now seeing this, is this worth trying to use?

[PrivatePerson]

1. I launched:

Code:

./bPfile 3355443200 bPfile.bin

The file is 90 GB and the process continues, how do I calculate the final file size and creation time?
___

2. A 100 GB file was created.

Code:

./keyhunt -m bsgs -f 50bit.txt -b 50 -R -k 800 -t 12

I don't notice any performance gain from bPfile.bin.
___

3. I run:

Code:

./keyhunt -m bsgs -f 1-63.txt -R -t 12 -r 0000000000000001:8000000000000000 -k 800

File 1-63 contains public keys 1 through 63 of the puzzle bits.
more than 1.5 hours passed, nothing went wrong, although if you make one public key of 63 bits, it finds it quickly.
upd. Understood, it was necessary to remove the -R parameter

It remains to understand whether the bPfile.bin file is necessary, since I did not notice any benefit from it, except for the 100GB of space on the ssd.

[Unnameduser77]

trying to build it on Win10 with Cygwin and getting following mistake:

Code:

$ make
gcc -O3 -c bloom/bloom.c -o bloom.o
g++ -O3 -c sha256/sha256.c -o sha256.o
gcc -O3 -c base58/base58.c -o base58.o
gcc -O3 -c rmd160/rmd160.c -o rmd160.o
gcc -O3 -c sha3/sha3.c -o sha3.o
gcc -O3 -c xxhash/xxhash.c -o xxhash.o
g++ -O3 -c util.c -o util.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/Int.cpp -o Int.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/Point.cpp -o Point.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/SECP256K1.cpp -o SECP256K1.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/IntMod.cpp -o IntMod.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/Random.cpp -o Random.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/IntGroup.cpp -o IntGroup.o
g++ -o keyhunt keyhunt.c base58.o rmd160.o sha256.o bloom.o xxhash.o util.o Int.o  Point.o SECP256K1.o  IntMod.o  Random.o IntGroup.o -lgmp -lm -lpthread
#gcc -O3 hexcharstoraw.c -o hexcharstoraw util.o -lm
g++ -o bPfile bPfile.c util.o -lgmp -lm

can anyone help me?

[PrivatePerson]

What am I doing wrong?

Code:

~/keyhunt$ ./keyhunt -m bsgs -f pubkeys.txt -r 1:fffffffffffff -t 12 -k 800
[+] Version 0.1.20210412 secp256k1
[+] Setting mode BSGS
[+] Setting 12 threads
[+] Setting k factor to 800
[+] Opening file pubkeys.txt
[+] Added 24190 points from file
[+] Setting N up to 17589233254400.
[+] Init 1st bloom filter for 3355443200 elements : 11502.00 MB
[+] Init 2nd bloom filter for 167772160 elements : 575.10 MB
[+] Allocating 0.6 MB for 5242 aMP Points
[+] Precalculating 5242 aMP points
[+] Allocating 2560.00 MB for 167772160 bP Points
[+] processing 3355443200/3355443200 bP points : 100%
[+] Sorting 167772160 elements... Done!
[+] Thread  aff870000001
Total 0 keys in 30 seconds: 0 keys/s
Total 0 keys in 180 seconds: 0 keys/s

How many lines can a file with public keys contain at most?

[PrivatePerson]

trying to build it on Win10 with Cygwin and getting following mistake:

can anyone help me?

I recommend putting WSL2 and not bothering, a very convenient thing.
https://docs.microsoft.com/en-us/windows/wsl/install-win10

[Unnameduser77]

trying to build it on Win10 with Cygwin and getting following mistake:

can anyone help me?

I recommend putting WSL2 and not bothering, a very convenient thing.
https://docs.microsoft.com/en-us/windows/wsl/install-win10

Thanks a lot!

[johhny.shark]

anyone wondering if this is legal, or nah... ?

[PrivatePerson]

Legal.
Cryptocurrency rule: Whoever has the private key is the owner.

[johhny.shark]

Well, in this case, is 100% legal! 

[bigvito19]

He who owns the private key, owns the cryptocurrency and that's a fact.

[johhny.shark]

Ok, I hope you get lucky and get the keys for some nice wallets, like microstrategy's or tesla's, and then I wish you luck in the court 

[PrivatePerson]

Is it possible with the help of a key hunt to make base58 > hash160?
All functionality is available, someone even created it for windows.
https://github.com/kanhavishva/b58dec
This can be useful for preparing a bloom filter for Brainflayer.

[WanderingPhilospher]

Is it possible with the help of a key hunt to make base58 > hash160?
All functionality is available, someone even created it for windows.
https://github.com/kanhavishva/b58dec
This can be useful for preparing a bloom filter for Brainflayer.

Are you wanting to know if the program keyhunt, can add this capability?

[Alpaste]

Hello guys, please help
I'm having compile errors and bugs using linux.....
Please help me someone post me a link to download keyhunt.exe file i would really be thankful!
Thank you guys!

[stilichovandal]

Trying to make on Ubuntu(WSL)

can anyone help with the below error?

gcc -O3 -c bloom/bloom.c -o bloom.o
g++ -O3 -c sha256/sha256.c -o sha256.o
gcc -O3 -c base58/base58.c -o base58.o
gcc -O3 -c rmd160/rmd160.c -o rmd160.o
gcc -O3 -c sha3/sha3.c -o sha3.o
gcc -O3 -c xxhash/xxhash.c -o xxhash.o
g++ -O3 -c util.c -o util.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/Int.cpp -o Int.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/Point.cpp -o Point.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/SECP256K1.cpp -o SECP256K1.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/IntMod.cpp -o IntMod.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/Random.cpp -o Random.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/IntGroup.cpp -o IntGroup.o
g++ -o keyhunt keyhunt.c base58.o rmd160.o sha256.o bloom.o xxhash.o util.o Int.o  Point.o SECP256K1.o  IntMod.o  Random.o IntGroup.o -lgmp -lm -lpthread
/usr/bin/ld: cannot find -lgmp
collect2: error: ld returned 1 exit status
make: *** [Makefile:15: default] Error 1

[albert0bsd]

I'm just now seeing this, is this worth trying to use?

No it not worth the time or effort

Code:

./bPfile 3355443200 bPfile.bin

The file is 90 GB and the process continues, how do I calculate the final file size and creation time?

each bP item is 32 bytes in disk.

In RAM is about ~24 Bytes

2. A 100 GB file was created.

Code:

./keyhunt -m bsgs -f 50bit.txt -b 50 -R -k 800 -t 12

I don't notice any performance gain from bPfile.bin.

The only performance is the time to generate the bPitems in runtime or read those from disk, anything else (Final speeed) is going to be the same

Code:

./keyhunt -m bsgs -f 1-63.txt -R -t 12 -r 0000000000000001:8000000000000000 -k 800

File 1-63 contains public keys 1 through 63 of the puzzle bits.
more than 1.5 hours passed, nothing went wrong, although if you make one public key of 63 bits, it finds it quickly.
upd. Understood, it was necessary to remove the -R parameter

The  mode bsgs works with each publickey individualy, this mean that 1 publickey give you some speed but 2 publickeys give you the half of that speed and so on...

It remains to understand whether the bPfile.bin file is necessary, since I did not notice any benefit from it, except for the 100GB of space on the ssd.

When people stop and rerun the program so many times the bP file is good but is you are going to let it run  for months then  the file is useless.

anyone wondering if this is legal, or nah... ?

I made this program for the puzzles.

Is it possible with the help of a key hunt to make base58 > hash160?
All functionality is available, someone even created it for windows.
https://github.com/kanhavishva/b58dec
This can be useful for preparing a bloom filter for Brainflayer.

there are some tools that can do that.

Trying to make on Ubuntu(WSL)

can anyone help with the below error?

/usr/bin/ld: cannot find -lgmp
collect2: error: ld returned 1 exit status

Install libgmp

[hskun]

Hi WanderingPhilospher, thanks for test the program.

I can get 1 MKey/s with a list of 15 million addresses (i5-4690 running 4 threads).  I am curious, does/will your Keyhunt program handle that many addresses and if so, does the Key/s drop?

Keyhunt use a Bloom filter to check if the generated address or hash is on the list, this will lead in some false positive collision (Error rate is one in a million or something like that), so if the the bloom filter return a positive result, it use a second check, this is a binary search over all the address or items in the list, it can dertermine if one item is on the list perfoming only log(N)/log(2) operation, for 15 Milllions of addres this process only take 24 comparations.

This is like the hash table but i prefer keep those separated becuase there are some trick with the bloom filter that allow you use a little less ram in the case of the BSGS mode.

And no, in keyhunt there are no key drop or anything like that.

why not read the input file of full addresses, convert them to RIPE, and then do the search on RIPE?

Yes you are totally right this will be changed soon.

Im working in some migration from libgmp to the secp256k1 library used in  the JLP  BSGS Code, i already check that librery and with some hardware and code tricks it can be 4 or 5 times more faster for publickey generations, this will boost all the modes speeds, address, rmd160, xpoint and bsgs mode in the  code.

Best regards!

Hi albert0bsd,
have any progress about the program?