Bitcoin Forum
November 22, 2026, 09:13:58 AM *
News: Latest Bitcoin Core release: 32.1 [Torrent]
 
   Home   Help Search Login Register More  
Pages: « 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 [29]
  Print  
Author Topic: Solving ECDLP with Kangaroos: Part 1 + 2 + RCKangaroo  (Read 22493 times)
This is a self-moderated topic. If you do not want to be moderated by the person who started this topic, create a new topic. (35 posts by 9+ users deleted.)
linuzm0b
Newbie
*
Offline

Activity: 2
Merit: 0


View Profile
November 19, 2026, 10:42:23 AM
 #561

hello RC,

are you available. i want you to know theres this backdoor from the hashes can you please reply, so i will explain you how its done and you may be able to figure out the steps to match positional fits.
PM me 

By “hashes,” do you mean RIPEMD160(SHA256(SEC1(kG))) from the puzzle address, a hash or PRNG used by the original key generator, or the jump-selection or distinguished-point logic in RCKangaroo? And by “positions,” do you mean bits or hex digits of the scalar k, offsets relative to the lower bound L, bytes in the serialized public key, or indices in the generator sequence?

 Roll Eyes
satashi_nokamato
Jr. Member
*
Offline

Activity: 83
Merit: 6

Originality of BTC is something else


View Profile
Today at 08:07:22 AM
 #562

Did you intentionally left out save work part? Also did you intentionally removed negation map, to reduce the space by factor of 2?

I'm grateful for what you did, and the speed gain is really helpful, but if you wanted not to help the competitions, why even bother releasing this to the public?

I used all versions, all work correctly, v3 above though. And finally are you planning to implement the newly proven hypothesis to make a sort of tunnel instead of a line for random walks, where kangaroos could utilize the new evidence and formula to teleport instead of random walks on a straight line.

Improvements could be done, knowing the range, implementing complements used correctly and precisely to harness the meet in the middle method combined with sophisticated riemann hypothesis if one knows how it could reduce the complexity of solving down to sub 120 bit security for 256 bit key.

The estimated complexity reduction is at least sub 120 bit. With a more aggressive approach, one could lower it even sub 110.

World of mathematics changing rapidly even before the (monster) we were worried about and called it QC.

Won't go to the details, but consider multiplying an odd number by 3, then subtracting it from another odd key then divide the answer by 4 to see how fast you can reduce the search range, imagine implementing such structure into this tool. To know what am I talking about, use an already solved puzzle where key itself is odd, it's offset subtracted from end range is odd but 2 x of target subtracted from end range is even, the x the smaller odd by 3 sub from other odd key and divide by 4 the result. And no worries about negation, because a negated key divided by 4 wont give you A positive result when either added or subtracted from bot original odd keys which are target and it's end range offset.

I thought developers are more kind than this, instead of ignoring or worst, attacking people asking questions, some people if answer and share their knowledge,  it wont kill them, better yet gets them paid.

(Not OP).

bc1qn55msljhk39mkq2xheswzj0kjtxyvgyzpdvcdk
Pages: « 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 [29]
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!