All Episodes

Terminology: theory versus theory object

What this paper adds (Throw)

Operational plan and evidence

Agency (causation inside a layer)

Agenthood versus agency

To Throw a Stone: a pop tour of agenthood

How this paper was built (Plot)

Canonical configuration snapshot (major knobs)

Config format and determinism

Proof anchors: the minimal claims we can mechanize

Six birds, one end-to-end story

Predictions

What we did not claim

Discussion and conclusion: what SBT predicts about space

Knobs that matter (practical guidance)

Sphere holonomy (E2): neighborhood choice can destabilize curvature estimation

Grid (E1): very fine ladders can amplify inter-scale distortion

Representative failure modes ("where it breaks")

Bird-level interpretation

Pythagorean residual as a protocol-composition test

Setup: cost from staged isotropic diffusion

E2: Curvature as protocol residue (holonomy)

Summary of E1—E4

E3: Sierpinski gasket (fractal regime)

E1: Plane-like emergent metric on a grid

Results I: coherent metrics, fractal regimes, and constraint deformation (E1-E4)

Two embeddings, two roles

Computational note

Macro dynamics, cost, and distance

Lens choice and (non-)circularity

Anisotropic gating (constraints as geometry deformation)

Sphere-like substrate (curved regime)

Substrates (microstate generators)

Checklist: a practical geometry birth audit

Connectivity: does the induced metric disconnect?

Information (entropy) versus scale

Inter-scale distortion: does distance persist across refinement?

Prototype stability s_f

Diagnostics: when geometry is coherent (and when it breaks)

Given a lens: what you can (and can't) see

Pseudometric versus metric and separation

Directed versus undirected

Mathematical status: extended (pseudo-)metrics, directed costs, and quotients

Distance is accounting (P6): costs from likelihood

Prototypes as lifts: closure representatives (P1, P5)

Substrate and micro-dynamics

Bird 6 — Audit: Accounting (cost is real)

Bird 4 — Sectors: Staging (multi-scale refinement)

Bird 2 — Gate: Constraints (feasibility)

Six Birds Recap: how the primitives specialize to geometry

What we do (high level)

The Code Map: How the Audits Are Computed

No-Signalling Toy Anchors

Closure Descent to Fixed Points

Holonomy obstruction (no global time)

Reproducibility: regenerating artifacts and paper tables

Bonus material: what's hiding in the appendices?

Limits and scope: what time claims we're not making

What the laboratory demonstrates

Connecting back to time: records are local notches, translation is protocol-dependent

Signalling Boxes vs Constraints: What's a Real Channel?

A Minimal Audit: No-Signalling as the Channel Test

SBT Diagnosis: Feasibility Constraints vs Causal Channels

Why This Matters for Time in SBT

Measured Holonomy in the Toy Laboratory

Theorem (No Global Time from Holonomy — Informal)

The holonomy obstruction (informal theorem)

No global time from protocol holonomy

Tick disappearance and undefined tick failure

Enablement births time: forced theory extension with a no-birth control

Results II: Enablement and Constraints

Clock Viability Is Paid: Budgeted Stabilization and Anti-Stall Progress Metrics

Arrow Audit II: Path-Reversal KL and 'No Fake Arrows'

Results I: Arrows and Clocks

Reproducibility and Auto-Generated Paper Tables

Audit 7: Constraint Boxes vs Signalling Channels

Audit 5: Constraints and Reachability Cones

Audit 4: Enablement as Forced Theory Extension

Audit 2: Path-Reversal KL and No Fake Arrows Under Coarse-Graining

Audit 1: Entropy Production as an Arrow Proxy

Methods: A Finite-State Laboratory and Audit Suite

Claim 4: No Global Time Under Protocol Holonomy

Claim 2: No Fake Arrows Under Coarse-Graining

Claim 1: Arrow-of-Time from Packaging and Accounting

A Diagnostic: Does the Variable Set Change?

Enablement-time (between layers)

Two arrows: causation-time vs enablement-time

Arrow (irreversible bookkeeping)

Ordering: time without clocks

The three ingredients: order, measure, and arrow

Bird 6 — Audit: Accounting

Bird 5 — Package: Packaging

Bird 3 — Protocol: Protocol holonomy

Bird 2 — Gate: Constraints (feasibility carving)

Six Birds Theory recap: primitives and closures

What this paper adds (Notch)

Defect propagation rules (toolkit)

Mode compression from sectorization (P4) and minimality (P5)

Coercivity from feasibility gating (P2)

Summary: slots and divergence consequence

Emergent coercivity template via sector compression

Linear-operator specialization

Abstract packaging maps

Route mismatch defect (abstract)

Defects as quantitative relaxations of exact laws

Appendix E: Toolkit theory—defects

Zeno by vanishing work quantum (WORK fails)

Zeno by fast capacity growth (DIV fails)

Checkable divergence criteria

HL-ROUTE (route mismatch controls gain growth)

HL-CAP-X2 (finite memory / kernel mass)

HL-CAP-X1 (bounded dissipation density)

Hard lemma slots (WORK/CAP/route)

Integrated throughput (ICAP) and feasibility

Storage-based activity and the WORK quantum (Option B)

Setup: frontier and Zeno criterion

Appendix D: Zeno cascades and depth

ECT compression and capacity witnesses

Balanced-atom route (definitions + kernel-mass hinge)

Finite forcing / definability rarity

Graph topology effects of P2 (edge deletion) and P1 (rewrites)

Protocol trap and the "P3 needs P6 drive" correction under autonomy

C.2 Evidence by theme (tests and scripts)

Reproduce it: how to run the experiments

Reproduce it: how to build the project

B.2 File map and key declarations

Appendix B: Lean formalization map

A.2 Python evidence harness (deterministic tests)

A.1 Repository integrity checks (from repo root)

Outlook: forthcoming instantiations

What the theory does and does not claim

Finite forcing count: definability is exponentially rare

Protocol trap: external schedule vs autonomous lifted model

Spotting the Six Birds in the wild (examples)

Constraints Kill Engines

What Six Birds does *not* claim

Downward influence across theories

Mapping to the spine

Definitions of P1—P6

Primitives P1—P6 as closure-changing operations

The "Nothing Stays Constant" Lemma

Almost Nothing Is Definable

Counting lemma: definable predicates are rare

Generic extension and the finite forcing lemma

P3 Loves P6 Law

No Fake Arrows

Data processing: coarse-graining cannot create asymmetry

Drive Is Coordinate-Free

Accounting as coordinates on cycle space

Cycle integrals, exactness, and the null regime

AUT + REV + ACC regime and graph 1-forms

Existence Requires Choosing a Scale

Idempotent endomaps

Idempotent endomaps and induced closures

Closure ladders and saturation

Order-theoretic closure and fixed points

Assumption bundles

Support graphs and discrete 1-forms

A unified theory package viewpoint

Paths, time reversal, and relative entropy

Finite state spaces, distributions, and kernels

Protocol geometry and stochastic pumps

Graph cycles, affinities, and nonequilibrium network structure

Coarse-graining of Markov dynamics and lumpability

Closure operators, reflections, and idempotents

The organizing picture: a three-certificate loop