The tree in H³ the exact chart of the centre, drawn in floats
Segments A and B a BERT-style pair
The pair goes in as [CLS] A [SEP] B [SEP] (B empty: [CLS] A [SEP]). Segment 0 is [CLS], A and the first [SEP]; segment 1 is B and the last [SEP]. Each segment is normalised by NB and split by WordPiece V0 on its own; the specials live in root 5.
One address, three readings L7: the word, the H³ point, the X(5, q) vertex
Select a token above, or click a point in the tree.
Segments A and B, bound by the coupler a binding check only
Engram Mind’s Eye’s coupler (claim E5’s law): each token’s word quaternion w twists both structures, q₁ ← w q₁ and q₂ ← q₂ w̄, and the binding q₂q₁ is checked exactly after every twist. This shows that the two segments’ structures were updated as mirror images in exact arithmetic. It is a binding check only: not a feature, not a security mechanism, and it cannot tell which tokens were in A or B. Integrity is carried by SHA-256 records (the shard panel).