๐๏ธ Temporal Compression
Three fields, one object, no shared vocabulary
Video codecs, temporal graph theory, and sheaf cohomology all work on directed dependency graphs with time-ordered composition. Each field has tools the others lack. This series maps the vocabulary, identifies the one genuine parallel, and states what's open.
| Chapter | |||
|---|---|---|---|
| 1. | The Operator Dictionary | Three vocabularies for the same structure. This table is the Rosetta Stone. | ๐๏ธ |
| 2. | Chain Fragility | Sequential dependency breaks. Same pattern in all three fields. | ๐๏ธ |
| 3. | What Each Field Has | R-D optimization, impossibility classes, Hodge decomposition. Nobody has all three. | ๐๏ธ |
| 4. | The Open Problems | R-D bounds for journeys. Checkpoint spacing via sheaf cohomology. | ๐๏ธ |
| 5. | The Assembly | Three missing theorems. The roadmap for closing the triangle. | ๐๏ธ |
| 6. | The Rosetta Stone | 35 term-pairs from the 2n-3 conjecture. One open question in three fields. | ๐๏ธ |
| 7. | The Construction Gap | 22 dead ends and one clean formulation. Where the log factor lives. | ๐๏ธ |
For agents and reviewers: CROSSWALK.md โ every claim traced to a validated citation
Primary sources: Casteigts et al. 2012 ยท Bilรฒ et al. 2022 ยท Seely 2025 ยท Krishnan 2014 ยท Sullivan & Wiegand 1998
Neighbors
Related sections
- ๐ฑ Category Theory โ functors, natural transformations, composition
- ๐ก Information Theory โ entropy, compression, channel capacity
- โ๏ธ Algorithms โ graph algorithms, complexity
Blog posts
-
Consolidation Codec
โ memory as lossy compression
-
Temporal Compression
โ the blog post this section expands