Native indexing for exhaustive byte tables #
The index proof shows that row-major USize arithmetic neither wraps nor leaves a generated
table. The only size bound is encoding.radix ≤ 256; the radix need not be a power of two or
come from a floating-point layout.
The executable formulas remain direct native arithmetic and all bounds erase after compilation. Table lookup therefore has no runtime certificate check, while generation and dispatch can rely on the proved index envelope.
Native row-major index for two byte-backed operands.
Instances For
Native index for a unary byte table.
Instances For
Native row-major index for three byte-backed operands.
Instances For
The native unary-table index preserves the byte's natural value.
A non-wrapping native ternary index agrees with its natural-number expression.
Every intermediate of a three-input byte-table index fits a platform word.
Native-word representation of an at-most-256-code encoding's radix.
Instances For
Valid input bytes select an in-bounds binary table entry.
Valid input bytes select an in-bounds unary table entry.
Valid input bytes select an in-bounds ternary table entry.