If so, When I make this change and try to open it again, I get this error. Can you please help me with this?  I think that it is pretty obvious no? the wallet in that path was created by another network no? You can test the next: - Move that wallet to a backup folder - Delete any wallet in that directory - Create a new wallet |
|
|
|
|
Thank you for report this I will check it ASAP
|
|
|
|
I always dreamed finding something unspent on those ID's (04-06-07).
I didn't know the existence of 06 and 07 public key prefix. I wonder where are those prefixes used? Is there some trick to compute the X value of P + G if you don't know P.y? I'm curious to know.
Q = P+G Well you need to know the value P.y in order to calcualte the next sequence of Q values but you you don't need to calculate the actual Q.y value, this sound a dubious but actuallly it works and faster than regular approach. This work better for some array of Q values, if the array is 512 or 1024 items long you can skip the calcualtions of 512 or 1024 Q.y values You only need to calculate one Q.y value for next group of items and repeat (This value need to be the center of the group becuse it use it use a property that P + i*G and P - i*G have the same deltax and same inverse value), this save alot of time. It not only works for Q = P+G but for any Q = P+ iG Its complex and painful but read the code but it worth the time to study and implement it, just to see how the speed increment, maybe i will publish an step by step explatnation for it, but if you want to take a look please check where i learned it: https://github.com/JeanLucPons/BSGS/blob/master/BSGS.cpp#L189That implementation alone multiply the previous speed x4 times. |
|
|
|
would you recommend any other? or any other PRO tips?
The function that you mention use the method know as Scalar Multiplication, this method is also know as "double and add" it use a cycle that per each bit in the key double the generation point G and only adds to the result those whom are bits 1. In the worst case it is near 256 cycle per key or if you have some precalculated data of those public keys divided in bytes instead bits you can reduce that cycle to 32 per key but that is still just a suggestion for that function. The best way to proceed with it this kind of programs is just calculate the first key and with that first key do Public key additions to reach the next key this process will speed you program around 30 times So instead of recalculate the public key each time with secp256k1_ec_pubkey_create result=secp256k1_ec_pubkey_create(ctx, &pubkey_from_secp256k1.p, privkey);
next_key =secp256k1_ec_pubkey_create(ctx, &pubkey_from_secp256k1.p, privkey +1);
next_key =secp256k1_ec_pubkey_create(ctx, &pubkey_from_secp256k1.p, privkey +2);
next_key =secp256k1_ec_pubkey_create(ctx, &pubkey_from_secp256k1.p, privkey+3);
is just an example to illustrate what i mean. the program will do something like: first_key=secp256k1_ec_pubkey_create(ctx, &pubkey_from_secp256k1.p, privkey);
next_key = some_publickey_addition(first_key,G);
next_key = some_publickey_addition(next_key ,G);
next_key = some_publickey_addition(next_key ,G);
...
next_key = some_publickey_addition(next_key ,G);
...
Only the first key is calculated in the old way and the subsequent keys are calculated in a faster way. Another short cut is you don't need to calculate the Y value of all the subsequent keys (unless you are scanning for uncompressed keys) this may double the speed of the calculations. Another short cut is endomorphism (This don't work on small puzzles) but it can multiply your speed up to 6 times for a general search. |
|
|
|
The search speed is between 15-25K keys/s per CPU thread, depending on the CPU clock.
For CPU that speed is slow, the minimum acceptable speed per thread is at least 1 Million keys. Even my Core i5 laptop can do some 15 millions keys per second using only 8 threads. There is a lot of shortcuts that can be made to reach those speeds. I am interested to know the nature of the bot wars.
How is it possible the war?
Are the Kangaroo and BSGS tools sending the private key findings to the developers?
No those tools are open source and you can read the code to see what network activities they do. The bot war may start as soon an output transaction come from those address a transaction contains the public key, with it Kangaroo or BSGS can solve the private key almost instantly and with it they may be now able to make a new transactions with a different destination address |
|
|
|
i assume any wallet program will just refuse to send a TX due to invalid signature.
Yes that is correct, even if you broadcast it manually the network nodes will not accept your transaction. |
|
|
|
● 12-char prefix
20d45a6a7625355df5e5fc41b358e6f8581991e2
13zb1hQbWVsc1111111111111111111111 => 20d45a6a76253570014f1a30288bd88dc3ff6ffb
13zb1hQbWVsczzzzzzzzzzzzzzzzzzzzzz => 20d45a6a76253571d7012502fabee39e6bbaf2b4
1d5b20ad2d2330b10a7bb82b9
FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF / 1D5B20AD2D2330B10A7BB82B9 = 0x8B8758F7C8AD0286
(every 0x8B8758F7C8AD0286 will find 1 address 12-char prefix)
Did you realize that 0x8B8758F7C8AD0286 is near 1/3 of the 66 bit space? >>> 2**65 // 0x8B8758F7C8AD0286
3
>>> 2**65 / 0x8B8758F7C8AD0286
3.6694959191703664
It just interesting |
|
|
|
How was the Funds from Puzzle 64 transferred. There mist been a tug of war between the bots fighting each other during that time also. So how was it managed? Does someone know the story of that time. Same must have been for the Forks coin transfer of that puzzle as well. Another Tx another bot war ?
Well that is a good question, but unless someone recorded the mempool TX related to that address at that time there is no way to know for sure because after some time all those TX that didn't win the "bid" fight are promptly discarded from most of the servers that show TX details online. One example of that is what i write in Is FullRBF allowing double spend? where i show some TX tha are related to one of my addresses and those TX no longer exists because they were FullRBF with new TX. |
|
|
|
Hi, Alberto. xpoint mode does not work at full possible speed, because FLAGSEARCH has default value of 2 (SEARCH_BOTH); then at thread_process you have following condition: calculate_y = FLAGSEARCH == SEARCH_UNCOMPRESS || FLAGSEARCH == SEARCH_BOTH || FLAGCRYPTO == CRYPTO_ETH; If you add an exception there for xpoint, unnecessary calculations of Y-coordinate will not occur and this will at least 1.5x speed in xpoint mode I think. Hi, thank you very much to point to this, yes you are right with this it is not working at full speed. A big facepalm for me. I will correct it ASAP and update the code. Maybe i should use separate functions for those modes to also avoid unnecesary switch-case opcions. Regards! |
|
|
|
Why not simply AES-256 encrypt the private key and be done with it in, like, 3 lines? No password hashing and so on. I solved puzzle #66 but I'm very afraid to sweep it. Since no one claimed it yet, they definitely belong to me, right? Here's my proof: the encrypted private key is: 0x4074a46512e55c9559cb8af86c983bc424d9f2d5fbb3c14b65b1045d21972d219b359a24806826a94c72e9a95ca00dab
First 16 bytes are the IV, then 32 bytes of private key. I removed the padding, since it's 16 bytes of 0x10 (e.g. no bytes in last block). Quoted to save this If anyone steals my prize I will divulge the decryption key.
But why? I mean what you want to achieve with this? |
|
|
|
how much is your speed with your pc Alberto?
My speed is no important, I get 1 Exakeys/s as far i can remember. |
|
|
|
is there any recommended command with this server for faster speed?
I have no idea, btw the speed is not good, to be honest with you not even some hundreds exakeys are enough for this. |
|
|
|
your address: 13zb1hQbWVuYdZoAkztVrNrm65aReL2pYD
Try to quote from the person who post it in first place. Good that you also found the key, but you spoil it. You just removed the fun for others. It would be better another signed message no? Quoting to the user who post it: Address = 13zb1hQbWVuYdZoAkztVrNrm65aReL2pYD
Message = I own this address
Signature = HxSDzJj3BhS8lh7qoU1L9zJsymorFkJv8/roi8o6+269PEDPr8psAE1QEOerWAWKv/ypXss7hhXEe0FutUR4b0s=
|
|
|
|
What if someone found the key and spent the btc to another wallet ( i know, pubkey...) but with a super high tx fee, like extremely high.
Which key? puzzle key? 66? If the 66 key is spent it may enter in some bot fight each one will increase the fees compared to other until there is nothing left to spent but the final result is unknown Not always the higher fee wins, chek my previous reply to this: Just to mention that when the nodes have many FullRBF transacions not always win that one with more fee, here some examples, Dot with Green margin was mined, some are Testnet and other are mainnet  Here was mined a TX with 1 sat/vB instead of a 37 sat/vB  Here was mined a TX with 22 sat/vB instead of a 44 sat/vB  Here was mined a TX with 106 sat/vB instead of a 1032 sat/vB All depens of what is the transaction that the miner selected to work with his hardware. I tried to import a private key into bitcoin core but i got this error :
Only legacy wallets are supported by this command (code -4)
what should i do now?
If you don't show what command do you used, then there is no way to know what is wrong. What kind of address are you trying to import? it looks like it is not a legacy one. |
|
|
|
May please explain alittle how random mode working? is it different every time we start random?
It is always random, check your self with the -M option |
|
|
|
Thank you Alberto, the problem fixed now.
now , random mode is more useful or sequential mode?
is it good that we start at beginning of range or start from 10% or more of range?
That depend of your target, for small ranges sequential is good, but for largest ranges random is the best choice. |
|
|
|
I tried to test my speed with puzzle 120 which you put on github for test and thats working.
But when i try to start scan puzzle 130 the processing stuck in 0%
I changed the -k from 256 to 128 now thats working...
in windows -k 256 worked
The issue may be some configuration of the WSL enviroment sometimes it is capped at a certain percentage of the Host RAM please check: https://www.aleksandrhovhannisyan.com/blog/limiting-memory-usage-in-wsl-2/ |
|
|
|
Im using this command :
.\keyhunt.exe -m bsgs -f keys.txt -b 130 -t 4 -s 10 -k 256 -S
should i change something or this is my power and i cant do anything more ?
Your problem is the .exe and windows stuff Don use it on windows, compile it your self in a WSL environment or native linux The lastest version is Version 0.2.230519 Satoshi Quest it provide an increment of speed X2 compared with previous version |
|
|
|
|
Show Posts
