the owner of that wallet was afraid of our topic, today he transferred everything to another address from which the public key is unknown 
which one address ?
Topic: VanitySearch (Yet another address prefix finder) - page 21. (Read 32072 times)
which one address ?
the owner of that wallet was afraid of our topic, today he transferred everything to another address from which the public key is unknown
the error appears only if you specify more than 316 bits
Jean_Luc, from your github readme:
A Pollard's kangaroo interval ECDLP solver for SECP256K1 (based on VanitySearch engine).
This program is limited to a 125bit interval search.
Did you make a program limit up to 125bit search space or mentioned this just for practical reasons?
A Pollard's kangaroo interval ECDLP solver for SECP256K1 (based on VanitySearch engine).
This program is limited to a 125bit interval search.
Did you make a program limit up to 125bit search space or mentioned this just for practical reasons?
this is for the GPU, but there is no limit for the CPU
Where did you see that?
Jean_Luc, from your github readme:
A Pollard's kangaroo interval ECDLP solver for SECP256K1 (based on VanitySearch engine).
This program is limited to a 125bit interval search.
Did you make a program limit up to 125bit search space or mentioned this just for practical reasons?
A Pollard's kangaroo interval ECDLP solver for SECP256K1 (based on VanitySearch engine).
This program is limited to a 125bit interval search.
Did you make a program limit up to 125bit search space or mentioned this just for practical reasons?
this is for the GPU, but there is no limit for the CPU
Specify the range of keys to search. For example, if you want to search in a specific range of private keys you can specify it in hex or decimal in the format START:END with a specified stride/increment size.
+1 need this function too , with keyspace start: end , with a specified stride/increment size.
like stride 10000:10000, with user define in stride and checkkeys
example user define
check keys 10000
stride keys 10000
this func make Vanitysearch more attractive and chances of probability build up
+1 need this function too , with keyspace start: end , with a specified stride/increment size.
like stride 10000:10000, with user define in stride and checkkeys
example user define
check keys 10000
stride keys 10000
this func make Vanitysearch more attractive and chances of probability build up
Can you give an example of the cmd line
example
./VanitySearch -t 0 -gpu -i input.txt -o result.txt --keyspace 1:FFFFFFFFFFFFFFFF --stride 500:10000
./VanitySearch -t 0 -gpu 1LqJ9cHPKxPXDRia4tteTJdLXnisnfHsof -o result.txt --keyspace 1:FFFFFFFFFFFFFFFF --stride 500:10000
check keys 500
bypass/stride 10000
./VanitySearch -t 0 -gpu -i input.txt -o result.txt --keyspace 1:FFFFFFFFFFFFFFFF --stride 10000 --check 500
./VanitySearch -t 0 -gpu 1LqJ9cHPKxPXDRia4tteTJdLXnisnfHsof -o result.txt --keyspace 1:FFFFFFFFFFFFFFFF --stride 10000 --check 500
Specify the range of keys to search. For example, if you want to search in a specific range of private keys you can specify it in hex or decimal in the format START:END with a specified stride/increment size.
+1 need this function too , with keyspace start: end , with a specified stride/increment size.
like stride 10000:10000, with user define in stride and checkkeys
example user define
check keys 10000
stride keys 10000
this func make Vanitysearch more attractive and chances of probability build up
+1 need this function too , with keyspace start: end , with a specified stride/increment size.
like stride 10000:10000, with user define in stride and checkkeys
example user define
check keys 10000
stride keys 10000
this func make Vanitysearch more attractive and chances of probability build up
Can you give an example of the cmd line
Specify the range of keys to search. For example, if you want to search in a specific range of private keys you can specify it in hex or decimal in the format START:END with a specified stride/increment size.
+1 need this function too , with keyspace start: end , with a specified stride/increment size.
like stride 10000:10000, with user define in stride and checkkeys
example user define
check keys 10000
stride keys 10000
this func make Vanitysearch more attractive and chances of probability build up
+1 need this function too , with keyspace start: end , with a specified stride/increment size.
like stride 10000:10000, with user define in stride and checkkeys
example user define
check keys 10000
stride keys 10000
this func make Vanitysearch more attractive and chances of probability build up
Jean_Luc, from your github readme:
A Pollard's kangaroo interval ECDLP solver for SECP256K1 (based on VanitySearch engine).
This program is limited to a 125bit interval search.
Did you make a program limit up to 125bit search space or mentioned this just for practical reasons?
A Pollard's kangaroo interval ECDLP solver for SECP256K1 (based on VanitySearch engine).
This program is limited to a 125bit interval search.
Did you make a program limit up to 125bit search space or mentioned this just for practical reasons?
Searching on range larger than 126 bits will decrease performance a lot.
If you want to modify the code, the modification are not very difficult.
You have to change the structure and the interface in the HashTable to accept larger distance and restore 256 bit distance in the GPU code.
There you have it...the man, the myth, the coding legend has spoken.If you want to modify the code, the modification are not very difficult.
You have to change the structure and the interface in the HashTable to accept larger distance and restore 256 bit distance in the GPU code.
If it takes 256 V100 Teslas roughly 45-60 days for 120 bit range search, I can't imagine how long it would take to search a 256 bit range.
I would recommend adjusting ranges or search the bottom 124 bit range of larger range. But that's just me.
If Jean Luc tells me what to adjust in the code, I will make the changes and post a 256 bit range Kangaroo program...for those who wish to have it.
Jean_Luc, from your github readme:
A Pollard's kangaroo interval ECDLP solver for SECP256K1 (based on VanitySearch engine).
This program is limited to a 125bit interval search.
Did you make a program limit up to 125bit search space or mentioned this just for practical reasons?
A Pollard's kangaroo interval ECDLP solver for SECP256K1 (based on VanitySearch engine).
This program is limited to a 125bit interval search.
Did you make a program limit up to 125bit search space or mentioned this just for practical reasons?
this is a different address
your screenshot shows the infamous 1Feex with 79,000 bitcoins
this is a different address
You correctly understood the question, the probability for 1 day is very small
however, if the public key is known, the probability is 10 orders of magnitude higher
however, if the public key is known, the probability is 10 orders of magnitude higher
but no one knows the public key to that particular address, so we can only dream about cracking it
You correctly understood the question, the probability for 1 day is very small
however, if the public key is known, the probability is 10 orders of magnitude higher
however, if the public key is known, the probability is 10 orders of magnitude higher
is there a 1-day probability of CPU detecting a private key for the full address, or is it zero?
this address was used by scammers to steal bitcoins from the exchange
this address was used by scammers to steal bitcoins from the exchange
I'm not sure I understood your question (you can ask me in Russian by messaging me privately so it is not lost in translation),
but if you ask if it were possible to generate the address in one day, then most probably no.
And the infamous address you've mentioned, after what I've read, I made my own conclusion, it were not hackers, it was someone
related to mt.gox who stole it and now he's just holding 'cause what else he can do with it
So its kind of pointless to try to find a address with this if you don't know seed. What exactly is the search space when searching with vanitysearch is it 2^160 or 2^96?
The search space is 2^256, though some keys map to the same addresses. The non-uniformity means that some keys are more likely than others in your search, but all are still possible..If you were searching for keys beginning with B and the first letter of the set of keys matched in this pattern [..B...B..............B....B.............B....BB.B..BBB] the probability of selecting that last B would be 1 in 54 (because only 1 in 54 starting positions will select it) while it would be 14 out of 54 for the 5th one (because 14 different starting positions will end up there).
But on the real (enormous) range this doesn't really matter... it's just a pedantic detail.
Vanitysearch starts with a seed which, if not specified by the user, is generated randomly. It proceeds from there searching sequentially. If you use the same seed, you will get the same results.
It's perfectly secure to do this. Searching this way creates an infinitesimal bias in the keys that are selected (the selected key is more likely to be found after a long run of non-matches than after an immediately prior match) but even where an attacker knows the exact prefix searched for the bias is extremely tiny-- because nearly spaced solutions are extremely unlikely to begin with-- and not exploitable (because you can't search only keys that meet that criteria... since the criteria itself requires generating the pubkeys to check).So its kind of pointless to try to find a address with this if you don't know seed. What exactly is the search space when searching with vanitysearch is it 2^160 or 2^96?
Vanitysearch starts from the start key(generated based on seed or selected randomly) and then increment it by 1. So, technically there is no limit of the range 2^160 or 2^96, the tool will work till you not stop it.
Imagine the whole private key range from 0 to order (close to 2^256) and the start key marked as s somewhere between 0 and order.
Code:
[0] ......................... s ........................................................ [order]
Even s is very close to the order, it will continue work since the beginning, cause all the private keys are considered by modulo. It is like the infinite loop - while reach the order, start from the beginning.
So, my understanding is that search space is not limited in vanitysearch. It just increments the private key to check by 1 and stop when you stop it (or find the desired address if you select that option)
Vanitysearch starts with a seed which, if not specified by the user, is generated randomly. It proceeds from there searching sequentially. If you use the same seed, you will get the same results.
It's perfectly secure to do this. Searching this way creates an infinitesimal bias in the keys that are selected (the selected key is more likely to be found after a long run of non-matches than after an immediately prior match) but even where an attacker knows the exact prefix searched for the bias is extremely tiny-- because nearly spaced solutions are extremely unlikely to begin with-- and not exploitable (because you can't search only keys that meet that criteria... since the criteria itself requires generating the pubkeys to check).So its kind of pointless to try to find a address with this if you don't know seed. What exactly is the search space when searching with vanitysearch is it 2^160 or 2^96?
Vanitysearch starts with a seed which, if not specified by the user, is generated randomly. It proceeds from there searching sequentially. If you use the same seed, you will get the same results.
It's perfectly secure to do this. Searching this way creates an infinitesimal bias in the keys that are selected (the selected key is more likely to be found after a long run of non-matches than after an immediately prior match) but even where an attacker knows the exact prefix searched for the bias is extremely tiny-- because nearly spaced solutions are extremely unlikely to begin with-- and not exploitable (because you can't search only keys that meet that criteria... since the criteria itself requires generating the pubkeys to check).
Does the video card also give random keys or sequential ones?
the point is not in the similarity of addresses, but in the nature of their generation. Vanity generates randomly, so it is safe, and Bitcrack generates sequentially, so it is very easy to repeat the generation of the same address any number of times
and in the opposite direction, on the contrary, it is easier to get accidentally into the key because sequentially it is unrealistic, the universe is too big https://bitcointalksearch.org/topic/m.55448862
the point is not in the similarity of addresses, but in the nature of their generation. Vanity generates randomly, so it is safe, and Bitcrack generates sequentially, so it is very easy to repeat the generation of the same address any number of times
and in the opposite direction, on the contrary, it is easier to get accidentally into the key because sequentially it is unrealistic, the universe is too big https://bitcointalksearch.org/topic/m.55448862
Vanitysearch starts with a seed which, if not specified by the user, is generated randomly. It proceeds from there searching sequentially. If you use the same seed, you will get the same results.
Jump to: