Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
kundor
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
by
kundor
4y ago
That's been done: https://www.dr-mikes-math-games-for-kids.com/your-name-in-pi...
2.
▲
by
kundor
4y ago
I added a reduced preview of this to my blog post. I really like how it gives an impression of finding Waldo in a haystack of noise, just like in the picture books. The preview is not as pretty as the real thing, but I thought embedding a 2
3.
▲
by
kundor
4y ago
That's awesome!
4.
▲
by
kundor
4y ago
PS. The fact that any image can be encoded in 32 bytes this way implies that there are only 2^256 possible images — about one hundred and sixteen quattuorvigintillion. That's obviously not literally true, but we are searching for a sub
5.
▲
by
kundor
4y ago
You can have infinite and nonrepeating sequences which don't contain every possible subsequence. For instance, 1010010001000... (where there is one more zero each time) never repeats itself, but it never even has the digit 2 in it.
6.
▲
by
kundor
4y ago
You're right, that's a mistake! It should be the 92,296,989th through 92,300,940th bits. Yes, I did only search at 4-bit aligned bytes. Doing otherwise would be more complicated, much harder for others to easily verify from the do
7.
▲
by
kundor
4y ago
That's a cool egg! It's been a long time since I read Contact. Are the aliens supposed to have hacked the geometry of the universe to make the pattern show up in π?
8.
▲
by
kundor
4y ago
Yes, to an extent that would work. 1) Take target image 2) Find the index in π (say) where a matchable sequence of bytes occur, like for Waldo. (If your image is big, this could take several years of computation time.) 3) Transmit the palet
9.
▲
by
kundor
4y ago
But the probability of you actually finding where that string occurs before the sun goes nova is much, much smaller.
10.
▲
by
kundor
4y ago
Yes, it helps to have more unique values. We want each repeated byte to occur in part of the pattern where a color also repeats. What I do is search for substrings with the fewest repeated bytes that don't match the target pattern. I p
11.
▲
by
kundor
4y ago
The part that's from π is the actual pixel data, which is extracted in the Python snippet "waldo.tobytes()". More-or-less equivalently, you could use "list(waldo.getdata())". The GIF file as stored on disk has extra
12.
▲
by
kundor
4y ago
That's still a choice of palette; you'll find it listed on Wikipedia [1] under "Regular RGB palettes". There's no doubt it's a much more objective choice than the one I used! I did say I was cheating. Going to