Pollard's kangaroo ECDLP solver

[ssxb]

can you share script to do these calculations or explain a way please

Again, if you go a few pages back you'll find a division script in Python.

This was previously posted in this thread but deleted for some reason, it's a snippet from iceland2k14's Github that divides a pubkey by an arbitrary number and returning all the parts in between. I polished it a bit to print the compressed and uncompressed keys: https://gist.github.com/ZenulAbidin/286a652b160086b3b0f184a886ba68ca

Here's the script output when called with a random (uninteresting - with no balance) pubkey, divided by 48. The keys divided by 0, 1, 2, 3 and so on are printed in order:

~snipped

once you use script and devide with 48 , my question is what range than i have to set to scan if i devide 48
and what about if i divide with 96 what range
and what about like odd number 55

[wedom]

" I got it down to 104 bits today, but with 32,000 pubkeys; better than the normal 2^16 normally required, but I can't figure out a way to shrink it down to one key... "

for 10 bit down = 1024 pubkeys
for 20 bit down = 1024*1024 = 1048576 pubkeys
for 30 bit down = 1024*1024*1024 = 1073741824 pubkeys

1048576 and 1073741824 pubkeys with each other addition and mutiplication will return you 260 pubkeys apear where 16 pubkeys sure inside 10 bit down from main pubkey
these 260 pubkeys again played for get 30 bit down for 1/720 pubkeys
now you can start to find with above tip

can you share script to do these calculations or explain a way please

How to reduce to 260 keys ... I've been looking for this method for almost 3 weeks. ))) I would also like a hint

[studyroom1]

" I got it down to 104 bits today, but with 32,000 pubkeys; better than the normal 2^16 normally required, but I can't figure out a way to shrink it down to one key... "

for 10 bit down = 1024 pubkeys
for 20 bit down = 1024*1024 = 1048576 pubkeys
for 30 bit down = 1024*1024*1024 = 1073741824 pubkeys

1048576 and 1073741824 pubkeys with each other addition and mutiplication will return you 260 pubkeys apear where 16 pubkeys sure inside 10 bit down from main pubkey
these 260 pubkeys again played for get 30 bit down for 1/720 pubkeys
now you can start to find with above tip

which script you used bro

[yoyodapro]

I created a pool for Kangaroo, Puzzle 120(Full Range) DP 22, All kangaroos recorded by server so you can leave and rejoin at anytime.

This server is open to the public however it is by invitation only. If you would like more info Please DM me or reply to my thread https://bitcointalk.org/index.php?topic=5350839.0

Will be hosting a discussion soon about the fairest way to split the prize, but until then we still need to find the address!

[NotATether]

Does this help? Another transaction ID will be created with a different recipient address and with a higher commission. I just don’t remember whether the bitcoin core takes into account the spent of those transactions that are still in the mempool

Yeah it should be untouchable, child-pays-for-parent cannot divert the transaction unless the receiver has sloppily exposed their own private key that they are sending prize money to.

[BitcoinADAB]

I created a pool for Kangaroo, Puzzle 120(Full Range) DP 22, All kangaroos recorded by server so you can leave and rejoin at anytime.

With DP 22 you would need to store ~300,000,000,000 distinguished points to solve #120 and then comparing them.

[yoyodapro]

I created a pool for Kangaroo, Puzzle 120(Full Range) DP 22, All kangaroos recorded by server so you can leave and rejoin at anytime.

With DP 22 you would need to store ~300,000,000,000 distinguished points to solve #120 and then comparing them.

And..? Lol

[BitcoinADAB]

I created a pool for Kangaroo, Puzzle 120(Full Range) DP 22, All kangaroos recorded by server so you can leave and rejoin at anytime.

With DP 22 you would need to store ~300,000,000,000 distinguished points to solve #120 and then comparing them.

We (me and zielar) solved #115 after ~2^33.36 DP (DP25) (More than 300GB of DP). I do not know exactly how long the run takes due to unwanted interruption.

#120, DP22 -> ~10TB of distinguished points and then comparing them

[yoyodapro]

my server has over 40TB of storage space and 3TB of ram, im also using the work split option on the kangaroo clients to keep the ram table low. each work file gets to about 3GB then saves to the harddrive freeing up the ram

[BitcoinADAB]

my server has over 40TB of storage space and 3TB of ram, im also using the work split option on the kangaroo clients to keep the ram table low. each work file gets to about 3GB then saves to the harddrive freeing up the ram

That sounds good.
But one should always know, that kangaroo is not deterministic.

...
Anyway, I'm working on the merger to reduce memory consumption.
I added the plot of probability of success:

Hi,

I did a small program to calculate chance of finding the key (without taking in consideration DP overhead) after a certain number or group operation.
Each value are the result of 100.000 trials so we can expect a precision of 0.3%.

0.5*sqrt(N) P=4.606 %
1.0*sqrt(N) P=17.162 %
1.5*sqrt(N) P=34.138 %
2.0*sqrt(N) P=52.314 %
2.5*sqrt(N) P=68.049 %
3.0*sqrt(N) P=80.350 %
3.5*sqrt(N) P=88.846 %
4.0*sqrt(N) P=94.103 %
4.5*sqrt(N) P=97.164 %
5.0*sqrt(N) P=98.746 %
5.5*sqrt(N) P=99.424 %
6.0*sqrt(N) P=99.752 %

I will increase accuracy and number of point and add a nice plot to the README of the Kangaroo program.

[COBRAS]

my server has over 40TB of storage space and 3TB of ram, im also using the work split option on the kangaroo clients to keep the ram table low. each work file gets to about 3GB then saves to the harddrive freeing up the ram

That sounds good.
But one should always know, that kangaroo is not deterministic.

...
Anyway, I'm working on the merger to reduce memory consumption.
I added the plot of probability of success:

Hi,

I did a small program to calculate chance of finding the key (without taking in consideration DP overhead) after a certain number or group operation.
Each value are the result of 100.000 trials so we can expect a precision of 0.3%.

0.5*sqrt(N) P=4.606 %
1.0*sqrt(N) P=17.162 %
1.5*sqrt(N) P=34.138 %
2.0*sqrt(N) P=52.314 %
2.5*sqrt(N) P=68.049 %
3.0*sqrt(N) P=80.350 %
3.5*sqrt(N) P=88.846 %
4.0*sqrt(N) P=94.103 %
4.5*sqrt(N) P=97.164 %
5.0*sqrt(N) P=98.746 %
5.5*sqrt(N) P=99.424 %
6.0*sqrt(N) P=99.752 %

I will increase accuracy and number of point and add a nice plot to the README of the Kangaroo program.

Kangaroo never stop if not found, if DP is wrong - no luck unfortunately, JeanLuck with 1 GPU make 1 Gkey/sec around. So if someone have a 40 petakeys per second hi work 40 time faster and hi have no server for hundreds of $, if someone deduct publick keys first, hi will be more like with expensive server.

[COBRAS]

my server has over 40TB of storage space and 3TB of ram, im also using the work split option on the kangaroo clients to keep the ram table low. each work file gets to about 3GB then saves to the harddrive freeing up the ram

Bro, maybe is more good variant for you downgrade bitrange of public key first, for example from 120 to 110 bits ? You get more public keys but get more chans for success I think.

Or I can give you my publick key, and I know part of privkey of 120 bit, and you can find a second part if you find a privkey for my publick key.

p.s. If yo give me access to server like yours, I will find a 120 bit privkey in max 2 months. Message me if you interested.


say me privkeys for one of this publick key and I will provide you privkey for 2^120

0459072d8ff6febcfaf3ffed4ad9d46c80393afa17f70ffb2bbc1bab46f6acd46342693b1dac18b e1980a7b8a92fedcba8edce3d38941127290fc3ffbfce68bc1a

048491faa68191040f3426d04448eb03bccbe9bceefa4197a193fb7b83c9bd43f1537ed4ca73a8a fb6ab6ee963ff3b73804c94c021060fb2f3e0d43a786c417f54

04748e8cea5c8ac8218fa12fa15371b78cd2968487d764ce8d35150b3ff97fa58661febc68ecf87 34d2c5ecaec469f2afad60a52033302df31093b9769f3b7085d

[wedom]

...
which script you used bro

If we are talking about

for 10 bit down = 1024 pubkeys
for 20 bit down = 1024*1024 = 1048576 pubkeys
for 30 bit down = 1024*1024*1024 = 1073741824 pubkeys

then NotATether posted it several posts above:
https://gist.github.com/ZenulAbidin/286a652b160086b3b0f184a886ba68ca

If we are talking about

1048576 and 1073741824 pubkeys with each other addition and mutiplication will return you 260 pubkeys apear where 16 pubkeys sure inside 10 bit down from main pubkey
these 260 pubkeys again played for get 30 bit down for 1/720 pubkeys

only Brainless knows this, it is his secret. I don't know if he told anyone about it

[COBRAS]

...
which script you used bro

If we are talking about

for 10 bit down = 1024 pubkeys
for 20 bit down = 1024*1024 = 1048576 pubkeys
for 30 bit down = 1024*1024*1024 = 1073741824 pubkeys

then NotATether posted it several posts above:
https://gist.github.com/ZenulAbidin/286a652b160086b3b0f184a886ba68ca

If we are talking about

1048576 and 1073741824 pubkeys with each other addition and mutiplication will return you 260 pubkeys apear where 16 pubkeys sure inside 10 bit down from main pubkey
these 260 pubkeys again played for get 30 bit down for 1/720 pubkeys

only Brainless knows this, it is his secret. I don't know if he told anyone about it

Hi was told

" I got it down to 104 bits today, but with 32,000 pubkeys; better than the normal 2^16 normally required, but I can't figure out a way to shrink it down to one key... "

for 10 bit down = 1024 pubkeys
for 20 bit down = 1024*1024 = 1048576 pubkeys
for 30 bit down = 1024*1024*1024 = 1073741824 pubkeys

1048576 and 1073741824 pubkeys with each other addition and mutiplication will return you 260 pubkeys apear where 16 pubkeys sure inside 10 bit down from main pubkey
these 260 pubkeys again played for get 30 bit down for 1/720 pubkeys
now you can start to find with above tip

but no one try "pubkeys with each other addition and mutiplication"

But, then I was a child, I have no secret what kind of love boy I was for Sharon Stone, and I told my secret to everyone And many people was trust me )))

@Brainless, show to us your  BTC wallet ? I think something  tells me for some reason, you was some time ago crack some walets , so, we are see, what you have a method, and regard you for your succes

[wedom]

@Brainless, show to us your  BTC wallet ? I think something  tells me for some reason, you was some time ago crack some walets , so, we are see, what you have a method, and regard you for your succes

COBRAS, what is the basis for your accusation?

[Siberian047]

btw i can offer 115bit range only 1 key, for make this key i need 0.75btc for buying 3090rtx gpu's for my calc fast to within 7 days , but here no one have this for work of months to days

I've been puzzling over your way of reducing the number of keys to 16/260 and 1/720 for two weeks now)))
You write that for 1 key of 115 bits it takes 7 days for 3090. How much time does it take to compress to 260 and 720 keys?
Thank you

Based on my experience the compression happens almost instantaneously since you just make 260 or 720 passes in a loop respectively.

I'm not sure I can believe the time to crack is that fast for a single 3090, what's most likely happening is that he's running a bunch of them in parallel. Otherwise #120 wouldn't be so hard to solve and could be done with a GPU farm full of 3090s.

------------------------------------------------------------------------------------------------------------------------------------
Salut.
I also have RTX 3090. I can’t stabilize the speed. The rate is from 5000 to 20.
How did you solve this problem. Or don't you have it?
What's the secret? Why is the speed not stable?

[wedom]

...

Salut.
I also have RTX 3090. I can’t stabilize the speed. The rate is from 5000 to 20.
How did you solve this problem. Or don't you have it?
What's the secret? Why is the speed not stable?

Show an example of startup parameters and output of a program

[WanderingPhilospher]

can you share script to do these calculations or explain a way please

Again, if you go a few pages back you'll find a division script in Python.

This was previously posted in this thread but deleted for some reason, it's a snippet from iceland2k14's Github that divides a pubkey by an arbitrary number and returning all the parts in between. I polished it a bit to print the compressed and uncompressed keys: https://gist.github.com/ZenulAbidin/286a652b160086b3b0f184a886ba68ca

Here's the script output when called with a random (uninteresting - with no balance) pubkey, divided by 48. The keys divided by 0, 1, 2, 3 and so on are printed in order:

~snipped

once you use script and devide with 48 , my question is what range than i have to set to scan if i devide 48
and what about if i divide with 96 what range
and what about like odd number 55

I reduced by using subtraction, not division as in icelands that NotATether posted.

If you are reducing a pubkey that is in the 100 bit range, then think of 2^x. To get the 100 bit pubkey down to 95 bit range, you will need to divide by 2^5 (32); if you want it down to 90 bit range, you will need to divide by 2^10 (1,024); if you use an odd number, then the odd number pubkey will be in a range in between the powers of 2; so if you divided by 777 then the 777 pubkey would be in a range somewhere between 2^91 = 2^100 -  2^9 (512) and 2^90 = 2^100 - 2^10 (1,024)

[ssxb]

can you share script to do these calculations or explain a way please

Again, if you go a few pages back you'll find a division script in Python.

This was previously posted in this thread but deleted for some reason, it's a snippet from iceland2k14's Github that divides a pubkey by an arbitrary number and returning all the parts in between. I polished it a bit to print the compressed and uncompressed keys: https://gist.github.com/ZenulAbidin/286a652b160086b3b0f184a886ba68ca

Here's the script output when called with a random (uninteresting - with no balance) pubkey, divided by 48. The keys divided by 0, 1, 2, 3 and so on are printed in order:

~snipped

once you use script and devide with 48 , my question is what range than i have to set to scan if i devide 48
and what about if i divide with 96 what range
and what about like odd number 55

I reduced by using subtraction, not division as in icelands that NotATether posted.

If you are reducing a pubkey that is in the 100 bit range, then think of 2^x. To get the 100 bit pubkey down to 95 bit range, you will need to divide by 2^5 (32); if you want it down to 90 bit range, you will need to divide by 2^10 (1,024); if you use an odd number, then the odd number pubkey will be in a range in between the powers of 2; so if you divided by 777 then the 777 pubkey would be in a range somewhere between 2^91 = 2^100 -  2^9 (512) and 2^90 = 2^100 - 2^10 (1,024)

Thanks but may i know how we can do addition and multiplication with each other key and get one key as brainless mentioned ?

[yoyodapro]

The kangaroo server is live! DP 25 and currently at DP 2^24.229/2^35.55. The server handles all user Kangaroo backups and work saves, join the discord for more information: https://discord.gg/DjMksx8wqr

we also need to have an open discussion on the best way to split the prize for all involved on the server.