Quote from: lordfrs on June 03, 2023, 11:36:16 PM

Quote from: digaran on June 03, 2023, 12:55:01 PM

Quote from: elvis13 on June 03, 2023, 07:02:15 AM

Digaran @
You can't offer anything useful. An endless stream of insanity.!

Look who is talking! Why would I offer something which could help breaking ECC? I can only hint at them, but there are already resourceful people around here explaining everything in details.

Quote from: vjudeu on June 03, 2023, 08:02:33 AM

Quote

I wonder, how many halving do I need to reduce a 125 bit key down to 40 bit?

You can always halve a key. However, if your key will be odd, then after halving it, you will end up in a worse situation.

Code:

SHA-256("125-bit")=c383a1ae19ff4401f72fdfbb4ffeb6fc7a38c6692b07b188edcbdc31b0160ee7
mask125=0000000000000000000000000000000020000000000000000000000000000000
(hash%mask125)=key=000000000000000000000000000000001a38c6692b07b188edcbdc31b0160ee7
key/2=7fffffffffffffffffffffffffffffff6a73d1a7ed2828e256cf1d5f40262814
key-1=000000000000000000000000000000001a38c6692b07b188edcbdc31b0160ee6
(key-1)/2=000000000000000000000000000000000d1c63349583d8c476e5ee18d80b0773

See? You can reach a key with less bits, only if you know if it is even or odd. So, if you want to go from 125-bit key to 40-bit key, then guess what: you have to know the last 85 bits.

I already know that, we don't want +n key to be odd, halving it would halve the entire -n key which is a number near 2^256, and when we reach the middle range the halving reverses. Complex stuff! 😉

Quote from: batareyka on June 03, 2023, 10:00:26 AM

digaran
If you are surprised by the doubling of the original key, then you are still at the very beginning of this "jungle". numbers
I will share with you a little bit what the future holds for you if you have the strength and inspiration to explore the Bitcoin curve.
There are amazing things that can make 100 hours of your work useless and make you happy in the most unexpected place and time of working with a curve.
There are special numbers on the curve that can be used to get exactly 1 digit less.
A third of the number you are looking for.
A quarter of the sought number.
You can get the mirror part of the number you are looking for, which can also be compared with the original.
And this is not even a 10th part of what is there.
You can get a lot.

But by carrying out various manipulations with the numbers on the curve, as vjudeu said, you can get into an even more difficult situation and get a .....................labyrinth.

I wish you success.

Mirror, quarter, third, one digit less, I'm not interested in those, I'm interested to find new ways and equations to solve a puzzle.

I live in this jungle, and I rather not pursuit shadows, they take you to dark parts of the woods.

Good luck to you too, may the help of God be with you all brothers! We can do this. 🤣

My algorithm is working, it will be smoother with a few minor adjustments. I tried with Puzzle 115 pubkey and reduced it to 2**28 bits in 2 seconds. It took 1 second for the collider application to find the pubkey. Now writing the code to reverse the Algorithm

.

I don't like working, my brain is almost numb from the blood pressure pills
i can't think

I'm sorry my English is bad, I'm writing from translate, but I hope you understand what I mean.

Hello.
Could you share your algorithm?
I wonder how you managed this: "Puzzle 115 pubkey and reduced it to 2**28 bits in 2 seconds".

Sincerely,
be healthy.