The demoscene has a curated collection of "best 16 bytes ever"
https://nanogems.demozoo.org/#16_byte_intros
As well as 32,64 and so on ...
It even goes down to 8(!) Byte productions
You can do amazing things in 8 bytes [1].
[1] https://tromp.github.io/blog/2026/01/28/largest-number-revis...
You can (on real MSDOS!) go as low as 6 bytes
https://www.pouet.net/prod.php?which=63538
But most people wouldn't find that visually satisfying
The technical details why this works are very interesting though :)
I guess anything that is less than 7 bytes can be brute forced.
Well, it would be 2^(7*8) = 72057594037927936 possible intros. Someone/something has to generate, run and evaluate them all. Theoretically it's the "halting problem" all over, to wait for the "final output" of each intro. The 16 byte effect for example takes a while to achieve its final form. So even if it is somehow managed to evaluate 1000 intros per second, we are looking at about 2 million years of time to really test ALL possible 7 byte intros.
I think there are some standard header bytes, so the number of combinations of the interesting parts might be much smaller. Also I said less than 7 bytes, so it's actually 281474976710656 . If header bytes reduce 1 or 2 bytes, it will be 4294967296 - 1099511627776. 1099511627776 / 1000 / 60 / 60 / 24 / 365 is around 35 years.
https://www.youtube.com/watch?v=QKLhH_ANwIc