Finite byte encodings #
The generic byte-table backend represents a format through a finite encoding bijection. A format contributes only a proved bijection between its exact model and a nonempty set of at most 256 ordinals. No IEEE, Posit, rounding, or exceptional-value policy is built into this layer.
A proved finite encoding of an exact model.
radix_le_byte is the only storage-specific assumption. The inverse laws make table generation
and lookup representation-preserving; no numerical property is required.
- radix : Nat
Number of valid code words.
The encoding is nonempty.
Every code word fits in one byte.
Decode one valid ordinal into the exact model.
Encode one exact model as its unique ordinal.
Decoding after encoding preserves the model.
Encoding after decoding preserves the ordinal.
Instances For
Direct byte carrier for one finite encoding. Its range proof is erased.
Instances For
Convert a direct byte code into the exact model.
Instances For
Pack an exact model into the direct byte carrier.
Instances For
Decoding a directly encoded model value recovers that value.
Encoding a decoded direct byte code recovers that code.