Does the source realize the programme?
The prepared RSP recurrence is complete. An exact native realization needs a decoder that follows its whole state through every step. This audit identifies which contracts fail and which finite-window routes remain open.
Three matching edges. One failed wrap.
The exact filled-tetrahedron active plane cycles through v, u, −v, −u with squared norm 2. A prepared lookup encodes a single-token RSP trace. Inspect where the desired successor and decoded native successor diverge.
Keep the assumptions visible
The finite-image theorem needs a total decoder on a surjective source domain. The recurrent-orbit theorem instead needs stability of the complete decoded state. An exact-zero positivity gate can fail that stability. Irrational glued frequencies remove an exact common period while retaining approximate returns.
Norm conservation only blocks stock when stock is specifically identified with that conserved total. Local readouts can vary. Integer tokens have no proved identification with chain support, energy or action.
The next route is a declared finite-window joint carrier that accounts for decoder, clock, memory, outgoing records and reset supply. Permanent exact absorbing behavior is not supplied by a finite closed environment.
New: construct the finite-window joint carrier and count its resources →