I have tried navigate the page, but I still have not figured out what the goal was this year, who won, with which program and what has been obfuscated in it.
Is there a better summary of this contest somewhere? Is there a link I'm missing?
rules.txt contains rules and the overarching goals of the IOCCC, not the particular theme/goal for this year, and now I've wasted a few minutes poking through it to make sure. Thanks a lot.
I'm not sure what copyright issues (writing or code or?) you are concerned about, but you should be able to get around them with a little planning. Just don't outright copy stuff.
"It is easier to get forgiveness than permission." -- Words of wisdom from a career bureaucrat.
I think the simplest way is to just set up a site and make sure you cite your sources. The site under discussion here would be a primary source and should be listed as such on every single page that references any of the data found there.
Beyond that, it really depends on what the GP intends.
Start a blog and write a little blurb about each winner as separate blog posts? I don't think any permission is needed. Just write whatever you want to say about the project and note that they are the winner listed here and link to the page where they are listed.
Start a clone of the site that adds additional info? Yeah, you maybe need to go talk to folks and find out if they are okay with that and get it in writing.
> Creative Commons License. This work by Landon Curt Noll, Simon Cooper, and Leonid A. Broukhis is licensed under a Creative Commons Attribution-ShareAlike 3.0 Unported License.
An IOCCC Judge here. Do you want to volunteer? What do you have in mind? Please contact us at j.2018@ioccc.org and include "IOCCC 2018" in the subject line. Thanks!
Not GP, but if you put the whole website on a git repo people can contribute easily (I can somehow imagine you may not too keen on handing things over to Github or something centralised like that, but surely you can have a self-hosting option)
Fabrice Bellard (the wizard behind FFmpeg, QEMU, etc.) has his own entry, which I find amazing: a ~4 kB program that outputs a ~50 kB image (of Lena), in addition to being able to decompress other images. His entry's hint page: http://www.ioccc.org/2018/bellard/hint.html
"The uncompressed image is 12 times larger than the source code of the program which includes the image data and the complete decoder. The actual image data is 1220 byte long, which gives a compression ratio of 40. Using a JPEG-like algorithm would not be enough to reach this level of compression (the Lena image would be barely recognizable). So the algorithm is based on the latest advances in image compression."
Almost certainly not yet. The compression method seems to be pretty advanced, borrowing ideas from h.264 etc. and is almost certainly incompatible with any currently existing format.
If we're lucky, Bellard might eventually post an image compressor program on his website at https://bellard.org/.
Of course there are plenty of compression artifacts, but very impressive for just 1220 bytes of image data embedded in decompressor written in C totaling only 3984 bytes of source code!
No idea about what kind of service pasteboard.co is, hopefully the image will stay up for a while...
Edit: For comparison, here's a roughly corresponding original Lena image converted into 1269 byte 128x128 JPEG.
I'm more used to .md or .markdown, but apparently .text is also used for markdown files. Picking .txt (which I assume you're hinting at) would not be the most specific choice here.
Funny enough, the creator of Perl's previously well known accomplishment was winning these contests pretty much any time he cared to join. Take that as you will.
An IOCCC Judge here. We are rather fond of this one. The "prog" variant allows you to build and run the mullender entry from the first IOCCC http://www.ioccc.org/years.html#1984.
The source is provided in the image, as is the compiler.
Don Yang provided a video of how he wrote the code and transformed it into the obfuscated version (see spoiler.html). It is as interesting as the final result itself.
An IOCCC Judge here. Sure, a variety of things! A competition can take about 4 full weekends of time ~128hrs total (Fri:6+Sat:16+Sun:10 x 4) to set up, judge and release the results. Getting 3 independent and very busy people coordinated with work, travel and major life events going on can get quite difficult. Recently we've opted to not start a competition if we do not pre-schedule the weekends for completing it! The result is that 2016 and 2017 could not happen.
Yang's spoiler.html is actually super interesting as it's a live coding session for the entire program essentially. Also I thought the program name looked familiar when it said nuko, it's from the manga/anime Shoujo Shuumatsu Ryokou. It's a cute little thing that likes to eat technology, looks like this one's eaten four programs!
55 comments
[ 1.7 ms ] story [ 120 ms ] threadWho Won?: http://www.ioccc.org/2018/whowon.html
Guidelines: http://www.ioccc.org/2018/guidelines.txt
http://underhanded-c.org/#summary
http://www.ioccc.org/2018/whowon.html
I'm actually of a mind to start a new webpage that does just that, but there might be some copyright issues there.
I think the simplest way is to just set up a site and make sure you cite your sources. The site under discussion here would be a primary source and should be listed as such on every single page that references any of the data found there.
Beyond that, it really depends on what the GP intends.
Start a blog and write a little blurb about each winner as separate blog posts? I don't think any permission is needed. Just write whatever you want to say about the project and note that they are the winner listed here and link to the page where they are listed.
Start a clone of the site that adds additional info? Yeah, you maybe need to go talk to folks and find out if they are okay with that and get it in writing.
Should be fine, no?
Hehe...
50kB to 4kB is a 10x compression, it doesn't seem that huge, what's the achievement here?
"The uncompressed image is 12 times larger than the source code of the program which includes the image data and the complete decoder. The actual image data is 1220 byte long, which gives a compression ratio of 40. Using a JPEG-like algorithm would not be enough to reach this level of compression (the Lena image would be barely recognizable). So the algorithm is based on the latest advances in image compression."
http://www.ioccc.org/2018/bellard/hint.html
> The actual image data is 1220 byte long, which gives a compression ratio of 40.
btw, the `animate` program can also be used to display the animated GIFs from endoh1.
If we're lucky, Bellard might eventually post an image compressor program on his website at https://bellard.org/.
https://pasteboard.co/Hk60KEv.png
Of course there are plenty of compression artifacts, but very impressive for just 1220 bytes of image data embedded in decompressor written in C totaling only 3984 bytes of source code!
No idea about what kind of service pasteboard.co is, hopefully the image will stay up for a while...
Edit: For comparison, here's a roughly corresponding original Lena image converted into 1269 byte 128x128 JPEG.
https://pasteboard.co/Hk67yXC.pngThe 'sound based cat' is one of my favorites: http://www.ioccc.org/2018/algmyr/hint.html (I do NOT recommend running this with anything but minimal volume!)
> 2004
Wow that is pretty old.
It's very liberating, when you don't need to chase a trend.
It's interesting to see how well, or badly, the syntax colourization in NeoVIM copes with the various entries.
http://www.ioccc.org/2018/mills/prog.c
Anyone able to decode what is "punched" into it?