I know you say you want to see how people will attack it differently...but I imagine most will overthink it.
Well It is actually a nice challenge, the extended range that him publish is 64 BYTES long (512 bits).
I bet that half of the users of this topic don't have idea how to reduce or transform it to something solvable.
Even for me it was a little tricky to reduce it, my previous method doesn't work and I need to edit some of my codes to work with it.
I already have some method to reduce/rotate the key and I really like it, I learn some limitations of my current tools.
Cool...I guess lol.
I briefly read his original post, but since it was for not that much, I tuned it out.
But as more posts were quoting it, asking questions, etc. I read more into it.
(I've been asked by several people, no, I am not participating in this challenge. I did offer up GPU power, for a few who said they had a "plan", and it was to be free of charge.)
The initial post is misleading to me. Shows x amount of characters, then the real one shows more. Which is whatever, just misleading. Like, what is the challenge really about, is it one thing, two things, 44 things lol?!
All I know it was supposed to be 80 bits, anywhere in what was posted, so to me, you could post something like this:
0xa6c39217128593909a1fcc0fd92c07a6f5abd32c36a8e7cf4e91f1a8f0651db0
and that would be enough.
And it's not that your tools don't work for normal curve things, this is an abstract / different type of challenge.
