NOTE: this is just one way to fix the problem described below but it can be modified - perhaps greatly changed - or rejected and done differently. That being said it does isolate the entries that can be modified except for the one by Simon Cooper as I had intended to do all entries before a commit but I am too tired to continue and there are more important things to be done for the IOCCC (hopefully later today). I don't mind but I wanted to save Landon some of the work as I started the problem even though all with good intention after Landon noted he wanted to thank those in the README.md files. First I would like to also apologise to any previous winners if there was upset or concern; this was all done with the best intentions and I know that it was a fine line but the judges' goal is to make it so previous entries do work in modern systems so that everyone can enjoy them. Still I am sorry if I caused any offence or anything else! I actually agree with the situation and I had been wondering about how to go about it too. Now for the rationale behind this update. A couple previous winners have voiced concern about the way the thank you notes are displayed in the README.md files I have started the work to save Landon some of the trouble as although it was with good intentions (and based on the note that Landon wanted to thank those who fixed an entry) I started the problem so it seems only right that I help rectify it. I also agree with the problem and had thought of it before, even thinking that in some entries it needs not have any reference to anyone but the winner! This commit has removed the thank you notes from several entries and added a THANKS.md file. The THANKS.md file has the rest of the entries that were fixed as well which should if nothing else help isolate the entries that need to be modified. Some entries actually referred to me but were not a thank you note due to a fix; some were from winners themselves for instance. Note that I did not update the bugs.md file or any other file that might refer to these things in the README.md files. The bugs.md for instance refers to adding credits to those who fix problems or provide missing links or files to the respective README.md files and this will have to change once the way this is done is finalised. But hopefully this is a help to Landon so that he may also focus on the important jprint tool in the mkiocccentry repo.
7.1 KiB
Best Entropy-reducer
James A. Woods
Research Institute for Advanced Computer Science
MS 230-5
NASA Ames Research Center
Moffett Field, CA 94131
US
Karl F. Fox
Morning Star Technologies, Inc.
1760 Zollinger Road
Columbus, OH 43221
US
Paul Eggert
Twin Sun Inc.
360 N. Sepulveda Blvd. #2055
El Segundo, CA 90245
US
To build:
make all
NOTE: see the bugs.md file for information on what appears to be a bug in macOS but is actually not.
Try:
To test the official C entry, one might try:
echo "Quartz glyph jocks vend, fix, BMW." | compress | ./btoa | ./jaw
which should apply the identity transformation to a minimal holoalphabetic sentence.
Judges' remarks:
The program, in its base form, implements two useful utilities:
atob- ascii to binary conversionzcat- decompression filter
Included with this entry is a shell script (with comments edited down to reduce it to 1530 bytes) which implements the complete shark utility. The script, shark.sh, contains a 'jaw.c' embedded within it!
The sender must have compress and btoa. To send, try:
sh shark.sh jaw.* README.md > receive
The resulting file, receive, unpacks the input files
even if the receiver lacks uncompress and btoa:
mkdir -p test
cd test
sh ../receive
cmp ../jaw.c jaw.c
cmp ../README.md README.md
Authors' remarks:
ABSTRACT
Minimal, Universal File Bundling (or, Functional Obfuscation in a Self-Decoding Unix Shell Archive)
James A. Woods
Universities Space Research Association
NASA Ames Research Center
"Use an algorithm, go to jail."
-- anon., circa 1988, pre-Morris worm era
Myriad formats have been proposed for network-mailable data. A major difficulty undermining the popularity of most file/message bundlers is that the sender assumes prior installation of the computational dual of such bundling software by the receiver. Command shell archives alleviate this problem somewhat, but still require standardization for the function of data compression and mail-transparency encoding. On Unix, these coding format quandaries are overcome by planting a novel Trojan Horse in the archive header to perform negotiation-less decoding.
Specifically, we outline the development of an extraordinarily compact portable
(un)bundler to (dis)assemble data-compressed, binary-to-ASCII-converted,
length-split, and checksummed directory structures using standard Unix tools.
Miniature versions of counterparts to a Lempel-Ziv coder (compress or
squeeze) and an efficient bit packetizer (btoa) are compiled on-the-fly at
mail destination sites where they may not already exist. These are written in
purposefully obfuscated-C to accompany similarly-shrunk shell command glue. This
resulting shell archiver is dubbed shark.
shark procedure overhead consumes as few as three dozen shell lines (or
~1100 bytes), commensurate with the size of many Internet mail headers; it
amortizes favorably with message size. shark is portable across Unix
variants, while the underlying technique is inherently generalizable to other
encoding schemes.
In the function-theoretic sense of minimal Chaitin/Kolmogorov complexity, and within a modified Shannon model of communication, the 'shark' effort aims to construct a "shortest program" for source decoding in the Turing-universal Unix environment.
Oh, the shark has pretty teeth, dear-- And he shows them pearly white Just a jackknife has Macheath, dear-- And he keeps it out of sight.
-- Bertolt Brecht, Threepenny Opera
Portability
We have ported this program to a wide variety of systems. Among these are:
- SunOS 4.1 / Sun SPARCstation 1 (using both 'cc' and 'gcc 1.37.1')
- SunOS 4.0.3 / Sun 3
- BSD 4.3 / VAX 8650
- SEIUX / Sumitomo Electric Ustation/S
- Sony NEWS-OS 3.3 / Sony NEWS (fairly vanilla 4.3BSD)
- System V.? / Hitachi 2050
- System V.? / NEC EWS 4800
- UNIOS-B / Omron Luna
- Dynix / Sequent Balance ('cc' for Natl. Semi. base + 'gcc 1.36')
- Unicos / Cray 2
Obfuscation
We (the authors) feel this program is obfuscated for the following reasons:
-
This is one of the few programs you'll see WHOSE VERY UTILITY DEPENDS ON ITS OBFUSCATION!
-
The contest entry may be used to send its wonderful self to anyone in the Unix world! Virus writers need not apply...
-
The basic idea is twisted enough to be patentable, but is, out of the kindness of our hearts (as well as to maintain eligibility for the large IOCCC prize fund), dedicated to the public domain. Claude Shannon, meet Alan Turing.
-
Meta-obfuscation is via obfuscated description (see ABSTRACT).
-
"Literary" allusion. Production code contains a reference to self-reference, preserved at amazing cost for sheer perversity.
-
Many, many micro obfuscations below, honed over three years time, in shell as well as C. Ask about the 'tar' pit escape, the
argv[0]flip, Paul's&4294967295portability hack, the "void where prohibited by flaw" fix, thescanf()space-saver, shift shenanigans, signal madness,exit()ing stage left, and source-to-source transformations galore.
For extra credit:
Construct sharkmail, to auto-split sharkives into mailable segments and mail
them. Here's a simple one, which could be extended to enable auto-reassembly
with one shell cmd at the far end.
#!/bin/sh
m=$1; shift
shark $* | split -800 - /tmp/shark$$
n=`ls /tmp/shark$$* | wc -l | sed 's/ *//'`
p=0
for f in `ls /tmp/shark$$*`
do
p=`expr $p + 1`
mail -s "bundle ($p of $n) from '`whoami`'" $m < $f
done
rm /tmp/shark$$*
Shark history:
-
May 1987: Karl Fox introduces 1023-byte zcat.c to USENET. It's too late for the 4th IOCCC.
-
May 21, 1987: James A. Woods extends idea to construct self decompressing shar Trojan horse, utilizing 'cc', 'shar', 'zcat', & 'btoa'; size: 2303 bytes.
-
May 23, 1987: 'jaw' trims 250 bytes without much thought.
-
June 2, 1987: 52 lines of shell, 1991 bytes, now made with 'tar', short-circuit C-compile at far end, dual-use main.c, portability mods. (jaw)
-
Mar-May 1988: abortive run at 5th IOCCC. jaw.c - 1529 bytes. compile line: 152 bytes. generated funny code with execvp() to invoke shell.
-
Aug 29, 1988: production version, now at 1830 bytes.
-
Jan 1990: Paul Eggert does tour-de-force shark re-engineering.
-
May 24, 1990: collaboration yields 999-byte jaw.c core (see above) and 1530-byte production shell code (w/comments). Eggert comes through with lion's share of improvements. 7th IOCCC code now faster than the btoa/zcat it replaces.
-
May 1990: 'jaw' develops experimental replacement using Dan Bernstein's high-compression 'squeeze'.
To which we add:
- June 1990: 'shark' wins the IOCCC, finally! :-)
Copyright and CC BY-SA 4.0 License:
This file is Copyright (c) 2023 by Landon Curt Noll. All Rights Reserved. You are free to share and adapt this file under the terms of this license:
Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)
For more information, see: https://creativecommons.org/licenses/by-sa/4.0/