The collection of smallest things, where the word smallest can be proved and verified. See also short codes for the collection of small codes.
It’s 67 bytes long:
PNG Header:
0000: 89 50 4E 47 0D 0A 1A 0A "\x89PNG\r\n\x1a\n"
IHDR Chunk:
0008: 00 00 00 0D Size of this chunk (13)
000C: 49 48 44 52 "IHDR"
0010: 00 00 00 01 Width (1px)
0014: 00 00 00 01 Height (1px)
0018: 08 Bit depth (8 bits per pixel)
0019: 06 Color type (truecolor with alpha)
001A: 00 Compression method (deflate)
001B: 00 Filter method (adaptive filtering)
001C: 00 Interlace method (none)
001D: 1F 15 C4 89 CRC of this chunk
IDAT Chunk:
0021: 00 00 00 0A Size of this chunk (10)
0025: 49 44 41 54 "IDAT"
0029: 78 zlib header (CMF): DEFLATE, 32 KiB window
002A: 9C zlib header (FLG): no preset, default level
002B: 63 00 01 00 zlib contents for "00 00 00 00 00"
<-LSB MSB-> (filter type 0, rgba(0,0,0,0))
+----------+
| 1 | ---------------- Final block
| 10 | ---------------- Huffman coding block with fixed codes
| 00110 | -+-------------- Literal byte 00 (code 0)
| 000 | -'
| 00000 | -+-------------- Reference with length=4 (code 258)
| 10 | -'
| 00000 | ---------------- ...and distance=1
| 0 | -.
| 000000 | -+-------------- End of block (code 256)
| 00 | ---------------- Padding
+----------+
002F: 00 05 00 01 zlib Adler-32 checksum
0033: 0D 0A 2D B4 CRC of this chunk
IEND Chunk:
0037: 00 00 00 00 Size of this chunk (0)
003B: 49 45 4E 44 "IEND"
003F: AE 42 60 82 CRC of this chunk
This file contains a transparent pixel, but the smallest PNG file with a black or white pixel has the same size (using grayscale).
This file is the smallest because:
HLIT (5) + HDIST (5) + HCLEN (4) + at least 3 code lengths for tree (at least 12).↩