Pollard's kangaroo ECDLP solver

[WanderingPhilospher]

today i successfully jump from 110 bit back toward target key range but i landed 5 bit down the range of target key , still figuring it out lets see ~~

math is beautiful and hell big  in range

I am trying to figure out what you are doing. With a divisor of 32, you will only go down 5 bit ranges. 120 to 115, 115 to 110, 110 to 105, etc.

[1714475692]

1714475692

[1714475692]

1714475692

[NotATether]

little bit more example
dec 33
hex 21
pubkey 021697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5
use your program to get 32 keys of above pubkey

you will see 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 in your list
one step ahead pubkey is 1.03125 ( 03bb2228d3ea32cb3c1eb160cc824a4ba8115f9a7f415d18ddcaac8193defc2c47 + 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798  )

and in private key F7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFEC4D965FF79CE5B39E1D3CB9869B48F38
029eda0cebe3c594b59add6dccbff3347f06ad09e83e0b9279dd821cc94284c5d0

hope you will test each zone for your understand

Sorry to rain on this, but this method is useless.

I managed to decode how to split multiple keys using this method (I even made a script that reproduces your example, but it's private at the request of someone else, not that the results would be useful/practical to anyone here), and it turns out you're just using mod(32)-sized ranges.

Now as we all know, when you modinv a small number on secp256k1 you get a very large number (and modinv a "decimal number" is really just modinv(denominator) * numerator so this still holds for that)

This effectively means that the range becomes humungous, way bigger than 2^120 where we started.


The ranges look something like this (P = public key):

1*modinv(32) 2*modinv(32)     1P
2*modinv(32) 3*modinv(32)     2P
...
32*modinv(32) 33*modinv(32) (32*modinv(32) = 1)      32P

The ranges are much bigger than when you divide-and-split them down by a number.

Now of course you can replace 32 with an extremely huge number to make the ranges manageable/smaller but what's the point? Now you have an unmanageable amount of public keys.

[COBRAS]

This is a 120 bit puzzle publick key !!!

If someone find a privkey for this pubkey in a range:

1:1124bff742a76f92fa3a76f8f6552f (decimal only 89014422443240977657631574972585263 !!! ) Range is mach less then origginal 120 Puzle range !!!

pubkey:

03c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938
02c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938

search in pubkey what start with 02 some faster than 03.

you can try any of this pubkeys.

Proof of my succes tests with another ranges and same pubkeys one what start with 03, and anower start with 02:

• Working on Pubkey: 049fa3ea651e72c5f0a660c7ae509ad180860477283f539c918a2e43514c29da92237c8751b32e5 90883aa8bd617c60aa6b388aa78381cc7adb10046a33b038598
• Using  [Number of CPU Threads: 3] [DP size: 10] [MaxStep: 1]
• ............................................
• Scanning Range  0x1 : 0x100000000000000
• [55.22 TeraKeys/s][Kang 3072][Count 2^27.92/2^29.06][Elapsed 48s][Dead 0][RAM 25.8MB/44.7MB]
  ============== KEYFOUND ==============
  Kangaroo FOUND PrivateKey : 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbf59aefd71d64b15
  
  
• Working on Pubkey: 049fa3ea651e72c5f0a660c7ae509ad180860477283f539c918a2e43514c29da92dc8378ae4cd1a 6f77c557429e839f5594c775587c7e338524effb95bc4fc7697
• Using  [Number of CPU Threads: 3] [DP size: 10] [MaxStep: 1]
• ............................................
• Scanning Range  0x1 : 0x100000000000000
• [42.05 TeraKeys/s][Kang 3072][Count 2^28.68/2^29.06][Elapsed 01:26][Dead 0][RAM 37.7MB/44.7MB]
  ============== KEYFOUND ==============
  Kangaroo FOUND PrivateKey : 0x0000000000000000000000000000000000000000000000000078af8f5e5ff62c
  ======================================
  
  We are spit 1.2 btc 50/50 after with someone who publication in this thread privkey first, all others member sorry... !!!
  
  Lets DO IT !!! ?
  
  
  

[WanderingPhilospher]

This is a 120 bit puzzle publick key !!!

If someone find a privkey for this pubkey in a range:

1:1124bff742a76f92fa3a76f8f6552f (decimal only 89014422443240977657631574972585263 !!! ) Range is mach less then origginal 120 Puzle range !!!

pubkey:

03c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938
02c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938

search in pubkey what start with 02 some faster than 03.

you can try any of this pubkeys.

Proof of my succes tests with another ranges and same pubkeys one what start with 03, and anower start with 02:

• Working on Pubkey: 049fa3ea651e72c5f0a660c7ae509ad180860477283f539c918a2e43514c29da92237c8751b32e5 90883aa8bd617c60aa6b388aa78381cc7adb10046a33b038598
• Using  [Number of CPU Threads: 3] [DP size: 10] [MaxStep: 1]
• ............................................
• Scanning Range  0x1 : 0x100000000000000
• [55.22 TeraKeys/s][Kang 3072][Count 2^27.92/2^29.06][Elapsed 48s][Dead 0][RAM 25.8MB/44.7MB]
  ============== KEYFOUND ==============
  Kangaroo FOUND PrivateKey : 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbf59aefd71d64b15
  
  
• Working on Pubkey: 049fa3ea651e72c5f0a660c7ae509ad180860477283f539c918a2e43514c29da92dc8378ae4cd1a 6f77c557429e839f5594c775587c7e338524effb95bc4fc7697
• Using  [Number of CPU Threads: 3] [DP size: 10] [MaxStep: 1]
• ............................................
• Scanning Range  0x1 : 0x100000000000000
• [42.05 TeraKeys/s][Kang 3072][Count 2^28.68/2^29.06][Elapsed 01:26][Dead 0][RAM 37.7MB/44.7MB]
  ============== KEYFOUND ==============
  Kangaroo FOUND PrivateKey : 0x0000000000000000000000000000000000000000000000000078af8f5e5ff62c
  ======================================
  
  We are spit 1.2 btc 50/50 after with someone who publication in this thread privkey first, all others member sorry... !!!
  
  Lets DO IT !!! ?
  
  

I will find it...for the team...for the win!! With my new program that does not require DPs or RAM. It just searches for xpoint and let's every thread just EAT!

Working on xPoint: c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938
Using  [Number of CPU Threads: 0] [DP size: n/a]
Using GPU [GPU Id 0 RTX 3070]
............................................
Scanning Range  0x1 : 0x1124bff742a76f92fa3a76f8f6552f
[2714579271.01 TeraKeys/s] [Elapsed 4:26][RAM n/a]

[COBRAS]

This is a 120 bit puzzle publick key !!!

If someone find a privkey for this pubkey in a range:

1:1124bff742a76f92fa3a76f8f6552f (decimal only 89014422443240977657631574972585263 !!! ) Range is mach less then origginal 120 Puzle range !!!

pubkey:

03c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938
02c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938

search in pubkey what start with 02 some faster than 03.

you can try any of this pubkeys.

Proof of my succes tests with another ranges and same pubkeys one what start with 03, and anower start with 02:

• Working on Pubkey: 049fa3ea651e72c5f0a660c7ae509ad180860477283f539c918a2e43514c29da92237c8751b32e5 90883aa8bd617c60aa6b388aa78381cc7adb10046a33b038598
• Using  [Number of CPU Threads: 3] [DP size: 10] [MaxStep: 1]
• ............................................
• Scanning Range  0x1 : 0x100000000000000
• [55.22 TeraKeys/s][Kang 3072][Count 2^27.92/2^29.06][Elapsed 48s][Dead 0][RAM 25.8MB/44.7MB]
  ============== KEYFOUND ==============
  Kangaroo FOUND PrivateKey : 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbf59aefd71d64b15
  
  
• Working on Pubkey: 049fa3ea651e72c5f0a660c7ae509ad180860477283f539c918a2e43514c29da92dc8378ae4cd1a 6f77c557429e839f5594c775587c7e338524effb95bc4fc7697
• Using  [Number of CPU Threads: 3] [DP size: 10] [MaxStep: 1]
• ............................................
• Scanning Range  0x1 : 0x100000000000000
• [42.05 TeraKeys/s][Kang 3072][Count 2^28.68/2^29.06][Elapsed 01:26][Dead 0][RAM 37.7MB/44.7MB]
  ============== KEYFOUND ==============
  Kangaroo FOUND PrivateKey : 0x0000000000000000000000000000000000000000000000000078af8f5e5ff62c
  ======================================
  
  We are spit 1.2 btc 50/50 after with someone who publication in this thread privkey first, all others member sorry... !!!
  
  Lets DO IT !!! ?
  
  

I will find it...for the team...for the win!! With my new program that does not require DPs or RAM. It just searches for xpoint and let's every thread just EAT!

Working on xPoint: c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938
Using  [Number of CPU Threads: 0] [DP size: n/a]
Using GPU [GPU Id 0 RTX 3070]
............................................
Scanning Range  0x1 : 0x1124bff742a76f92fa3a76f8f6552f
[2714579271.01 TeraKeys/s] [Elapsed 4:26][RAM n/a]

Great Bro, let's do it together !!! I was waiting your part of privkey, and after we get 1.2BTC and split them 50/50% !!!


p.s. [2714579271.01 TeraKeys/s] 2 Yotakeys, wow 

[ssxb]

This is a 120 bit puzzle publick key !!!

If someone find a privkey for this pubkey in a range:

1:1124bff742a76f92fa3a76f8f6552f (decimal only 89014422443240977657631574972585263 !!! ) Range is mach less then origginal 120 Puzle range !!!

pubkey:

03c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938
02c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938

search in pubkey what start with 02 some faster than 03.

you can try any of this pubkeys.

Proof of my succes tests with another ranges and same pubkeys one what start with 03, and anower start with 02:

• Working on Pubkey: 049fa3ea651e72c5f0a660c7ae509ad180860477283f539c918a2e43514c29da92237c8751b32e5 90883aa8bd617c60aa6b388aa78381cc7adb10046a33b038598
• Using  [Number of CPU Threads: 3] [DP size: 10] [MaxStep: 1]
• ............................................
• Scanning Range  0x1 : 0x100000000000000
• [55.22 TeraKeys/s][Kang 3072][Count 2^27.92/2^29.06][Elapsed 48s][Dead 0][RAM 25.8MB/44.7MB]
  ============== KEYFOUND ==============
  Kangaroo FOUND PrivateKey : 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbf59aefd71d64b15
  
  
• Working on Pubkey: 049fa3ea651e72c5f0a660c7ae509ad180860477283f539c918a2e43514c29da92dc8378ae4cd1a 6f77c557429e839f5594c775587c7e338524effb95bc4fc7697
• Using  [Number of CPU Threads: 3] [DP size: 10] [MaxStep: 1]
• ............................................
• Scanning Range  0x1 : 0x100000000000000
• [42.05 TeraKeys/s][Kang 3072][Count 2^28.68/2^29.06][Elapsed 01:26][Dead 0][RAM 37.7MB/44.7MB]
  ============== KEYFOUND ==============
  Kangaroo FOUND PrivateKey : 0x0000000000000000000000000000000000000000000000000078af8f5e5ff62c
  ======================================
  
  We are spit 1.2 btc 50/50 after with someone who publication in this thread privkey first, all others member sorry... !!!
  
  Lets DO IT !!! ?
  
  

I will find it...for the team...for the win!! With my new program that does not require DPs or RAM. It just searches for xpoint and let's every thread just EAT!

Working on xPoint: c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938
Using  [Number of CPU Threads: 0] [DP size: n/a]
Using GPU [GPU Id 0 RTX 3070]
............................................
Scanning Range  0x1 : 0x1124bff742a76f92fa3a76f8f6552f
[2714579271.01 TeraKeys/s] [Elapsed 4:26][RAM n/a]

Great Bro, let's do it together !!! I was waiting your part of privkey, and after we get 1.2BTC and split them 50/50% !!!


p.s. [2714579271.01 TeraKeys/s] 2 Yotakeys, wow 

looks good , is it possible to share this program with us

[ssxb]

today i successfully jump from 110 bit back toward target key range but i landed 5 bit down the range of target key , still figuring it out lets see ~~

math is beautiful and hell big  in range

How long did it take for you to do that?

i am trying to create formula to jump back but seems not working once i figure it out will let all guys know it ,

for example i do divisor and get some keys , than i did more divisor and i saw one key which i already know from 110 bit upper range of target key

for example i was working on 60 range and saw key belongs to 170 range in the list .

well now i already know what is the private key of 170 range , so i am figuring out how to jump back from 170 range to 60 while multiple divisor and shits are in the way 

[ssxb]

little bit more example
dec 33
hex 21
pubkey 021697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5
use your program to get 32 keys of above pubkey

you will see 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 in your list
one step ahead pubkey is 1.03125 ( 03bb2228d3ea32cb3c1eb160cc824a4ba8115f9a7f415d18ddcaac8193defc2c47 + 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798  )

and in private key F7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFEC4D965FF79CE5B39E1D3CB9869B48F38
029eda0cebe3c594b59add6dccbff3347f06ad09e83e0b9279dd821cc94284c5d0

hope you will test each zone for your understand

Sorry to rain on this, but this method is useless.

I managed to decode how to split multiple keys using this method (I even made a script that reproduces your example, but it's private at the request of someone else, not that the results would be useful/practical to anyone here), and it turns out you're just using mod(32)-sized ranges.

Now as we all know, when you modinv a small number on secp256k1 you get a very large number (and modinv a "decimal number" is really just modinv(denominator) * numerator so this still holds for that)

This effectively means that the range becomes humungous, way bigger than 2^120 where we started.


The ranges look something like this (P = public key):

1*modinv(32) 2*modinv(32)     1P
2*modinv(32) 3*modinv(32)     2P
...
32*modinv(32) 33*modinv(32) (32*modinv(32) = 1)      32P

The ranges are much bigger than when you divide-and-split them down by a number.

Now of course you can replace 32 with an extremely huge number to make the ranges manageable/smaller but what's the point? Now you have an unmanageable amount of public keys.

i guess we need to figure out how to make range small , as if we use some techniques and range will get bigger and bigger no one is going to beat that as with each bit increment you need to pay your 100 of life's hahahah 

[ssxb]

This is a 120 bit puzzle publick key !!!

If someone find a privkey for this pubkey in a range:

1:1124bff742a76f92fa3a76f8f6552f (decimal only 89014422443240977657631574972585263 !!! ) Range is mach less then origginal 120 Puzle range !!!

pubkey:

03c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938
02c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938

search in pubkey what start with 02 some faster than 03.

you can try any of this pubkeys.

Proof of my succes tests with another ranges and same pubkeys one what start with 03, and anower start with 02:

• Working on Pubkey: 049fa3ea651e72c5f0a660c7ae509ad180860477283f539c918a2e43514c29da92237c8751b32e5 90883aa8bd617c60aa6b388aa78381cc7adb10046a33b038598
• Using  [Number of CPU Threads: 3] [DP size: 10] [MaxStep: 1]
• ............................................
• Scanning Range  0x1 : 0x100000000000000
• [55.22 TeraKeys/s][Kang 3072][Count 2^27.92/2^29.06][Elapsed 48s][Dead 0][RAM 25.8MB/44.7MB]
  ============== KEYFOUND ==============
  Kangaroo FOUND PrivateKey : 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbf59aefd71d64b15
  
  
• Working on Pubkey: 049fa3ea651e72c5f0a660c7ae509ad180860477283f539c918a2e43514c29da92dc8378ae4cd1a 6f77c557429e839f5594c775587c7e338524effb95bc4fc7697
• Using  [Number of CPU Threads: 3] [DP size: 10] [MaxStep: 1]
• ............................................
• Scanning Range  0x1 : 0x100000000000000
• [42.05 TeraKeys/s][Kang 3072][Count 2^28.68/2^29.06][Elapsed 01:26][Dead 0][RAM 37.7MB/44.7MB]
  ============== KEYFOUND ==============
  Kangaroo FOUND PrivateKey : 0x0000000000000000000000000000000000000000000000000078af8f5e5ff62c
  ======================================
  
  We are spit 1.2 btc 50/50 after with someone who publication in this thread privkey first, all others member sorry... !!!
  
  Lets DO IT !!! ?
  
  
  
  

i need more explanation as i have to take down my workers and will start searching this one but i need some mathematical or logical prove for what i am searching , i can solve this i guess easily with my firepower. but really need some logic here   

[WanderingPhilospher]

i need more explanation as i have to take down my workers and will start searching this one but i need some mathematical or logical prove for what i am searching , i can solve this i guess easily with my firepower. but really need some logic here

If you could solve it easily with your firepower, why not solve 120? This key is in a 117 bit range, so not far from 119 bit range.

[ssxb]

i need more explanation as i have to take down my workers and will start searching this one but i need some mathematical or logical prove for what i am searching , i can solve this i guess easily with my firepower. but really need some logic here

If you could solve it easily with your firepower, why not solve 120? This key is in a 117 bit range, so not far from 119 bit range.

you are right my dear but read my words, i didnot say that in one day or one week , 120 is hell of range , and any bit down will make some easiness so i have to believe and dream i can solve this  , but main focus is here some logic behind this key that is important

[WanderingPhilospher]

i need more explanation as i have to take down my workers and will start searching this one but i need some mathematical or logical prove for what i am searching , i can solve this i guess easily with my firepower. but really need some logic here

If you could solve it easily with your firepower, why not solve 120? This key is in a 117 bit range, so not far from 119 bit range.

you are right my dear but read my words, i didnot say that in one day or one week , 120 is hell of range , and any bit down will make some easiness so i have to believe and dream i can solve this  , but main focus is here some logic behind this key that is important

I did read your words my dearest of dears dear...you said easily, I said why not solve 120? I did not say in one day or one week. I merely said solve 120 if you can solve 117 easily.  Whatever easily is to you...I did not say what your "easily" is oh dearie deary dear of dearest dears.

[Alpaste]

Please guys share us the program that does 2714579271.01Tera/s
What kind of program is this? how does it search with such a very huge fast speed?
many thanks

[NotATether]

I will find it...for the team...for the win!! With my new program that does not require DPs or RAM. It just searches for xpoint and let's every thread just EAT!

Working on xPoint: c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938
Using  [Number of CPU Threads: 0] [DP size: n/a]
Using GPU [GPU Id 0 RTX 3070]
............................................
Scanning Range  0x1 : 0x1124bff742a76f92fa3a76f8f6552f
[2714579271.01 TeraKeys/s] [Elapsed 4:26][RAM n/a]

LOL   , nice try with the speed doctoring WP.

For real though, I think the number of points is much smaller than the number of privkeys, because you can exclude invalid points on the curve when searching for xpoint.

Please guys share us the program that does 2714579271.01Tera/s
What kind of program is this? how does it search with such a very huge fast speed?
many thanks

I think it was just a prank, there is no way to make a program that can search

2714.57927101

exakeys per second.

[Alpaste]

Yes i think too it's a prank.
there's no way that a program can search THIS much addreseses/s

[COBRAS]

I will find it...for the team...for the win!! With my new program that does not require DPs or RAM. It just searches for xpoint and let's every thread just EAT!

Working on xPoint: c95ba9e6a637e739d13a6d036507ecc37a70c26e68ac7e5f157268311c6c3938
Using  [Number of CPU Threads: 0] [DP size: n/a]
Using GPU [GPU Id 0 RTX 3070]
............................................
Scanning Range  0x1 : 0x1124bff742a76f92fa3a76f8f6552f
[2714579271.01 TeraKeys/s] [Elapsed 4:26][RAM n/a]

LOL   , nice try with the speed doctoring WP.

For real though, I think the number of points is much smaller than the number of privkeys, because you can exclude invalid points on the curve when searching for xpoint.

Please guys share us the program that does 2714579271.01Tera/s
What kind of program is this? how does it search with such a very huge fast speed?
many thanks

I think it was just a prank, there is no way to make a program that can search

2714.57927101

exakeys per second.

Why ? JeanLuck kangaroo keyrate is 1 Giga, I use kangaroo what 55 terra, and I was try BSGS what 500 Peta(but I no so like BSGS, kangaroo I like more), so WanderingPhilospher make his own soft what has exakeys... If you use dead software this not meant what other uses so software 2.

[NotATether]

Why ? JeanLuck kangaroo keyrate is 1 Giga, I use kangaroo what 55 terra, and I was try BSGS what 500 Peta(but I no so like BSGS, kangaroo I like more), so WanderingPhilospher make his own soft what has exakeys... If you use dead software this not meant what other uses so software 2.

Well you might be right about BSGS (but I have never used that software before so take this with a grain of salt), but I don't think you can hit 55 terakeys per second on kangaroo without a GPU farm and leverage the kangaroo server feature.

[COBRAS]

Why ? JeanLuck kangaroo keyrate is 1 Giga, I use kangaroo what 55 terra, and I was try BSGS what 500 Peta(but I no so like BSGS, kangaroo I like more), so WanderingPhilospher make his own soft what has exakeys... If you use dead software this not meant what other uses so software 2.

Well you might be right about BSGS (but I have never used that software before so take this with a grain of salt), but I don't think you can hit 55 terakeys per second on kangaroo without a GPU farm and leverage the kangaroo server feature.

see this again:

[55.22 TeraKeys/s][Kang 3072][Count 2^27.92/2^29.06][Elapsed 48s][Dead 0][RAM 25.8MB/44.7MB] This is absolute normal keyrate, but not comfortable for work. Yes, I hope wanderPhilisopher will help and we share with him 1.2 BTC 50/50%.

[Alpaste]

Yes, ok but could you share us the program? which program is this..

[BitcoinADAB]

Why ? JeanLuck kangaroo keyrate is 1 Giga, I use kangaroo what 55 terra, and I was try BSGS what 500 Peta(but I no so like BSGS, kangaroo I like more), so WanderingPhilospher make his own soft what has exakeys... If you use dead software this not meant what other uses so software 2.

Well you might be right about BSGS (but I have never used that software before so take this with a grain of salt), but I don't think you can hit 55 terakeys per second on kangaroo without a GPU farm and leverage the kangaroo server feature.

Maybe they have ...

Do you know, if there are already asics like these

not to mine coins but for point addition?