Manuscript VIII-B@3 · VIII-B-v3.tex · section · 3aa6baa1

Canonical blocks and reports

A finite algebraic table and reversible realization › Canonical blocks and reports · lines 1885–1960

VIII-B@3#tab:block-bits

Back to manuscript

The cell dictionary in Appendix app:coding has 55 entries, so six location bits suffice. At the source boundary, only valid incoming labels are admitted.

Fix integers

The clock stores . A source input has the exact integer

representing . No event decision is inferred from a rounded length report.

For each of the 24 finite slots, store

inactive slots have report zero. All finite lengths are less than 16. Indeed, compact endpoint spatial norms are at most 4:

The developed spatial distance between two endpoints is at most 8, and a spacelike edge's induced length is no larger than its spatial length. Hence report bits suffice.

Field in one geometric blockBits
Source-step stage
Incidence mode
Source permission
Exact signed clock
Current packet index
Source token
Fixed metadata
24 edge reports
Total

metadata consists of five fixed one-bit identifiers and one six-bit particle-cell label.

Fix injective encodings of into the index fields and of into the clock field. The stated widths suffice. All admitted metadata values are fixed.

A canonical geometric input has stage 0, incoming incidence mode, the exact source clock, indices , permission , fixed metadata, and the canonical reports for .

A second -bit block stores complete geometric input history. Each original matter name has six location bits and six name-history bits, reserved separately.

The decoder reconstructs the entire family from its packet index, clock, and fixed symbolic formulas. Reports are consistency data; they are not the underlying exact geometry. The decoder ignores implementation history and returns the matter state unchanged.

Displayed formulas in this passage

  • unlabeled · line 1892

  • unlabeled · line 1897

  • unlabeled · line 1904

  • unlabeled · line 1910