A finite window, fully accounted.
Retain the old state. Write each receipt. Export a complete payload at reset. A prepared master clock runs the finite schedule while every consumed donor remains in the joint carrier.
Inspect the complete carrier
Each compute tick uses a fresh state tap and a fresh receipt cell. Each reset exchanges the entire payload with one independent donor. The relative tick returns to zero; the master clock advances to a new episode.
Receipt dictionary and complete encoded target states
Every resource has a destination
Outgoing records occupy the consumed donor blocks. They include the old work and state history; the reset exports their correlations. Memory capacity counts allocated register labels, with no assumed heat or energy conversion.
What the window guarantees
The gate is G(w,h,r)=(h+f(w),w,r+ρ(w)), with modular arithmetic on the declared finite labels. Its inverse recovers the old work from the retained history. Fresh taps give exactly (f(w),w,ρ(w)), even when f is many to one.
After clock wrap, used cells remain used. The projected response can fail although the whole carrier stays reversible. The master clock and donor bank are not replenished by a payload reset. Complete re-preparation would require a fresh matched donor for the whole joint carrier and would export the entire old clock, bank and record history.
The model supplies an ordinal schedule. Laboratory timing, energy operators, detector behavior, native Hodge coupling and acquisition of independent fresh resources require separate evidence. The prior total-factor obstruction remains valid.