Mechanism◆Article
Bundling every version of a document into a single blob and applying a good compression algorithm should wipe out most of the redundant text.
The core insight: rather than compress cleverly per-column, take the full text of every prior version as a JSON array of strings and compress the whole thing with zlib or zstd. ✦ AI generated
The author (as spoken to GPT-Live) · Simon Willison's Weblog · 2026-08-09 · original ↗
compression would work really well, right? If you Bundle all of those different um Every every version of this document all the way back to the start if you were to apply a good compression algorithm to them that should basically wipe out huge amounts of the redundant text.
Read full article ↗excerpt · fair-use quotation
- ·Bundle every version of a document into a single blob
- ·Apply a good compression algorithm to the whole thing
- ·Basically wipes out huge amounts of the redundant text
- ·Far simpler than per-column clever compression
Around this claim
This moment responds to
explains mechanism → Storing revision histories in relational databases is perennially difficult, and column-per-version approaches waste enormous space on long documents.The author (as spoken to GPT-Live) · Simon Willison's Weblogsupports → The scheme is a BLOB history column holding a compressed JSON array of all previous documents, plus an uncompressed parallel JSON array of timestamps.The author (as spoken to GPT-Live) · Simon Willison's Weblog