World Compression: Efficient World Representations

• World Compression is the process of replacing extensive observations or states with compact yet functional representations to support explanation, prediction, and reconstruction.
• Techniques range from algorithmic information theory and latent token bottlenecks to geometry-aware transforms, balancing predictive accuracy with storage efficiency.
• Applications span video world models, robotics forecasting, 3D asset reconstruction, and structured scientific data, highlighting practical tradeoffs between losslessness and efficiency.

“World Compression” denotes a family of ideas in which large bodies of observations, states, or structures are replaced by a more compact representation that still supports the operations that matter for the target domain: explanation and prediction in science, long-horizon consistency in video world models, future-state forecasting in robotics, geometric or semantic reconstruction in 3D assets, and efficient storage or transmission of scientific fields and graphs. Across the literature, compression is not a single technique but a design criterion: a representation is valuable insofar as it preserves the information needed for reconstruction, retrieval, prediction, intervention, or rendering while discarding redundancy. In some works, this criterion is formalized through algorithmic information theory; in others, it appears as latent token bottlenecks, KV-cache pruning, semantic object descriptions, or geometry-aware transforms on structured domains such as spheres and small-world graphs (Zenil, 2019).

1. Algorithmic and epistemic foundations

A foundational formulation of world compression appears in Hector Zenil’s argument that “compression is comprehension”: scientific understanding consists in finding compact computable descriptions that reproduce, predict, and organize observed phenomena (Zenil, 2019). In that setting, compression is not file compression but shortest effective description. The canonical quantity is Kolmogorov-Chaitin complexity,

$C_U(s)=\min\{|p|:U(p)=s\},$

with incompressibility defining algorithmic randomness. Zenil also emphasizes the invariance theorem,

$|C_{U_1}(s)-C_{U_2}(s)|<c,$

and algorithmic probability,

$AP(s)=\sum_{p:U(p)=s}2^{-|p|},$

linked to complexity by the coding theorem

$|-\log_2 AP(s)-C(s)|<c.$

Within this view, scientific laws function as compressed generative programs for the world rather than as mere summaries of data (Zenil, 2019).

This perspective makes prediction and explanation two aspects of the same compression problem. A useful model starts from initial values, executes a computable mechanism, and reaches a future state “in a shorter time than the time taken by the actual unfolding of the phenomenon in question” (Zenil, 2019). Zenil’s operational methods—the Coding Theorem Method, the Block Decomposition Method, and Algorithmic Information Dynamics—extend this idea to finite empirical objects such as graphs, matrices, cellular automata, and biological networks. The broader implication is that world compression, in its strongest philosophical form, is the search for compact generative causes rather than the search for compact files.

A related but more engineering-oriented version appears in “Lossless data compression by large models,” which treats compression as probabilistic next-symbol prediction followed by arithmetic coding (Li et al., 2024). The paper uses the standard arithmetic-coding identity that code length is governed by predictive probability, so better conditional models imply shorter codes. Its framing is explicitly aligned with the claim that better “understanding” yields better compression, though the concrete mechanism is cross-entropy reduction rather than a direct proof of semantic understanding (Li et al., 2024). A plausible implication is that modern world compression systems can be read as operational approximations to the more abstract “compression is comprehension” thesis: compact world representations are judged by what they enable a model to predict, recover, or control.

2. Predictive world models and compressed futures

In robotics and embodied forecasting, world compression often means predicting future world state in a compact latent space rather than in pixels. The 1X World Model Challenge technical report makes this explicit by separating a sampling track from a compression track: the latter predicts future discrete latent token grids obtained from the Cosmos $8\times 8\times 8$ tokenizer (Mereu et al., 8 Oct 2025). Each sample contains 6 token grids of shape $32\times 32$; the first 3 are history, the next 3 are prediction targets, and these three-grid blocks correspond to 17 RGB frames at $256\times256$ resolution (Mereu et al., 8 Oct 2025). The task is formalized as prediction of future latents $\hat{\mathbf z}_{H:H+M-1}$ from past latents and robot states, and trained with cross-entropy over future token grids: $$\min_\theta \mathbb{E}\Big[\sum_{t=K}^{K+M-1}\mathrm{CE}(\hat{\mathbf z}_t,\mathbf z_t)\Big].$$

The resulting model is a 24-layer Spatio-Temporal Transformer with alternating spatial attention, causal temporal attention, and feed-forward blocks, using learnable absolute spatial and temporal embeddings, additive robot-state embeddings, pre-LayerNorm, QKNorm, tied input/output embeddings, and teacher forcing during training (Mereu et al., 8 Oct 2025). Its benchmark score, Top-500 CE $=6.6386$, secured first place in the compression challenge (Mereu et al., 8 Oct 2025). Here the “world” is compressed twice: first by the tokenizer, which maps RGB video into discrete grids, and then by the dynamics model, which predicts only the future compressed states. This is world compression in the practical sense of modeling environment dynamics in a compact symbolic representation aligned with embodiment.

A stronger shared-prior version appears in Squeeze3D, where a pretrained encoder $|C_{U_1}(s)-C_{U_2}(s)|<c,$0 maps a 3D asset $|C_{U_1}(s)-C_{U_2}(s)|<c,$1 to $|C_{U_1}(s)-C_{U_2}(s)|<c,$2, a trainable map compresses it to $|C_{U_1}(s)-C_{U_2}(s)|<c,$3, and a second map lifts it into a generator latent for reconstruction (Dagli et al., 9 Jun 2025). The forward relation is written as

$|C_{U_1}(s)-C_{U_2}(s)|<c,$4

with reconstruction driven by a frozen pretrained generator after inverse mapping (Dagli et al., 9 Jun 2025). The paper reports compression ratios of up to $|C_{U_1}(s)-C_{U_2}(s)|<c,$5 for textured meshes, $|C_{U_1}(s)-C_{U_2}(s)|<c,$6 for point clouds, and $|C_{U_1}(s)-C_{U_2}(s)|<c,$7 for radiance fields, while stressing that the decoder’s pretrained generator is shared side information rather than transmitted payload (Dagli et al., 9 Jun 2025). This suggests a distinct regime of world compression: rather than storing full world state, one stores a small code and relies on a strong generator as an extreme neural decompressor.

The same principle reappears in “Lossless data compression by large models,” though there the compressed representation is not a learned latent bottleneck but an arithmetic code induced by large-model token probabilities (Li et al., 2024). Across these works, a common structure emerges: compression is not judged only by size reduction, but by whether the compressed state remains predictive of future observations, reconstructive of appearance, or compatible with downstream control.

3. Long-horizon visual memory as compressed world evidence

Video world models introduce a specific world-compression problem: a model must preserve enough of the visual past that a previously seen region can be rendered consistently when revisited under a new camera trajectory. “Compression and Retrieval: Implicit Memory Retrieval for Video World Models” frames this as a memory-compression bottleneck rather than a pure context-scaling problem (Peng et al., 22 Jun 2026). The paper argues that keeping the full history at token resolution is prohibitively expensive in diffusion-transformer video models, while heuristic frame retrieval is too rigid under large viewpoint changes, occlusion, distractors, or hard cuts (Peng et al., 22 Jun 2026).

CaR answers this by compressing the entire visual history into latent tokens and making retrieval query-dependent inside attention. Its geometry-aware retrieval injects camera information through a projective matrix

$|C_{U_1}(s)-C_{U_2}(s)|<c,$8

which is expanded tokenwise into

$|C_{U_1}(s)-C_{U_2}(s)|<c,$9

and used in a modified attention rule

$AP(s)=\sum_{p:U(p)=s}2^{-|p|},$0

Because the interaction contains $AP(s)=\sum_{p:U(p)=s}2^{-|p|},$1, attention depends on relative projective geometry rather than on temporal proximity alone (Peng et al., 22 Jun 2026). The paper visualizes this on a controlled trajectory $AP(s)=\sum_{p:U(p)=s}2^{-|p|},$2, where target $AP(s)=\sum_{p:U(p)=s}2^{-|p|},$3 attends most strongly to context closest in viewpoint and suppresses geometrically irrelevant views (Peng et al., 22 Jun 2026).

CaR’s compression module is a dual-branch context encoder: a coarse branch downsamples context in pixel space by $AP(s)=\sum_{p:U(p)=s}2^{-|p|},$4 in time, height, and width before a frozen VAE, while a detail branch VAE-encodes the original-resolution context and applies a lightweight latent downsampler (Peng et al., 22 Jun 2026). The reported result is a reduction of context tokens by about $AP(s)=\sum_{p:U(p)=s}2^{-|p|},$5 relative to latent tokens before compression (Peng et al., 22 Jun 2026). The ablation on compression ratio shows the expected frontier. The default $AP(s)=\sum_{p:U(p)=s}2^{-|p|},$6 ratio yields PSNR $AP(s)=\sum_{p:U(p)=s}2^{-|p|},$7, SSIM $AP(s)=\sum_{p:U(p)=s}2^{-|p|},$8, LPIPS $AP(s)=\sum_{p:U(p)=s}2^{-|p|},$9, FVD $|-\log_2 AP(s)-C(s)|<c.$0, latency $|-\log_2 AP(s)-C(s)|<c.$1s, and memory $|-\log_2 AP(s)-C(s)|<c.$2GB, while $|-\log_2 AP(s)-C(s)|<c.$3 is more expensive and $|-\log_2 AP(s)-C(s)|<c.$4 is faster but weaker in memory quality (Peng et al., 22 Jun 2026).

The central empirical point is that representation quality matters more than token count alone. Against the naive downsampling variant Ours-DS, full CaR improves SceneFly revisiting from PSNR $|-\log_2 AP(s)-C(s)|<c.$5/SSIM $|-\log_2 AP(s)-C(s)|<c.$6/LPIPS $|-\log_2 AP(s)-C(s)|<c.$7/FVD $|-\log_2 AP(s)-C(s)|<c.$8 to $|-\log_2 AP(s)-C(s)|<c.$9/$8\times 8\times 8$0/$8\times 8\times 8$1/$8\times 8\times 8$2, and on SpatialVid revisiting reduces FVD from $8\times 8\times 8$3 to $8\times 8\times 8$4 (Peng et al., 22 Jun 2026). The sink-frame ablation further shows that an independently encoded uncompressed anchor frame remains useful: using the initial frame as sink gives PSNR $8\times 8\times 8$5, compared with $8\times 8\times 8$6 for a tail sink and $8\times 8\times 8$7 without sink (Peng et al., 22 Jun 2026). This indicates that compressed world memory is not always sufficient by itself; some information is preserved outside the compressed path as a high-fidelity stabilizer.

CaR therefore treats world compression as lossy but retrieval-aware summarization of visual experience. What is preserved is not a 3D map or explicit scene graph, but a globally accessible compressed latent memory whose utility depends on geometry-conditioned addressing (Peng et al., 22 Jun 2026).

4. Compression of internal world memory and attention state

A related but distinct strand compresses not the external observations directly, but the model’s internal memory substrate. WorldKV starts from the observation that, in autoregressive video diffusion, the transformer’s KV cache functions as an emergent world memory: if the model can attend to all past keys and values, revisited viewpoints tend to remain consistent (Yi et al., 21 May 2026). The obstacle is cost. On LingBot-World-Fast, a single 3-frame chunk occupies about $8\times 8\times 8$8GB across all transformer layers, and a one-minute rollout exceeds $8\times 8\times 8$9GB (Yi et al., 21 May 2026). Sliding-window inference restores throughput but discards exactly the older KV entries that support revisit fidelity (Yi et al., 21 May 2026).

WorldKV separates retrieval and compression. Retrieval stores evicted KV-cache chunks and later reinserts scene-relevant ones into the native attention window using camera/action correspondence; compression shrinks each stored chunk by pruning redundant tokens relative to an anchor frame (Yi et al., 21 May 2026). For non-anchor frame token $32\times 32$0, the redundancy score is

$32\times 32$1

High-similarity tokens are treated as redundant, low-similarity tokens as distinctive. With $32\times 32$2 and retention of the bottom $32\times 32$3 among pooled non-anchor tokens, a chunk shrinks from $32\times 32$4 tokens to $32\times 32$5, yielding roughly $32\times 32$6 storage efficiency and fitting $32\times 32$7 more history under a fixed budget (Yi et al., 21 May 2026).

The crucial system-level result is that broader compressed coverage can outperform narrower uncompressed coverage. Under a fixed budget of 3 chunk-equivalents on LingBot-World-Fast, storing $32\times 32$8 compressed chunks yields LPIPS $32\times 32$9, PSNR $256\times256$0, SSIM $256\times256$1, and FID $256\times256$2, compared with $256\times256$3 uncompressed chunks at $256\times256$4, $256\times256$5, $256\times256$6, and $256\times256$7 (Yi et al., 21 May 2026). This directly supports the claim that world compression can improve persistent-world fidelity not only by reducing storage, but by reallocating capacity toward broader historical coverage.

A more general inference-time formulation appears in TempCache and its companion sparse-attention mechanisms for autoregressive video diffusion (Samuel et al., 2 Feb 2026). There, the target is the unbounded growth of cached temporal memory and dense attention computations. TempCache merges temporally corresponding keys, using approximate nearest-neighbor retrieval and a grouped-attention justification with multiplicity correction

$256\times256$8

so that duplicate keys can be merged approximately while preserving attention behavior (Samuel et al., 2 Feb 2026). AnnCA and AnnSA further reduce cross-attention and self-attention by selecting candidate prompt tokens or semantic key subsets (Samuel et al., 2 Feb 2026). The reported outcome is up to $256\times256$9–$\hat{\mathbf z}_{H:H+M-1}$0 end-to-end speedups while preserving near-dense quality, with nearly constant peak GPU memory over 3K-frame rollouts (Samuel et al., 2 Feb 2026).

These systems instantiate world compression at the level of internal state rather than observable content. The compressed entity is the model’s operative memory of the world: KV-cache chunks, prompt context, or attention graphs. This suggests that, for long-horizon simulators, compressing the world can mean compressing the computational substrate that makes world persistence feasible.

5. Geometric, semantic, and operational compression of 3D worlds

In 3D object and asset compression, world compression divides into at least three regimes: structural compression of explicit geometry, semantic compression through generative priors, and operational compression that preserves variables needed for assembly reasoning.

“Semantic Compression of 3D Objects for Open and Collaborative Virtual Worlds” takes the strongest semantic position: instead of storing vertices, polygons, and textures, it stores natural-language descriptions, optionally augmented with a sparse frontal edge map, and relies on GPT-4, DALL·E 3, ControlNet, and Zero123++ to reconstruct plausible objects (Dotzel et al., 22 May 2025). The semantic code is restricted to lowercase letters and spaces with budgets such as $\hat{\mathbf z}_{H:H+M-1}$1, $\hat{\mathbf z}_{H:H+M-1}$2, or $\hat{\mathbf z}_{H:H+M-1}$3 characters (Dotzel et al., 22 May 2025). Structured semantic variants add a Canny edge map controlled by threshold $\hat{\mathbf z}_{H:H+M-1}$4, stored in sparse coordinate format when sufficiently sparse (Dotzel et al., 22 May 2025). The paper reports rates as high as $\hat{\mathbf z}_{H:H+M-1}$5 on Objaverse objects and argues that semantic compression can outperform traditional methods in the quality-preserving region around $\hat{\mathbf z}_{H:H+M-1}$6 compression (Dotzel et al., 22 May 2025). The central tradeoff is explicit: semantic fidelity can remain high while exact geometry, topology, UV layout, and provenance-specific detail are lost.

By contrast, “Beyond Spatial Compression: Interface-Centric Generative States for Open-World 3D Structure” argues that standard 3D tokenizers are too narrowly “compression-centric” because they entangle local geometry, component identity, and assembly relations in a passive latent stream (Chen et al., 11 May 2026). C2LT-3D factorizes representation into canonical local geometry, partition-conditioned context, and relational seam variables. Canonicalization is defined locally by

$\hat{\mathbf z}_{H:H+M-1}$7

while partition-aware attention uses

$\hat{\mathbf z}_{H:H+M-1}$8

and seam scoring predicts compatibility, transform refinement, and collision evidence (Chen et al., 11 May 2026). On the 1,024-object Objaverse-LVIS benchmark, C2LT-3D improves over VQ-Patch from Chamfer $\hat{\mathbf z}_{H:H+M-1}$9 to $$\min_\theta \mathbb{E}\Big[\sum_{t=K}^{K+M-1}\mathrm{CE}(\hat{\mathbf z}_t,\mathbf z_t)\Big].$$0, Hausdorff $$\min_\theta \mathbb{E}\Big[\sum_{t=K}^{K+M-1}\mathrm{CE}(\hat{\mathbf z}_t,\mathbf z_t)\Big].$$1 to $$\min_\theta \mathbb{E}\Big[\sum_{t=K}^{K+M-1}\mathrm{CE}(\hat{\mathbf z}_t,\mathbf z_t)\Big].$$2, contamination $$\min_\theta \mathbb{E}\Big[\sum_{t=K}^{K+M-1}\mathrm{CE}(\hat{\mathbf z}_t,\mathbf z_t)\Big].$$3 to $$\min_\theta \mathbb{E}\Big[\sum_{t=K}^{K+M-1}\mathrm{CE}(\hat{\mathbf z}_t,\mathbf z_t)\Big].$$4, separation $$\min_\theta \mathbb{E}\Big[\sum_{t=K}^{K+M-1}\mathrm{CE}(\hat{\mathbf z}_t,\mathbf z_t)\Big].$$5 to $$\min_\theta \mathbb{E}\Big[\sum_{t=K}^{K+M-1}\mathrm{CE}(\hat{\mathbf z}_t,\mathbf z_t)\Big].$$6, and normal consistency $$\min_\theta \mathbb{E}\Big[\sum_{t=K}^{K+M-1}\mathrm{CE}(\hat{\mathbf z}_t,\mathbf z_t)\Big].$$7 to $$\min_\theta \mathbb{E}\Big[\sum_{t=K}^{K+M-1}\mathrm{CE}(\hat{\mathbf z}_t,\mathbf z_t)\Big].$$8 (Chen et al., 11 May 2026). The paper’s broader claim is that 3D world representations should be evaluated not only by reconstruction, but by whether their discrete states remain operational for ownership, attachment validation, repair, and constrained decoding (Chen et al., 11 May 2026).

A more classical explicit-geometry regime appears in dynamic human mesh compression. “KeyNode-Driven Geometry Coding for Real-World Scanned Human Dynamic Mesh Compression” compresses real scanned human sequences with changing topology by transmitting sparse key-node transformations and octree-coded residuals (Hoang et al., 3 Jan 2025). Prediction is written as

$$\min_\theta \mathbb{E}\Big[\sum_{t=K}^{K+M-1}\mathrm{CE}(\hat{\mathbf z}_t,\mathbf z_t)\Big].$$9

and residuals are measured against the closest point on the target mesh surface,

$=6.6386$0

The paper reports average BD-rate savings of $=6.6386$1 overall relative to V-DMC modes, with especially strong gains on slow-motion sequences and low bitrates (Hoang et al., 3 Jan 2025). Here world compression is neither semantic nor latent-retrieval-based; it is predictive coding of deformable captured humans, which are a central component of immersive world state.

These 3D strands do not agree on what should be preserved. Semantic compression preserves human-centric concept and lets structure be regenerated (Dotzel et al., 22 May 2025). C2LT-3D preserves explicit local geometry but insists that ownership and seam validity must remain natively addressable (Chen et al., 11 May 2026). KeyNode-driven coding preserves explicit geometry under temporal motion, prioritizing bandwidth-efficient transmission of dynamic humans (Hoang et al., 3 Jan 2025). This suggests that “world compression” in 3D is not a single metric frontier but a family of different answers to the question of which aspects of a world must remain recoverable.

6. Compression of world-structured fields, graphs, and spherical data

Outside learned world models, world compression also denotes compression of structured scientific representations of the physical world. “A Practical Approach to Spatiotemporal Data Compression” converts 3D time-varying raster fields into browser-playable video streams by quantizing values to 8-bit, slicing each 3D volume into altitude slabs, tiling them into 2D images, packing slices into RGB channels, and then encoding the resulting frame sequence with standard video codecs (Robinson et al., 2016). On a $=6.6386$2 Gb cloud-fraction forecast field, the prototype yields final outputs around $=6.6386$3–$=6.6386$4 MB, summarized as roughly $=6.6386$5 compression, while preserving the salient features needed for interactive visualization (Robinson et al., 2016). The method is explicitly visualization-oriented rather than numerically faithful, and the paper notes that coherence in the third spatial dimension is not natively exploited by the 2D-video codecs (Robinson et al., 2016).

“Data compression on the sphere” addresses another structured regime: scalar data defined on $=6.6386$6, represented in HEALPix. It builds an orthonormal Haar transform on the sphere with scaling functions $=6.6386$7 and wavelets $=6.6386$8, then applies quantization, Huffman coding, and in the lossy case thresholding plus run-length encoding (McEwen et al., 2011). The paper reports that CMB maps can be compressed to approximately $=6.6386$9 of original size with essentially no loss of cosmological information, or to approximately $|C_{U_1}(s)-C_{U_2}(s)|<c,$00 if small cosmological information loss is tolerated; Earth topography and environmental illumination maps reach roughly $|C_{U_1}(s)-C_{U_2}(s)|<c,$01 when a small degradation in quality is allowed (McEwen et al., 2011). Here compression is geometry-aware in the strict sense that the transform matches the native spherical sampling hierarchy rather than flattening the sphere into a planar proxy.

Graph-structured worlds raise a different issue: how much of a graph’s description is structural and how much is label-specific. “Compression and Symmetry of Small-World Graphs and Structures” studies a one-dimensional small-world model with base cycle and distance-decaying shortcut probabilities $|C_{U_1}(s)-C_{U_2}(s)|<c,$02 (Kontoyiannis et al., 2020). It proves that, under $|C_{U_1}(s)-C_{U_2}(s)|<c,$03 and $|C_{U_1}(s)-C_{U_2}(s)|<c,$04, the graphs are asymmetric with high probability, and derives graph entropy

$|C_{U_1}(s)-C_{U_2}(s)|<c,$05

The structural entropy $|C_{U_1}(s)-C_{U_2}(s)|<c,$06 has the same leading asymptotic expansion, which means that forgetting labels does not materially change the dominant coding cost for this small-world model (Kontoyiannis et al., 2020). In this case, world compression is an information-theoretic decomposition of structure, labeling, and automorphism rather than a learned codec.

A concise taxonomy of these regimes is useful:

Domain	Compressed object	Representative mechanism
Scientific laws and causal models	Explanatory program	Kolmogorov complexity, CTM, BDM, AID
Video world models	Long-horizon visual history	Latent token compression with pose-aware retrieval
Autoregressive simulators	Internal world memory	KV-cache pruning, temporal cache compression
Robotics world models	Future latent state	Discrete token prediction in latent space
3D assets and humans	Geometry, semantics, or interfaces	Semantic codes, operational states, predictive geometry coding
Scientific fields and graphs	Structured world data	Sphere-native transforms, 4D-video repacking, entropy of graph structure

This diversity indicates that world compression is best regarded as a unifying question—what minimal state still preserves useful world information?—rather than as a single technical family.

7. Tradeoffs, misconceptions, and open problems

A recurring misconception is that world compression is simply “more aggressive dimensionality reduction.” The evidence repeatedly contradicts this. CaR’s Ours-DS baseline matches token budget only approximately but collapses in revisiting quality, showing that retrievability, not token count alone, is decisive (Peng et al., 22 Jun 2026). WorldKV shows that compression helps because it reallocates storage toward broader historical coverage, not because fewer tokens are inherently better (Yi et al., 21 May 2026). C2LT-3D argues that passive geometry compression can reconstruct surfaces yet still fail as a structural state because ownership and attachment validity are not explicit (Chen et al., 11 May 2026). These works imply that world compression is constrained by task semantics: which information must remain actionable after compression.

A second misconception is that strong compression implies losslessness. Several important systems are intentionally lossy. Semantic 3D compression discards exact geometry in favor of human-centric concept (Dotzel et al., 22 May 2025). CaR explicitly distinguishes its memory representation from conventional lossless video compression and accepts loss of exact fine detail in exchange for future viewpoint-conditioned retrieval (Peng et al., 22 Jun 2026). The 4D-video method preserves salient visual structure rather than exact scientific values (Robinson et al., 2016). Even “lossless” large-model compression assumes a shared, fixed model at both endpoints and leaves compute cost unaccounted for (Li et al., 2024).

A third issue concerns where the compressed information resides. In Squeeze3D, much of the effective information is stored in the pretrained generator, which acts as a shared decompressor prior (Dagli et al., 9 Jun 2025). In LMCompress, the predictive distribution is supplied by very large pretrained models whose storage is not counted in the bitstream (Li et al., 2024). This suggests that some reported compression ratios should be interpreted as payload compression under shared side information rather than as self-contained object descriptions.

The open problems vary by regime but are structurally related. CaR notes limited handling of dynamic objects, continued autoregressive drift, dependence on frame-level camera annotations, and the absence of a full embodied action-conditioned world model (Peng et al., 22 Jun 2026). WorldKV and TempCache remain inference-time remedies that do not solve deeper model mis-specification or highly dynamic scenes (Yi et al., 21 May 2026, Samuel et al., 2 Feb 2026). The 1X compression-track report exposes a persistent teacher-forcing versus autoregressive gap, an underspecified Top-500 CE metric, and a sequence-length ambiguity between a 6-grid task and a transformer sequence length $|C_{U_1}(s)-C_{U_2}(s)|<c,$07 (Mereu et al., 8 Oct 2025). Semantic 3D compression depends on proprietary generative components and sacrifices exact reproducibility (Dotzel et al., 22 May 2025). Zenil’s algorithmic program is limited by the uncomputability of exact Kolmogorov complexity and by the gap between compression and truth (Zenil, 2019).

Taken together, these limitations indicate that world compression is not reducible to a single rate-distortion curve. It is a broader problem of designing compressed states that remain useful for the relevant operations of a world-bearing system: explanation, prediction, retrieval, control, rendering, repair, or scientific inference. Across the literature, the most successful approaches do not merely shrink data; they preserve the specific structure through which the world can be recovered, queried, or acted upon.