CyberDefi

Member
23
Posts
67
Reputation
Feb 2, 2017
Joined
Recent posts
  • Please don't spam my GitHub repos, it’s just wasting your time.

  • Sure, you can always use CPU instead of GPU if speed isn’t a concern. There’s a lot you can do without speed being a priority, like using Python instead of C++ for easier development.

  • Thanks for the support, everyone! I'm slowly getting my ideas out there. Here’s Part 2 of 3: Check it out here: https://github.com/RetiredC/Kang-2 This part covers my new kangaroo looping method, applicable for all…

  • Exactly, high DP overhead pushes K up, especially with many kangaroos. Better to keep the number of kangaroos low relative to sqrt(range). Using 64K kangaroos for a 32-bit range is a bad move since all kangs would just…

  • I’ve got a new method that requires only 1.15*sqrt(N) operations (not just theoretical). Check out this paper for methods that need 2*sqrt(N) and 1.714*sqrt(N): https://arxiv.org/pdf/1501.07019 Or this one for…

  • Right, that’s correct. Windows, VS MFC C++, taking it back to the old school.

  • Look at 'Ec.cpp', it's relevant: https://en.bitcoin.it/wiki/Secp256k1

  • I prefer C++ for speed, which helps me test tons of points to figure out K accurately. CUDA is even faster but it complicates research, so I only use it for final testing. I added a diagram today to make it clearer.

  • That's in Part 3, so it might take a bit more time.

  • And here’s Part 3, focusing on RCKangaroo software for Windows and Linux. The code is available here: https://github.com/RetiredC/RCKangaroo This version implements a fast SOTA method along with improved loop handling…

  • Continuing with Part 2 of my kangaroo methods research. You can find it here: https://github.com/RetiredC/Kang-2 In this part, I've introduced a new technique for managing kangaroo loops. It applies to all ranges and DP…

  • Hey everyone, Just wanted to share my findings on using kangaroo methods to tackle ECDLP. This is Part 1 of my research. Check out the open-source software I made: https://github.com/RetiredC/Kang-1 It showcases…

  • Lol, I see how kangaroos can help here. Check out my post for the deets! 😂 Anyway, massive congrats to the winner!

  • Hey everyone, got a new mini-puzzle for you! ⚡️ There's 0.01 BTC waiting on this address, so get to it! 03BBF1AFF1B753DFA4C58835C2C135D7D2C7CEA8635D483D37A8997B666CC1FA61 Hint: private key is…

  • Yeah, it’s not a good look for crypto. Just hoping a strong regulation comes in to keep these guys in check.

  • Generally, all businesses need a license to operate. No matter the currency, a permit is usually required. Unless there’s some special rule for crypto, best to check with your local authorities.

  • What’s up everyone? We all use tools like MACD and RSI to spot trades. But with actually jumping in, that’s where things get tricky. What stops you from executing trades quickly? Is it the platform, the networks, or…

  • You’re overselling it. Precomputing values risks ruining the randomness, which is what makes the birthday paradox work. You might just end up in a mess.

  • BSGS on secp256k1 needs about 1.0 sqrt(N) operations on average. You only have to store a fraction of the keys, so it’s not all that bad.

  • Yeah, we all know that paper. I’ve even put it into my own Python script. It does bring C down to around 1.25-1.45, but the logic is a mess and it’s super complex to handle. Plus, starting points are costly.