Search content
Sort by

Showing 12 of 12 results by Shelby0901
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Shelby0901
on 19/05/2025, 20:35:59 UTC
can anyone help me optimize RCKANGAROO by Retired coder i just tried running it on my h200 gpu and i get 5000 mkey/s and im sure the speed can go higher than this and i just need to know what im doing wrong and how i an fix this and here is a screenshot of a it https://ibb.co/pvT1bGf5
Post
Topic
Board Development & Technical Discussion
Re: Solving ECDLP with Kangaroos: Part 1 + 2 + RCKangaroo
by
Shelby0901
on 03/02/2025, 23:02:27 UTC
Hello, I previously asked you a question about adding the -end search range function, you answered me why you are not satisfied with -range .. I will answer why if I am looking for a 130 puzzle, then -range 84 will search where the zeros are in this example -dp 16 -range 84 -start 33e7665705350000000000000000000000 but nothing more right?) and what I mean is that with the -end function I can break the same 135 puzzle into a dozen or a hundred pieces and search throughout -range 134 but with short distances as an example -range 134 -start 6d9999999999999999999999999999996 -end 7ffffffffffffffffffffffffffff I can calculate the work here, let’s say that I would go through one path in one day and the next day start another path, but only with the start I can’t do this because I don’t know where this path ended if I turn off the program in other words, -end is needed so that you can start with it later) but with -range this is not possible

Your idea sounds senseless for me, but anyway it's open-source so you can modify sources and implement all ideas you have.

Can you confirm that you are using the code from Jean Luc here: https://github.com/JeanLucPons/Kangaroo ?

You can download both sources and compare, my code is not related to JLP's code.

I'm really interested, and for us beginners, it would be super helpful to have a detailed tutorial explaining how you set it up from start to finish

I won't write articles like "step-by-step guide how to crack #135", sorry  Smiley


What about little bit of clues 😬@RetiredCoder
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Shelby0901
on 11/10/2024, 08:21:48 UTC
What about 135 puzzle? I have managed to reduce 135 bits down to 120 bits how long would it take?.

Why did you stop the reducing at 120 bits? I'd go full-blown to 1 bit. Let us know if it's a zero or not.

The possible public keys exponentially grow.. By the time i reduce 3 digits from the end if have 1 trillion plus possible public keys

Really? That's a lot of keys. So let me formulate the question another way: once you reduce 135 to 120 bits, is that equivalent or not to having 32768 public keys, of which one of them corresponds to a 120-bit key, while the rest of 32767 correspond to 256-bit keys?

If so, how do you pick the one public key to search for, to have a good reason of calling this as a "reduction" and not an "expansion"?

I really want someone to work with..

Ask @kTimesG for that. He has the software, and you have the hardware. Good luck!

Using 900 RTX 4090, it will take 583 days to break 135, using my software (~ 5.6 Gk/s on a single 4090). It was worth it for 130, but 135, not so much, costs are higher than the reward. We need either much higher computing power, or some advancements in EC math (some fast parallel XGCD would help, since this is the current bottleneck - all threads except one are idle, waiting for a batched inversion to finish). Doing multiple XGCD in parallel (like what JLP version does) is actually a lot slower than doing one "master" batched inversion. Ehm...

@kTimesG
How did you come up with total number of ops at 2^67.783 ?? That is an odd number that I have not seen before. Interesting.

For @Shelby0901, you need to do the math first, and see where you come out ahead, if you have access to x amount of hardware for y amount of hours.

With my Kangaroo, it does 7.5 BK/s on a single RTX 4090, an RTX 3090 gets 5.6 BK/s. Decent speed, but let's not get caught up in Kangaroo, solely.

Instead, we have to look at the lowest 2 challenges / wallets, 67 and 135, which boil down to 66 bits and 134 bits. Now we can look at speeds for programs, brute force and Kangaroo, using the RTX 4090 as the "standard", or for the fact that is what you will have access to.

With my Kangaroo program, it would take roughly 500 days to solve the 135 wallet, with 900 RTX 4090s.
My brute force program averages about 5.1 BK/s with a single 4090. The first average to find the key is around 50% (68% is the next average, if not found by 50%~) of overall keys, so around 2^65 keys checked to find the private key for 67. Let's do the math...93 days to first average of finding the 67 wallet, using 900 RTX 4090s.

So, a 12 hour use of those 900 x RTX 4090s, would get you closer to solving 67 versus 135, IMO.

But, either way you go, you need to plan ahead and think about items such as:
cracking program to use
server
client
how you will load the client and cracking program on all of those machines and hit "start"; will you have access to be able to SSH into each machine?

Pre-plan as much as you can, because you don't want your 12 hours to start and then have to jump through hoops to get them all connected and running.

I wish you luck! And that goes for everybody still seeking these wallets.
A further note for everyone, unless something drastically improves with being able to use a public key, such as BSGS, Kangaroo, etc., the 67, 68, and 69 wallets, are all easier reached (time wise) now versus 135.

Hey can DM
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Shelby0901
on 11/10/2024, 08:05:25 UTC
Hello Shelby,

I have some ideas and tools that could help us collaborate to solve the puzzle. Puzzle 67 is smaller and easier than 135. I've coded a tool that can split the 67-bit space into 900 parts, allowing you to run 900 processes simultaneously, each working on a different part using keyhunt-cuda.

Let me know if you're interested in working together!

DM me.
Hey! Tried DM ing you and this is what I get "User 'b0dre' has not chosen to allow messages from newbies. You should post in their relevant thread to remind them to enable this setting"
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Shelby0901
on 09/10/2024, 07:49:27 UTC
What about 135 puzzle? I have managed to reduce 135 bits down to 120 bits how long would it take?.

Why did you stop the reducing at 120 bits? I'd go full-blown to 1 bit. Let us know if it's a zero or not.

The possible public keys exponentially grow.. By the time i reduce 3 digits from the end if have 1 trillion plus possible public keys

Really? That's a lot of keys. So let me formulate the question another way: once you reduce 135 to 120 bits, is that equivalent or not to having 32768 public keys, of which one of them corresponds to a 120-bit key, while the rest of 32767 correspond to 256-bit keys?

If so, how do you pick the one public key to search for, to have a good reason of calling this as a "reduction" and not an "expansion"?

I really want someone to work with..

Ask @kTimesG for that. He has the software, and you have the hardware. Good luck!

Using 900 RTX 4090, it will take 583 days to break 135, using my software (~ 5.6 Gk/s on a single 4090). It was worth it for 130, but 135, not so much, costs are higher than the reward. We need either much higher computing power, or some advancements in EC math (some fast parallel XGCD would help, since this is the current bottleneck - all threads except one are idle, waiting for a batched inversion to finish). Doing multiple XGCD in parallel (like what JLP version does) is actually a lot slower than doing one "master" batched inversion. Ehm...

Hey @kTimesG I would like work with you.. I think if you can help me with the math I'm stuck  in I think we can crack this puzzle 135 message me a mode that I stay in touch with you.. Please
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Shelby0901
on 08/10/2024, 11:28:30 UTC
What about 135 puzzle? I have managed to reduce 135 bits down to 120 bits how long would it take?.

Why did you stop the reducing at 120 bits? I'd go full-blown to 1 bit. Let us know if it's a zero or not.

The possible public keys exponentially grow.. By the time i reduce 3 digits from the end if have 1 trillion plus possible public keys
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Shelby0901
on 08/10/2024, 10:50:25 UTC
Haha, well, let's just say that 12 hours is like giving a Kangaroo a rocket boost but asking it to hop across the Sahara Desert! There's a chance we could hit the target, but the odds are a bit like finding a needle in the multiverse – still, we’ll have the universe’s fastest Kangaroo on our side.

Any chance people have tried using point division? I mean how effectively can it be used?

Let's go for it, and if we solve it, it'll be legendary. And if not? We'll have an epic tale of trying to tame the impossible with 900 GPUs. Either way, it’s going to be one wild hop about 1.7% of the total search space of puzzle 135! Grin
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Shelby0901
on 08/10/2024, 10:43:02 UTC
Hello guys.. My cousin leads a research team and they have a huge set up.. They have about 900 rtx4090 gpus for research.. I have been trying to convince him to grant me permission to use the set for 12 hours straight.. And finally did... Now I need a strategy to figure out the puzzle 135 or 67 which one would work fastest? I need someone to give me a plan and once it's solved I will give the person  who gave me a solid plan a reward.. I need someone who is just as passionate as I am so work with in solving atleast one puzzle...

1. This is steeling and your cousin can get into trouble.
2. With a single rtx4090 you can achieve about 4000MKey/sec. So with 900 GPUs in 12 hour you have one in 2**66/4_000_000_000/900/3600/12 = 474.45 chance to solve Puzzle 67. That is about 0.21% chance.

What about 135 puzzle? I have managed to reduce 135 bits down to 120 bits how long would it take?.
Post
Topic
Board Bitcoin Discussion
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
by
Shelby0901
on 08/10/2024, 08:45:27 UTC
Hello guys.. My cousin leads a research team and they have a huge set up.. They have about 900 rtx4090 gpus for research.. I have been trying to convince him to grant me permission to use the set for 12 hours straight.. And finally did... Now I need a strategy to figure out the puzzle 135 or 67 which one would work fastest? I need someone to give me a plan and once it's solved I will give the person  who gave me a solid plan a reward.. I need someone who is just as passionate as I am so work with in solving atleast one puzzle...
Post
Topic
Board Development & Technical Discussion
Topic OP
Calculating closer values to the target public key
by
Shelby0901
on 09/07/2023, 23:44:51 UTC
Hey guys do you think there are ways or any tool out there that can actually get us closer to the target public key? What I mean by this is for example let's say G= 120 and P= 1134  where pK = 136080 (G= generator point,  P= priv_key, pK = pub key) let's pretend that we don't have P just pK and we search random ranges to see if pK is within the range of some random valid range within Seco256k1. Well of course i understand that the point doubling doesn't happen like this but just for the sake of example. But let me know your thoughts
Post
Topic
Board Development & Technical Discussion
Re: Pollard's kangaroo ECDLP solver
by
Shelby0901
on 26/11/2022, 02:00:39 UTC
I am not able to find the PrivateKey Undecided it just says done, is it a bug or am i doing something wrong?
Your key is on the edge of provided range. This is the hardest option. It will still be found, but it will take more time and more luck.

Code:
[96.67 MK/s][GPU 0.00 MK/s][Count 2^33.51][Dead 2][02:26 (Avg 01:35)][47.6/81.5MB]
Key# 0 [1S]Pub:  0x029E162328C08BF1B3C9BA030ACBDBE111D1191D07A157AB285A403A739E5F0139
       Priv: 0xE9C742148F3F0C84463F29FE66E2CA




So what does dead kangaroos mean?
Post
Topic
Board Development & Technical Discussion
Re: Pollard's kangaroo ECDLP solver
by
Shelby0901
on 23/11/2022, 03:38:53 UTC
I am not able to find the PrivateKey Undecided it just says done, is it a bug or am i doing something wrong?

this is the range
```
e9c742148f3f0b84463f29fe66e2db
e9c742148f3f0c84463f29fe66e2da
029e162328c08bf1b3c9ba030acbdbe111d1191d07a157ab285a403a739e5f0139

```
this is the private key

```
private key -  0000000000000000000000000000000000e9c742148f3f0c84463f29fe66e2ca

029e162328c08bf1b3c9ba030acbdbe111d1191d07a157ab285a403a739e5f0139

```

and as you see here i use a lower DP it shows the same even if use the suggested DP that is 12

```
Kangaroo v2.2
Start:E9C742148F3F0B84463F29FE66E2DB
Stop :E9C742148F3F0C84463F29FE66E2DA
Keys :1
Number of CPU thread: 4
Range width: 2^64
Jump Avg distance: 2^31.99
Number of kangaroos: 2^16.64
Suggested DP: 12
Expected operations: 2^33.07
Expected RAM: 346.9MB
DP size: 10 [0xFFC0000000000000]
SolveKeyCPU Thread 2: 1024 kangaroos
SolveKeyCPU Thread 0: 1024 kangaroos
SolveKeyCPU Thread 3: 1024 kangaroos
SolveKeyCPU Thread 1: 1024 kangaroos
GPU: GPU #0 GeForce GT 710 (1x192 cores) Grid(2x384) (14.5 MB used)
SolveKeyGPU Thread GPU#0: creating kangaroos...
SolveKeyGPU Thread GPU#0: 2^16.58 kangaroos [0.7s]
[29.87 MK/s][GPU 10.19 MK/s][Count 2^33.88][Dead 5][09:54 (Avg 05:01)][474.0/599.0MB]
Done: Total time 10:03
```


and what does dead kangaroo mean?