Two-limb posit rounding runtime #
Posit rounding uses the two-limb execution refinement whenever the exact significand fits in
UInt128. Wider exact intermediates retain the same field-oriented guard/sticky semantics in
the arbitrary-width direct rounder. Selection is by representation capacity rather than named
format, and neither branch uses a candidate certificate or search path.
Semantic refinement laws are in Rounding.Proof.
Round a positive exact dyadic using two limbs when its significand fits.
The outer zero and sign decisions are representation-independent. A significand below 2^128
then stays in two native words through minimum-positive comparison, field packing, guard/sticky
inspection, and nearest-even increment. Only a genuinely wider intermediate crosses to the
arbitrary-width implementation, which applies the same exact rounding semantics.
Instances For
Pack the code selected by two-limb positive rounding.
Instances For
Round any exact dyadic using unique posit zero and whole-word negative symmetry.
Instances For
Return the complete encoding selected by proved two-limb rounding.
The result remains a natural number only at the arithmetic boundary. Configured pair storage
immediately splits it into two UInt64 limbs, avoiding construction of an exact-width Model.