Correctness of the configured posit value interface #
The public constructors form a lossless equivalence with the exact-width model and every in-range word. Exact decoding and classification preserve the standardized zero and NaR observations, and the common Boolean comparison API agrees with the configured signed-word order.
The common comparison capability reduces to signed-word posit comparison.
This theorem is the public semantic boundary for proofs: clients need not unfold the typeclass instance or depend on its implementation name.
Decoding immediately after packing a posit proof model returns the original model.
Packing immediately after decoding a configured posit returns the original value.
Reconstructing a configured posit from its complete word is lossless.
Reading an in-range complete posit word immediately after constructing it returns that word.
The configured zero code denotes the ordinary rational value zero.
The configured NaR code denotes the common exceptional Not-a-Real observation.
The configured zero code is recognized as zero.
The configured NaR code is recognized as Not-a-Real.
The configured zero code is not Not-a-Real.
The configured NaR code is not the ordinary zero code.
The public optional rational view is absent precisely for the unique NaR value.
Boolean posit equality agrees exactly with equality of configured values.
Boolean posit inequality agrees exactly with inequality of configured values.
Boolean posit less-than agrees with the standard signed-word order.
Boolean posit less-than-or-equal agrees with the standard signed-word order.
Boolean posit greater-than agrees with the standard signed-word order.
Boolean posit greater-than-or-equal agrees with the standard signed-word order.