Quote from: LeTH3knXoDArzm on Today at 01:02:30 PM

Quote from: llenn1227 on Today at 11:56:07 AM

Quote from: LeTH3knXoDArzm on Today at 11:33:07 AM

Solved it!

Thank you RetiredCoder for the puzzle, a few more and I can buy a brand new rtx 5090 Grin

Should I also put how I managed to solve it?

Congrulations!
It's sad i've need to work

Wonder what strategy you manage to solve this puzzle?
can you tell us how you solve it?

Thank you!
Some math + kangaroo then some math again to reassemble the whole private key.

Quote from: mcdouglasx on Today at 12:55:49 PM

Quote from: LeTH3knXoDArzm on Today at 11:33:07 AM

Solved it!

Thank you RetiredCoder for the puzzle, a few more and I can buy a brand new rtx 5090 Grin

Should I also put how I managed to solve it?

I suppose you divided the public key by 10 and then brute-forced A, and the rest is history. If A + B + C + D.

1PGRtg6XjiYSB1VJAhsqLQc6hQeBqFGVPD

Not really, the key is between 2^255-2^256, so if you take this private key (integer): 62522620898388648159897954119572167059065661617885912620603899974102669643449 and divide it by 10 it will never be in 2**63, 2**64 bit range Grin

But if it's not A + B + C + D, but rather concatenated, you would only need to brute-force 16 bits and automate the rest until it matches... That's what comes to mind for me. Was it like that?