Correctness of native two-word finite multiplication #
Every accepted result of the 64 x 64 -> 128 normal-product tier in TwoWordMul.Runtime is the
exact format-generic product rounding. The proof separates the two-word product and its leading-bit
bounds from the shared one-word carry and packing stage. The dispatcher handles declined inputs.
Binary64 satisfies the two-word capacity contract.
A successful two-word normal-product round agrees with the exact finite-product rounder.
A successful two-word normal multiplication agrees with the compact finite kernel.
The native tier handles normal operands of one-storage-word IEEE formats with fraction widths 32
through 62. Zero, subnormal and exceptional operands and boundary results return none and take
the generic path.
Storage-word entry points #
On storage words below the radix, mulNormal? is the ofWord image of mulNormalWord?.