A systems-first reading of looped reasoning: MELT keeps iterative latent compute but swaps growing per-loop KV state for a single gated shared cache per layer. The visual question is not “can it reason?” but “what happens to memory, state reuse, and practical deployment pressure as loops increase?”
Same iterative ambition, different memory bookkeeping. Toggle between the growing Ouro-style stack and the MELT shared-cache rewrite.
The page below is not prose-first. Read the stacked bars as a claim allocation meter: where the contribution appears strongest, inherited, or still under-proven.
Mocked but mechanically faithful: baseline looped KV grows with sequence length × loop count, while MELT stays close to flat after initial cache allocation.
Hover the heatmap. Hot colors mean harder hardware pressure. MELT changes the memory axis more than the compute axis.
Each loop rewrites one persistent memory page through gates. Hover cells to inspect keep / overwrite intensity across layers and steps.
The architecture is only part of the story. Step through chunk-wise training, transition interpolation, and teacher-aligned distillation.
This scatter compresses the episode’s framing: standard decoders, cache-efficient variants, recurrent alternatives, Ouro, and MELT occupy different memory / reasoning trade zones.
The stronger the fill, the more unresolved experimental demand remains before “new reasoning paradigm” becomes a safe conclusion.
Compact source map. arXiv links appear when the episode supplied a direct paper identifier.