Correctness of configured posit backends #
Every configured backend is proved equal to the independent exact operation in
Configured.Spec. The proofs cover the representation-independent exact-dyadic and two-limb
kernels as well as the direct packed-storage entry points.
Representation-independent backends #
Exact-dyadic addition refines configured posit addition.
Exact-dyadic subtraction refines configured posit subtraction.
Exact-dyadic multiplication refines configured posit multiplication.
Rational-free dyadic division refines configured posit division.
Rational-free dyadic square root refines configured posit square root.
Exact-dyadic fused multiply-add refines configured posit FMA.
Two-limb-rounded addition refines configured posit addition.
Two-limb-rounded subtraction refines configured posit subtraction.
Two-limb-rounded multiplication refines configured posit multiplication.
Two-limb-rounded fused multiply-add refines configured posit FMA.
Direct native-word storage #
Direct packed-storage addition refines configured posit addition.
Direct packed-storage subtraction refines configured posit subtraction.
Direct packed-storage multiplication refines configured posit multiplication.
Direct packed-storage division refines configured posit division.
Direct packed-storage square root refines configured posit square root.
Direct packed-storage FMA refines configured posit FMA.
Direct two-limb storage #
Direct two-limb packed addition refines configured posit addition.
Direct two-limb packed subtraction refines configured posit subtraction.
Direct two-limb packed multiplication refines configured posit multiplication.
Direct pair decoding followed by the shared quotient-prefix kernel refines configured division.
Direct two-limb packed square root refines configured posit square root.
Direct two-limb packed FMA refines configured posit FMA.