Quote from: pfr advance on Today at 01:23:32 PM

Quote from: karrask on Today at 03:32:30 AM

Quote from: pfr advance on January 07, 2025, 02:51:27 PM

Quote from: atom13 on January 07, 2025, 12:41:32 PM

Quote from: RetiredCoder on January 07, 2025, 12:04:57 PM

Quote from: zloy_ya on January 06, 2025, 07:50:43 PM

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.

Quote from: pfr advance on January 07, 2025, 11:18:11 AM

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.

Quote from: pfr advance on January 07, 2025, 11:18:11 AM

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

And by the way can you send me your BTC Cheesy

Some people don´t understand how hard is this to crack

Hi,

Thanks for your response. Could you please share the GitHub repository for your solution? I’d like to explore different approaches, but I want to start by testing Jean Luc’s solution first. I’m not asking for a step-by-step guide to crack #135—I’m still figuring out how to compile Jean Luc’s program with the latest versions. For example, to compile VanitySearch, you had to update Visual Studio Code in 2017 instead of using the 2022 version. Unfortunately, there haven't been any updates from him for a while, and I hope he’s doing well.

As for the other person, it seems you’re taking the easy way out. I never asked for BTC; I prefer to solve the puzzles that the most kind and fair Satoshi made available to us. At least he let us try freely. He would probably be sad to see shortcuts like the ones you’ve suggested. Anyway, I forgive you.

Best regards,
P.S. A big thank you to Satoshi, even though I lost all my 10 BTC back in 2017 Cry. That’s why I want to try my luck with Jean Luc’s code.
PFR ==> bc1qltyqxw94nynyj9nq8kqfvzuxjrwejd6vrdvhlm

in the 2022 version

<Import Project="$(VCTargetsPath)\BuildCustomizations\CUDA 12.6.props" />
<Import Project="$(VCTargetsPath)\BuildCustomizations\CUDA 12.6.targets" />

<CodeGeneration Condition="'$(Configuration)|$(Platform)'=='Release|x64'">compute_86,sm_86;compute_90,sm_90</CodeGeneration>

Thank you so much karrask , finally some people who get straight to the point.

not at all. did you manage to assemble the code?