Correctness of direct posit quotient packing #
The executable quotient path generates one destination-width normalized quotient prefix, jams the exact Euclidean remainder into its sticky bit, and feeds that stream to the shared direct Posit packer. This module proves that the result is the rounding of the exact rational quotient, with NaR for division by zero. The proof applies at every format width.
The shared direct dyadic packer rounds a normalized quotient prefix exactly as the unmaterialized rational quotient fraction.
Direct positive quotient rounding refines exact rational division.
Direct positive quotient rounding always selects a finite nonnegative code.
Direct positive quotient packing refines exact positive rational rounding.
Direct signed quotient rounding refines exact rational division.
The direct quotient kernel and the general exact quotient rounder choose the same result.
Only their positive-magnitude kernels differ, and both are certified against the same rational rounding specification.
Code-valued boundary #
The code-valued quotient is the encoding of the model-valued quotient.
Every quotient code fits the configured posit word.
Re-encoding the quotient code recovers the model-valued quotient.