Correctness of packed two-limb Posit sums #
Native decoding, alignment, signed-magnitude accumulation, and rounding implement exact dyadic addition and subtraction. The capacity branch is used only when an aligned intermediate genuinely exceeds two limbs; it shares the same exact semantics.
Converting an exact capacity result back to two limbs preserves its complete code.
The aligned two-limb signed-magnitude kernel rounds the exact common-exponent sum.
The caller handles zero operands before alignment. Same-sign overflow is the only branch whose exact magnitude can require more than 128 bits.
Native exponent alignment and its exact capacity branch round the same dyadic sum.
Packed two-limb addition returns the exact complete Posit code.
Packed two-limb subtraction returns the exact complete Posit code.