Pages:
Author

Topic: Keyhunt - development requests - bug reports - page 4. (Read 11445 times)

newbie
Activity: 33
Merit: 0
Ok, I installed Keyhunt on Bodhi Linux 7.0 copied file 130.txt from folder test to folder keyhunt and executed ./keyhunt -m bsgs -f 130.txt -b 130 -R
 
When it finds the key, will it create a file with the found key in the keyhunt folder ? Like the file VANITYKEYFOUND.txt in the keyhunt folder ?

./keyhunt -m bsgs -f 130.txt -b 130 -R    You're going to need luck  Roll Eyes

The VANITYKEYFOUND.txt file is generated only when the hunter finds a key in vanity mode.
jr. member
Activity: 37
Merit: 1
Ok, I installed Keyhunt on Bodhi Linux 7.0 copied file 130.txt from folder test to folder keyhunt and executed ./keyhunt -m bsgs -f 130.txt -b 130 -R
 
When it finds the key, will it create a file with the found key in the keyhunt folder ? Like the file VANITYKEYFOUND.txt in the keyhunt folder ?
hero member
Activity: 828
Merit: 657
  • Added Vanity search : 13zb1hQ
    ...
    Vanity Private Key: fffffffffffffffffffffffffffffffebaaedce6af48a0380b2513a178946f75
    ...
First if you are going to use vanity use more than 15 characters not just 7 or  8.

Seconds yes that key is outside of the range because keythunt for address/rmd160/xpoint search on both sides of the curve it do this because if I only seach for one side of the curve the performance would be lesst than the half of it ( It will have less than the half of the current speed ).

It think on this like a feature not a bug... so please use more than 15 characers for your vanity search.
  • Added Vanity search : 13zb1hQ
    ...
    Vanity Private Key: fffffffffffffffffffffffffffffffebaaedce6af48a0380b2513a178946f75
    ...
First if you are going to use vanity use more than 15 characters not just 7 or  8.

Seconds yes that key is outside of the range because keythunt for address/rmd160/xpoint search on both sides of the curve it do this because if I only seach for one side of the curve the performance would be lesst than the half of it ( It will have less than the half of the current speed ).

It think on this like a feature not a bug... so please use more than 15 characers for your vanity search.

Alberto is a Legend would love to meet him one day  Smiley

Its not a big deal, I am just another random guy with regular life problems
jr. member
Activity: 47
Merit: 2
Code:
./keyhunt -m vanity -l compress -r 30000000000000000:3ffffffffffffffff -R -v 13zb1hQ -n 0x6000000 -q -s 10 -t4
[+] Mode vanity
[+] Search compress only
[+] Random mode
[+] Added Vanity search : 13zb1hQ
[+] Quiet thread output
[+] Stats output every 10 seconds
[+] Threads : 4
[+] N = 0x6000000
[+] Range
[+] -- from : 0x30000000000000000
[+] -- to   : 0x3ffffffffffffffff
[+] Bloom filter for 1 elements.
[+] Loading data to the bloomfilter total: 0.03 MB
[+] Total 5566996480 keys in 310 seconds: ~17 Mkeys/s (17958053 keys/s)
Vanity Private Key: fffffffffffffffffffffffffffffffebaaedce6af48a0380b2513a178946f75
pubkey: 03b32edf683e27c1c866c915f093c3e88d4dbedbb81cc48e5f7355dbfd731ab8ba
Address 13zb1hQVwAhBbaDUusG6ogrq3ZnN1WJy5w
rmd160 20d45a6a6f3f0f3f3fbf3d6d7ba46818b1dc1d5c


The first number in the range is greater than the second, it seems that this caused abnormal operation.
Strange  Huh
Your key is still in the given range if you subtract it from N, you will see this one
Code:
0x000000000000000000000000000000000000000000000003b4ad4aeb57a1d1cc
Public_key=
02b32edf683e27c1c866c915f093c3e88d4dbedbb81cc48e5f7355dbfd731ab8ba
Compressed_address=
1N2DPnTjPep2ZWr9JwCGFzAJF39xkspPMc
You should read the instructions about how to use -N value to avoid going out of range.
newbie
Activity: 2
Merit: 0
Alberto is a Legend would love to meet him one day  Smiley
newbie
Activity: 33
Merit: 0
Code:
./keyhunt -m vanity -l compress -r 30000000000000000:3ffffffffffffffff -R -v 13zb1hQ -n 0x6000000 -q -s 10 -t4
[+] Mode vanity
[+] Search compress only
[+] Random mode
[+] Added Vanity search : 13zb1hQ
[+] Quiet thread output
[+] Stats output every 10 seconds
[+] Threads : 4
[+] N = 0x6000000
[+] Range
[+] -- from : 0x30000000000000000
[+] -- to   : 0x3ffffffffffffffff
[+] Bloom filter for 1 elements.
[+] Loading data to the bloomfilter total: 0.03 MB
[+] Total 5566996480 keys in 310 seconds: ~17 Mkeys/s (17958053 keys/s)
Vanity Private Key: fffffffffffffffffffffffffffffffebaaedce6af48a0380b2513a178946f75
pubkey: 03b32edf683e27c1c866c915f093c3e88d4dbedbb81cc48e5f7355dbfd731ab8ba
Address 13zb1hQVwAhBbaDUusG6ogrq3ZnN1WJy5w
rmd160 20d45a6a6f3f0f3f3fbf3d6d7ba46818b1dc1d5c


The first number in the range is greater than the second, it seems that this caused abnormal operation.
Strange  Huh
hero member
Activity: 828
Merit: 657

In the post:
 Range
-- from : 0x1
-- to   : 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

And what you expected? found the key in seconds?

Genius...... That is the whole range if there is a program to found a key in seconds the bitcoin and all alt-coins will worth ZERO

Please don't ask stupid questions here
member
Activity: 113
Merit: 28
Bug?

Where in the command do you set the range?

 Roll Eyes Roll Eyes Roll Eyes Tongue

In the post:
 Range
-- from : 0x1
-- to   : 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

also I tried
./keyhunt -m xpoint -f testkey.txt  -r 1:100
  • Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
  • Mode xpoint
  • N = 0x100000000
  • Range
  • -- from : 0x1
  • -- to   : 0x100
  • Allocating memory for 1 elements: 0.00 MB
  • Bloom filter for 1 elements.
  • Loading data to the bloomfilter total: 0.03 MB
  • Sorting data ... done! 1 values were loaded and sorted
^C] Total 218610688 keys in 30 seconds: ~7 Mkeys/s (7287022 keys/s)

Thank you for your help
newbie
Activity: 5
Merit: 1
Code:
./keyhunt -m vanity -l compress -r 30000000000000000:3ffffffffffffffff -R -v 13zb1hQ -n 0x6000000 -q -s 10 -t4
[+] Mode vanity
[+] Search compress only
[+] Random mode
[+] Added Vanity search : 13zb1hQ
[+] Quiet thread output
[+] Stats output every 10 seconds
[+] Threads : 4
[+] N = 0x6000000
[+] Range
[+] -- from : 0x30000000000000000
[+] -- to   : 0x3ffffffffffffffff
[+] Bloom filter for 1 elements.
[+] Loading data to the bloomfilter total: 0.03 MB
[+] Total 5566996480 keys in 310 seconds: ~17 Mkeys/s (17958053 keys/s)
Vanity Private Key: fffffffffffffffffffffffffffffffebaaedce6af48a0380b2513a178946f75
pubkey: 03b32edf683e27c1c866c915f093c3e88d4dbedbb81cc48e5f7355dbfd731ab8ba
Address 13zb1hQVwAhBbaDUusG6ogrq3ZnN1WJy5w
rmd160 20d45a6a6f3f0f3f3fbf3d6d7ba46818b1dc1d5c
hero member
Activity: 828
Merit: 657
Bug?

Where in the command do you set the range?

 Roll Eyes Roll Eyes Roll Eyes Tongue
member
Activity: 113
Merit: 28
Bug?

Hi Alberto,

I am using Version 0.2.230519 on Ubuntu.

In xpoint mode, with an uncompressed public key, the program does not find the private key

the public key file is one long string, no breaks
04bdba1effbf6af786dca1da26cc2261021f95d56f245298c0b87a40e1fa9a0cbc05e798c4be089 a47da2ec0d2869c0e394ccf75eb4fcc01321e2f2a67a7cbbb7d (key10)

Result

./keyhunt -m xpoint -f testkey.txt -n 65536 -t 4
  • Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
  • Mode xpoint
  • Threads : 4
  • N = 0x10000
  • Range
  • -- from : 0x1
  • -- to   : 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141
  • Allocating memory for 1 elements: 0.00 MB
  • Bloom filter for 1 elements.
  • Loading data to the bloomfilter total: 0.03 MB
  • Sorting data ... done! 1 values were loaded and sorted
^Cse key: 50f0001   

What am I doing wrong?
Thank you


 

newbie
Activity: 6
Merit: 0
Thanks, regarding vanity, speed is slightly better for me than address mode.
hero member
Activity: 828
Merit: 657
I have tried Vanity search with range specified and it has found address that is out of range:

Code:
 ./keyhunt -m vanity -f tests/van.txt -l compress -R -b 66 -e -s 10 -q -t 32 -n 0x400000000000 


Remove -e, by the way don't use vanity for puzzle search
newbie
Activity: 6
Merit: 0
I have tried Vanity search with range specified and it has found address that is out of range:

Code:
 ./keyhunt -m vanity -f tests/van.txt -l compress -R -b 66 -e -s 10 -q -t 32 -n 0x400000000000 
[+] Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
[+] Mode vanity
[+] Search compress only
[+] Random mode
[+] Endomorphism enabled
[+] Stats output every 10 seconds
[+] Quiet thread output
[+] Threads : 32
[+] N = 0x400000000000
[+] Bit Range 66
[+] -- from : 0x20000000000000000
[+] -- to   : 0x40000000000000000
[+] Bloom filter for 1 elements.
[+] Loading data to the bloomfilter total: 0.03 MB
[+] Total 488007616512 keys in 3320 seconds: ~146 Mkeys/s (146990245 keys/s)
Vanity Private Key: 164ddd867ec35f2e98f582c4d0d737f56f10d6a3cd2be340adf436912436f49
pubkey: 03cb9c45ef630131d33cf1e0b062165cea96a2cc3daf89448063180f48ad11d7ce
Address 13zb1hQbAP3nYzCWptx59aR1qG7J4UCY6h
rmd160 20d45a6a75b7519bfed7f99e576f1acd0aad1428
[+] Total 896877281280 keys in 6110 seconds: ~146 Mkeys/s (146788425 keys/s)

hero member
Activity: 828
Merit: 657
Is it possible to adapt an ASIC miner to this program as a coprocessor because it has higher speed?

No, its no possible to use them.

Or perhaps use MicroRNG is a hardware (true) random number generator?

In linux it use urandom to get random numbers, i did some test before and the performance is almost the same, there is not much advantage to use the CPU RNG to do that, even the libssl RNG is faster than it.
If the OS have enough entropy even 256 bits of good entropy is enough to generate Random numbers for an eternity see : https://www.2uo.de/myths-about-urandom/
newbie
Activity: 7
Merit: 1
Is it possible to adapt an ASIC miner to this program as a coprocessor because it has higher speed?
Or perhaps use MicroRNG is a hardware (true) random number generator?
newbie
Activity: 14
Merit: 0
Bsgs is now holding 18 exa keys/s stable.

Running a program to searches 18 exa keys/s is impressive!

I have 16 GB and Core i7, and get only 70 Peta key/s  

18 ExKeys/s this is a drop in the ocean, the range is huge, brute force is currently not the best choice for solving the puzzle. Even if random is not a very good idea, you need to look for another approach

P.s.
https://i.ibb.co/pfR0VDp/2023-11-08-00-14-18.png

Please tell me what CPU you have?
full member
Activity: 1050
Merit: 219
Shooters Shoot...
hi i need a bit help if i run this


Code:
./keyhunt -m vanity -f tests/66.txt -r 34024a9fc3e150000:34024ce5d77df7fff -l compress -q -s 10 -v 13zb1hQbWVs -t 8 -n 0x400 -e

the program still search after 40 trillions,

if the range is smaller it stop when range ends

Code:
./keyhunt -m vanity -f tests/66.txt -r 34024a9fc3e150000:34024a9fc3e750000 -l compress -q -s 10 -v 13zb1hQbWVs -t 8 -n 0x400 -e

what i should do ? to modify the n ?

You should use VanitySearch to find it, however, finding matching 10 characters will take awhile. Especially if only using CPU.
Also, there is no guarantee that the prefix you are looking for is even in those ranges.
newbie
Activity: 74
Merit: 0
hi i need a bit help if i run this


Code:
./keyhunt -m vanity -f tests/66.txt -r 34024a9fc3e150000:34024ce5d77df7fff -l compress -q -s 10 -v 13zb1hQbWVs -t 8 -n 0x400 -e

the program still search after 40 trillions,

if the range is smaller it stop when range ends

Code:
./keyhunt -m vanity -f tests/66.txt -r 34024a9fc3e150000:34024a9fc3e750000 -l compress -q -s 10 -v 13zb1hQbWVs -t 8 -n 0x400 -e

what i should do ? to modify the n ?
newbie
Activity: 33
Merit: 0
Has anyone looked for a mathematical solution?
This seems to respond to a form of polynomial function of degree n, where n is the position of the term in the sequence, such that the same sequence of the addresses found is obtained:
1,3,7,8,15,31,4C,E0...
Pages:
Jump to: