Correctness of native two-word finite multiplication #
The executable 64 x 64 -> 128 normal-product tier lives in TwoWordMul.Runtime. Its refinement
theorem identifies every successful native result with the exact format-generic product rounder.
The proof separates the two-word product and its leading-bit bounds from the shared one-word
carry and packing stage. Declined inputs remain the dispatcher's responsibility.
Binary64 is the standard specialization of the reusable two-word capacity tier.
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 for one-storage-word IEEE formats with precisions 33
through 62. Exceptional operands and boundary results return none and retain the generic path.