Pages:
Author

Topic: Pollard's kangaroo ECDLP solver - page 75. (Read 58537 times)

full member
Activity: 1162
Merit: 237
Shooters Shoot...
January 28, 2021, 07:05:33 PM
Question to the smart people:

If one is using the kangaroo method, searching for 32 bit distinguished points, and searching in the 120 bit range, how many x coordinates (x coordinate is what the program finds of a given public key, which in kangaroo terminology means "distance traveled") would have a 32 bit distinguished point?

There are 2^120 possibilities, but we know not every private key in the 120 bit range has a public key x coordinate that has a DP of 32. Is there a good guesstimate or is it just anyone's guess?

I should clarify, how many tame points in a 120 bit range would/could have distinguished points of 32 bits?

If you're in the 120 bit range it should be 120/2 = 60 - 32 = 28. Finally answer is 2^28 = 268,435,456 tame distinguished points of 32 bits, that's my guess.
Probably a good as a guess as any. One also has to remember there are leading DPs example: 00001234 and trailing DPs, example: 12340000. There are also in between DPs, example: 12000034. I've seen all three used in different Kangaroo programs. Not sure which is best/faster to search for. If they are of the in between type, they have to line up. Example, 12000034 won't work with 10000234. All interesting.
I went through a small range 1-300FFF and didn't find any 32 DPs. I was closely looking at trailing, but I don't think there were any leading or in between either.

Anywho, if we use your 2^28, that would mean 2^28 for each type of DP, leading, trailing, and in between. So that would mean 2^29.5 (minimum, because the in between ones can be in between anywhere.)

You said you went through a small range 1-300FFF, that's 2^24 range with distinguished points of 32 bits. 32 bits is to big for that small space. That space 2^24 would require distinguished points of 6 bits.
No, that is not accurate. A distinguished point could be anywhere. It's merely how many "zeros" are in a row (consecutive) in a given public key x coord.  It shouldn't matter how large the range or private key is. It will just take a lot longer to find a 32 bit DP, in any range. I found several 24 bit DP in that 2^24 range, just no 32 bit DPs.  I'm not looking at this to find a key, I am just curious how many trailing or leading 32 bit DPs could be in a range, in particular, the 2^120 range. I thought there might have been a good calculator for it but maybe it is all just mathematical luck, where DPs fall.
full member
Activity: 706
Merit: 111
January 28, 2021, 06:50:18 PM
Question to the smart people:

If one is using the kangaroo method, searching for 32 bit distinguished points, and searching in the 120 bit range, how many x coordinates (x coordinate is what the program finds of a given public key, which in kangaroo terminology means "distance traveled") would have a 32 bit distinguished point?

There are 2^120 possibilities, but we know not every private key in the 120 bit range has a public key x coordinate that has a DP of 32. Is there a good guesstimate or is it just anyone's guess?

I should clarify, how many tame points in a 120 bit range would/could have distinguished points of 32 bits?

If you're in the 120 bit range it should be 120/2 = 60 - 32 = 28. Finally answer is 2^28 = 268,435,456 tame distinguished points of 32 bits, that's my guess.
Probably a good as a guess as any. One also has to remember there are leading DPs example: 00001234 and trailing DPs, example: 12340000. There are also in between DPs, example: 12000034. I've seen all three used in different Kangaroo programs. Not sure which is best/faster to search for. If they are of the in between type, they have to line up. Example, 12000034 won't work with 10000234. All interesting.
I went through a small range 1-300FFF and didn't find any 32 DPs. I was closely looking at trailing, but I don't think there were any leading or in between either.

Anywho, if we use your 2^28, that would mean 2^28 for each type of DP, leading, trailing, and in between. So that would mean 2^29.5 (minimum, because the in between ones can be in between anywhere.)

You said you went through a small range 1-300FFF, that's 2^24 range with distinguished points of 32 bits. 32 bits is to big for that small space. That space 2^24 would require distinguished points of 6 bits.
full member
Activity: 1162
Merit: 237
Shooters Shoot...
January 28, 2021, 04:07:20 PM
Question to the smart people:

If one is using the kangaroo method, searching for 32 bit distinguished points, and searching in the 120 bit range, how many x coordinates (x coordinate is what the program finds of a given public key, which in kangaroo terminology means "distance traveled") would have a 32 bit distinguished point?

There are 2^120 possibilities, but we know not every private key in the 120 bit range has a public key x coordinate that has a DP of 32. Is there a good guesstimate or is it just anyone's guess?

I should clarify, how many tame points in a 120 bit range would/could have distinguished points of 32 bits?

If you're in the 120 bit range it should be 120/2 = 60 - 32 = 28. Finally answer is 2^28 = 268,435,456 tame distinguished points of 32 bits, that's my guess.
Probably a good as a guess as any. One also has to remember there are leading DPs example: 00001234 and trailing DPs, example: 12340000. There are also in between DPs, example: 12000034. I've seen all three used in different Kangaroo programs. Not sure which is best/faster to search for. If they are of the in between type, they have to line up. Example, 12000034 won't work with 10000234. All interesting.
I went through a small range 1-300FFF and didn't find any 32 DPs. I was closely looking at trailing, but I don't think there were any leading or in between either.

Anywho, if we use your 2^28, that would mean 2^28 for each type of DP, leading, trailing, and in between. So that would mean 2^29.5 (minimum, because the in between ones can be in between anywhere.)
full member
Activity: 706
Merit: 111
January 28, 2021, 05:50:47 AM
Question to the smart people:

If one is using the kangaroo method, searching for 32 bit distinguished points, and searching in the 120 bit range, how many x coordinates (x coordinate is what the program finds of a given public key, which in kangaroo terminology means "distance traveled") would have a 32 bit distinguished point?

There are 2^120 possibilities, but we know not every private key in the 120 bit range has a public key x coordinate that has a DP of 32. Is there a good guesstimate or is it just anyone's guess?

I should clarify, how many tame points in a 120 bit range would/could have distinguished points of 32 bits?

If you're in the 120 bit range it should be 120/2 = 60 - 32 = 28. Finally answer is 2^28 = 268,435,456 tame distinguished points of 32 bits, that's my guess.
full member
Activity: 1162
Merit: 237
Shooters Shoot...
January 28, 2021, 12:51:53 AM
Question to the smart people:

If one is using the kangaroo method, searching for 32 bit distinguished points, and searching in the 120 bit range, how many x coordinates (x coordinate is what the program finds of a given public key, which in kangaroo terminology means "distance traveled") would have a 32 bit distinguished point?

There are 2^120 possibilities, but we know not every private key in the 120 bit range has a public key x coordinate that has a DP of 32. Is there a good guesstimate or is it just anyone's guess?

I should clarify, how many tame points in a 120 bit range would/could have distinguished points of 32 bits?
legendary
Activity: 952
Merit: 1385
January 24, 2021, 01:44:42 PM
Is it possible to add the "--stride" parameter to the program like in bitcrack?
This is needed to calculate the private key if public key and part of the private key is known, for example:  5JgvpXDfzXbqqtFmLJy?HuhHuhHuh??7aR9n6WoTWvPSb1oUEm4
When can we calculate the start point, end point and step.


I worked on that.
https://github.com/PawelGorny/Kangaroo
The solution is not perfect, but for me it was enough.
As a entry parameters it expects to have:
- the real beginning of the range
- the fake end of the range. If you know the real end and stride, divide the difference by stride and result add to the real beginning.
- the real public key

and then launching program use parameter -stride to specify the stride.
In the sources there is an example with the configuration file test_240921C8BE82FD68A2A77FBA0089F71029354609C9.txt
Code:
ef235aacf9050dd4d345af03378ba06d2108b927f084b2ab133c9b7d1187e6be
ef235aacf9050dd4d345af03378ba06d2108b927f084b2ab133d050abbcaa8a6
02b4632d08485ff1df2db55b9dafd23347d1c47a457072a1e87be26896549a8737

If you launch program using:
Code:
./kangaroo -stride 240921C8BE82FD68A2A77FBA0089F71029354609C9 test_240921C8BE82FD68A2A77FBA0089F71029354609C9.txt
you will receive result:
Code:
Key# 0 [2N]Pub:  0x02B4632D08485FF1DF2DB55B9DAFD23347D1C47A457072A1E87BE26896549A8737
       Priv: 0xEF235AACF9050DD4D345AF03378BA06D2108B927F084B2AB133CD85B91858012
   RealPriv: 0xEF235AACF90D9F4AADD8C92E4B2562E1D9EB97F0DF9BA3B508258739CB013DB2

Where Priv is a fake priv from the fake range, and EF235AACF90D9F4AADD8C92E4B2562E1D9EB97F0DF9BA3B508258739CB013DB2 is the real result.

I used that modified version of Kangaroo as a one more implementation of the method I described here: https://bitcointalksearch.org/topic/solving-wif-in-a-hybrid-mode-5265788
newbie
Activity: 4
Merit: 0
January 24, 2021, 10:09:37 AM
Is it possible to add the "--stride" parameter to the program like in bitcrack?
This is needed to calculate the private key if public key and part of the private key is known, for example:  5JgvpXDfzXbqqtFmLJy?HuhHuhHuh??7aR9n6WoTWvPSb1oUEm4
When can we calculate the start point, end point and step.
newbie
Activity: 23
Merit: 0
January 09, 2021, 11:35:45 AM
Anyone have luck installing Kangaroo on vast.ai platform? The Linux CUDA installation seems somewhat complex is there a streamlined process of exactly what to install?

I have installed Bitcrack for someone on Vast.ai so that's close enough.

Use the default image that Vast gives you for CUDA. They bundle CUDA Toolkit 10.0 but without nvcc. You need to install cuda-nvcc-10-0 and cuda-cudart-dev-10-0 and build-essential. Don't try to install another toolkit version because the installer doesn't play well with Vast servers and you'll have to destroy and create another server again.

Don't lease any RTX 30 series cards because those need CUDA toolkit 11.0 and as I already mentioned it's a PITA to install. RTX 20 series is OK.

Thanks a ton!! Working great now.
full member
Activity: 1162
Merit: 237
Shooters Shoot...
January 09, 2021, 11:14:42 AM
Today I tested Kangaroo 2.2 on the Ubuntu. Everything works great! Thanks a lot Jean_Luc!
Most of the participants in this discussion are programmers, and I have a question for you. How do you loop the MultiPubKey?
I would really like to search the list using different public keys in one specific range.

you can use the:

-m maxStep: number of operations before give up the search (maxStep*expected operation)

and the program will move to next pubkey if not found within -m operations

@WanderingPhilospher thanks for the advice. I am using the command:
Code:
./kangaroo -ws -w save.work -wi 30 -o result.txt in.txt
How to correctly write in (-m maxStep) so that every 15 minutes there is a transition to the next new public key?
the max step is based off of group operations so you'd have to watch when your program normally gets to where you want to end (watching the time) and then enter it, if you want it to end after a length of time. But let's say the estimated operations is 2^30, you would use the max step to end the program's search after 2^30.5, or 2^31, or 2^100, or whatever you want.

Is it possible to automate this in UBUNTU so as not to manually enter the add-on in the terminal? 15 minutes is enough for me to search in each public key in the list.
If you use the save feature, I'm not sure you can run another pubkey; I think it will throw an erro "Multiple pubkeys not supported..."
I am not an UBUNTU expert, I mainly use Windows. For what you are wanting to do, in Windows, I would create a batch file that would timeout after 15 minutes for each pubkey and set the save file to a different name for each pubkey, then no issues with multiple pubkey error.

@WanderingPhilospher I am using one file: "save.work" to search for privkeys for different public keys in one specific range.
Does this decrease the speed with one file: "save.work"? Or do me need to change the file: "save.work" that is, register a separate file for each public key?

Ok, I ran a quick test to make sure. If you search for multiple pubkeys listed in a input file, once the kangaroo finds or starts searching for the next pubkey, it overwrites the save.work file.

The speed is not effected, it will just overwrite previous data each time it searches for new/next pubkey. Search for pubkeys in a small range and you can see what I mean.
legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
January 09, 2021, 07:33:46 AM
Anyone have luck installing Kangaroo on vast.ai platform? The Linux CUDA installation seems somewhat complex is there a streamlined process of exactly what to install?

I have installed Bitcrack for someone on Vast.ai so that's close enough.

Use the default image that Vast gives you for CUDA. They bundle CUDA Toolkit 10.0 but without nvcc. You need to install cuda-nvcc-10-0 and cuda-cudart-dev-10-0 and build-essential. Don't try to install another toolkit version because the installer doesn't play well with Vast servers and you'll have to destroy and create another server again.

Don't lease any RTX 30 series cards because those need CUDA toolkit 11.0 and as I already mentioned it's a PITA to install. RTX 20 series is OK.

@WanderingPhilospher I am using one file: "save.work" to search for privkeys for different public keys in one specific range.
Does this decrease the speed with one file: "save.work"? Or do me need to change the file: "save.work" that is, register a separate file for each public key?

My gut feeling says that with the amount of disk I/O involved in writing files, it's faster to use one work file for saving. This only makes a difference if Kangaroo happens to write so many work files at once though, I believe it only writes one so it doesn't make a difference whether you use the same name or a different name.
newbie
Activity: 30
Merit: 0
January 09, 2021, 06:25:07 AM
Today I tested Kangaroo 2.2 on the Ubuntu. Everything works great! Thanks a lot Jean_Luc!
Most of the participants in this discussion are programmers, and I have a question for you. How do you loop the MultiPubKey?
I would really like to search the list using different public keys in one specific range.

you can use the:

-m maxStep: number of operations before give up the search (maxStep*expected operation)

and the program will move to next pubkey if not found within -m operations

@WanderingPhilospher thanks for the advice. I am using the command:
Code:
./kangaroo -ws -w save.work -wi 30 -o result.txt in.txt
How to correctly write in (-m maxStep) so that every 15 minutes there is a transition to the next new public key?
the max step is based off of group operations so you'd have to watch when your program normally gets to where you want to end (watching the time) and then enter it, if you want it to end after a length of time. But let's say the estimated operations is 2^30, you would use the max step to end the program's search after 2^30.5, or 2^31, or 2^100, or whatever you want.

Is it possible to automate this in UBUNTU so as not to manually enter the add-on in the terminal? 15 minutes is enough for me to search in each public key in the list.
If you use the save feature, I'm not sure you can run another pubkey; I think it will throw an erro "Multiple pubkeys not supported..."
I am not an UBUNTU expert, I mainly use Windows. For what you are wanting to do, in Windows, I would create a batch file that would timeout after 15 minutes for each pubkey and set the save file to a different name for each pubkey, then no issues with multiple pubkey error.

@WanderingPhilospher I am using one file: "save.work" to search for privkeys for different public keys in one specific range.
Does this decrease the speed with one file: "save.work"? Or do me need to change the file: "save.work" that is, register a separate file for each public key?
full member
Activity: 1162
Merit: 237
Shooters Shoot...
January 08, 2021, 11:39:03 PM
Today I tested Kangaroo 2.2 on the Ubuntu. Everything works great! Thanks a lot Jean_Luc!
Most of the participants in this discussion are programmers, and I have a question for you. How do you loop the MultiPubKey?
I would really like to search the list using different public keys in one specific range.

you can use the:

-m maxStep: number of operations before give up the search (maxStep*expected operation)

and the program will move to next pubkey if not found within -m operations

@WanderingPhilospher thanks for the advice. I am using the command:
Code:
./kangaroo -ws -w save.work -wi 30 -o result.txt in.txt
How to correctly write in (-m maxStep) so that every 15 minutes there is a transition to the next new public key?
the max step is based off of group operations so you'd have to watch when your program normally gets to where you want to end (watching the time) and then enter it, if you want it to end after a length of time. But let's say the estimated operations is 2^30, you would use the max step to end the program's search after 2^30.5, or 2^31, or 2^100, or whatever you want.

Is it possible to automate this in UBUNTU so as not to manually enter the add-on in the terminal? 15 minutes is enough for me to search in each public key in the list.
If you use the save feature, I'm not sure you can run another pubkey; I think it will throw an erro "Multiple pubkeys not supported..."
I am not an UBUNTU expert, I mainly use Windows. For what you are wanting to do, in Windows, I would create a batch file that would timeout after 15 minutes for each pubkey and set the save file to a different name for each pubkey, then no issues with multiple pubkey error.
newbie
Activity: 30
Merit: 0
January 08, 2021, 10:45:28 PM
Today I tested Kangaroo 2.2 on the Ubuntu. Everything works great! Thanks a lot Jean_Luc!
Most of the participants in this discussion are programmers, and I have a question for you. How do you loop the MultiPubKey?
I would really like to search the list using different public keys in one specific range.

you can use the:

-m maxStep: number of operations before give up the search (maxStep*expected operation)

and the program will move to next pubkey if not found within -m operations

@WanderingPhilospher thanks for the advice. I am using the command:
Code:
./kangaroo -ws -w save.work -wi 30 -o result.txt in.txt
How to correctly write in (-m maxStep) so that every 15 minutes there is a transition to the next new public key?
the max step is based off of group operations so you'd have to watch when your program normally gets to where you want to end (watching the time) and then enter it, if you want it to end after a length of time. But let's say the estimated operations is 2^30, you would use the max step to end the program's search after 2^30.5, or 2^31, or 2^100, or whatever you want.

Is it possible to automate this in UBUNTU so as not to manually enter the add-on in the terminal? 15 minutes is enough for me to search in each public key in the list.
full member
Activity: 1162
Merit: 237
Shooters Shoot...
January 08, 2021, 10:38:28 PM
Today I tested Kangaroo 2.2 on the Ubuntu. Everything works great! Thanks a lot Jean_Luc!
Most of the participants in this discussion are programmers, and I have a question for you. How do you loop the MultiPubKey?
I would really like to search the list using different public keys in one specific range.

you can use the:

-m maxStep: number of operations before give up the search (maxStep*expected operation)

and the program will move to next pubkey if not found within -m operations

@WanderingPhilospher thanks for the advice. I am using the command:
Code:
./kangaroo -ws -w save.work -wi 30 -o result.txt in.txt
How to correctly write in (-m maxStep) so that every 15 minutes there is a transition to the next new public key?
the max step is based off of group operations so you'd have to watch when your program normally gets to where you want to end (watching the time) and then enter it, if you want it to end after a length of time. But let's say the estimated operations is 2^30, you would use the max step to end the program's search after 2^30.5, or 2^31, or 2^100, or whatever you want.
newbie
Activity: 30
Merit: 0
January 08, 2021, 09:03:50 PM
Today I tested Kangaroo 2.2 on the Ubuntu. Everything works great! Thanks a lot Jean_Luc!
Most of the participants in this discussion are programmers, and I have a question for you. How do you loop the MultiPubKey?
I would really like to search the list using different public keys in one specific range.

you can use the:

-m maxStep: number of operations before give up the search (maxStep*expected operation)

and the program will move to next pubkey if not found within -m operations

@WanderingPhilospher thanks for the advice. I am using the command:
Code:
./kangaroo -ws -w save.work -wi 30 -o result.txt in.txt
How to correctly write in (-m maxStep) so that every 15 minutes there is a transition to the next new public key?
full member
Activity: 1162
Merit: 237
Shooters Shoot...
January 08, 2021, 06:30:31 PM
Today I tested Kangaroo 2.2 on the Ubuntu. Everything works great! Thanks a lot Jean_Luc!
Most of the participants in this discussion are programmers, and I have a question for you. How do you loop the MultiPubKey?
I would really like to search the list using different public keys in one specific range.

you can use the:

-m maxStep: number of operations before give up the search (maxStep*expected operation)

and the program will move to next pubkey if not found within -m operations
full member
Activity: 706
Merit: 111
January 08, 2021, 05:07:56 PM
Today I tested Kangaroo 2.2 on the Ubuntu. Everything works great! Thanks a lot Jean_Luc!
Most of the participants in this discussion are programmers, and I have a question for you. How do you loop the MultiPubKey?
I would really like to search the list using different public keys in one specific range.

For now it only search for 1 key at a time. When the first key is found then it goes to the next one.
newbie
Activity: 30
Merit: 0
January 08, 2021, 04:31:37 PM
Today I tested Kangaroo 2.2 on the Ubuntu. Everything works great! Thanks a lot Jean_Luc!
Most of the participants in this discussion are programmers, and I have a question for you. How do you loop the MultiPubKey?
I would really like to search the list using different public keys in one specific range.
newbie
Activity: 23
Merit: 0
January 08, 2021, 02:43:49 PM
Anyone have luck installing Kangaroo on vast.ai platform? The Linux CUDA installation seems somewhat complex is there a streamlined process of exactly what to install?
full member
Activity: 431
Merit: 105
January 06, 2021, 07:04:59 PM
DP: 626,941,151 TP: 14,389,459,189,655,514

how much percentage of 120th puzzle should these dp and tp have reached, anyone?
thanks
Pages:
Jump to: