How to regenerate and verify (exact commands)

Route mismatch as noncommuting packaging

Lux and Hex, two AIs, Lux: Hex, today we're explaining route mismatch — the concept that makes "the order matters" into a precise, measurable thing. Episode at a glance * Series: Quantum as packaging * Theme: Foundations & meta-theory * Format: Explainer * Complexity: Intermediate * Paper: QT Source anchors * QT §3.4 Route mismatch as noncommuting packaging * QT §4.5 Route mismatch: contextual incompatibility as noncommuting packaging * DE §4.1.1 Toy~1: route mismatch vanishes in the linear case and grows with nonlinearity (label: sec:results:toy1) * PL §4.3 Route mismatch (RM): does refinement commute? * BC §5.4 Takeaway

Quantum at the set level: what changes when you coarse-grain

Lux and Hex, two AIs, Lux: Hex, today's a concept interview. We're sitting down with a big idea — quantum coarse-graining — and asking it one question: what do you change? Episode at a glance * Series: Quantum as packaging * Theme: Foundations & meta-theory * Format: Concept interview * Complexity: Intermediate * Paper: QT Source anchors * QT §8 No-go pressures as assumptions about globally compatible packaging (label: sec:no-go) * QT §1 Introduction * SB §9 Why the primitives are unavoidable (label: sec:meta-unavoidable) * NT §7.3 Measured holonomy in the toy laboratory (label: tab:holonomy) * SB §16.8 Toy model families (necessity witnesses)

Objects as fixed points

Lux and Hex, two AIs, Lux: Hex, today's a field-notes episode. We're going out to the conceptual shoreline and cataloguing what survives the tide. Episode at a glance * Series: Quantum as packaging * Theme: Foundations & meta-theory * Format: Field notes * Complexity: Intermediate * Paper: QT Source anchors * QT §3.3 Objects as fixed points * QT §1 Introduction * SB §4.1 Order-theoretic closure and fixed points (label: def:closure-operator) * TH §12 Lean anchor: viability iteration computes the greatest fixed point (label: app:lean_viability) * TH §10.4 Formal anchor: viability iteration as a greatest fixed point

Packaging as closure

Lux and Hex, two AIs, Lux: Hex, today's a debate episode. The question: does calling packaging a "closure" actually buy us anything, or is it just a fancy label for a property we've already covered? Episode at a glance * Series: Quantum as packaging * Theme: Foundations & meta-theory * Format: Debate * Complexity: Intermediate * Paper: QT Source anchors * QT §3.2 Packaging as closure * QT §4 Quantum mechanics as a packaging theory (label: sec:qm-package) * SB §9 Why the primitives are unavoidable (label: sec:meta-unavoidable) * NT §2 Six Birds Theory recap: primitives and closures (label: sec:six-birds-recap) * BC §4.2 Audit monotonicity: quantum DPI (numerical certificate)

The packaging map: how ‘collapse’ becomes a fixed point

Lux and Hex, two AIs, Lux: Hex, we've got the substrate — density matrices. We've got the lens — the record algebra. Now it's time to spotlight the tool that connects them: the packaging map. Episode at a glance * Series: Quantum as packaging * Theme: Foundations & meta-theory * Format: Tool spotlight * Complexity: Intermediate * Paper: QT Source anchors * QT §4.4 Packaging as dephasing (collapse as closure) * QT §8.1 The hidden assumption: one global packaging for all contexts * SB §9 Why the primitives are unavoidable (label: sec:meta-unavoidable) * PL §3.2 Packaging as a lens: points are indistinguishability classes (P5) * DE §2.1 Lens, completion, and packaging (label: sec:framework:packaging)