Quote from: mckemo on February 22, 2024, 12:41:55 PM

Thank you for the reply.
But i think this is the wrong turn.

Lets say i use the pubkey from puzzle 35 02f6a8148a62320e149cb15c544fe8a25ab483a0095d2280d03b8a00a7feada13d
And i let the program run and i want to reduce by 10->
it generates me 1024 keys.
one of the keys will be in range 25.

This works like a charm - >
The key 028490315e76ba204a01059765fadf4a4b5c73cc90e86dee99bc7f378a2b8f3e01 is found. -> Privkey 12bb484

i asked chatgpt to put in, what has been calculated and it added "Derived by subtracting 368 times G"
i dont think this is true..

what math do i have to apply, to get the correct privkey (4aed21170) now?
i can´t get it to work

Do your experiment again but reduce by 8 bits. The math will be obvious.

Iceland's script takes the input and produces a table 2**8 (for 8 bits) = 256 entries.
The first entry is the public key you put in. Then the input is reduced by 1 so for your example it goes 0x70, 0x6f, 0x6e etc for 256 times.

for each entry, there is a 'division' which produces the output table. when it gets to 4aed211 -00- the reduction is to 4aed211.

If you look at the file in a text editor surprise surprise, you will find it at line 113 which is 0x71. (because you count from 1 subtract 1 = 0x70)

Multiply this by 256 (0x100) and you will have your original value.

However, this won't help for any large range because when you multiply the whole table by 256, you get all possibilities 00-ff
They are all valid, so you are no better off.