Abstract

We give a conditional composition theorem for polygonal descriptions of a declared spinless conical spacetime. At a fixed particle packet, explicit realizations produce correlated affine edge-length laws. Incoming slice advance preserves the finite lengths, while outgoing advance changes genuine crease lengths. A separately installed collar module changes subdivision lengths without changing the embedded slice.

Exact parameter clocks, profile-specific guards, separate incidence and source permissions, and complete output obligations define legal schedules. Relative to explicitly stated realization and transport interfaces, every legal schedule returns an accepted five-component affine matching certificate after every command. Geometric commands preserve the installed packet and reference-frame signature; regular source-table replacement installs a complete new realization.

An explicit five-command history performs source replacement at $s=-1/2$, reaches the incoming particle germ, changes the particle link at a frozen deficit, and continues along the outgoing family. Finitely encoded words have reversible implementations on their composite canonical forward domains, with retained input histories, identity action on internal matter, and explicit resource bounds for this history. Independently, prescribed block channels obey an exact backwards-support inclusion, including untouched references.

The source token is supplied under a semantic promise, not acquired or tested. Local obstruction and separation arguments prevent incomplete packet updates, expectation extraction, record–residual identification, schedule–causality identification, and confusion of code decoding with quantum recovery. No mixed incidence–source germ, physical embedding of the schedule, polygon Hamiltonian, spacetime emergence, or holographic identification is constructed.