Finite encodings and reversible composition

This is an explicit finite truth-table construction. Its exponential bound is not a complexity improvement. Retained-history reversibility is consistent with the general principle of reversible computation Bennett.

and promise. The finite source table does not manufacture its own input token. A fixed independent code-only circuit has code output independent of an unencoded matter expectation. For each fixed token the circuit is a valid channel on all matter inputs; its geometric source interpretation is asserted only on the promised class.

storage. Storing five full $B$-bit output tables uses at most $5B{2}^B$ bits, with an additional finite instruction and address reserve. These are classical resources, not free uncharged oracles. No executed table generation or physical compilation is reported.