TorchLean API

FloatLib.Floats.Formats.Posit.Configured.ByteTable.Construction

Certified construction of byte-sized posit tables #

Every posit occupying at most eight encoded bits has at most 256 possible words. These constructors evaluate the proved direct exact-dyadic kernels lazily for every table entry. Warm execution then performs only native indexing and one ByteArray load.

Dense unary and binary tables remain small through eight bits. A dense ternary table has 2 ^ (3 * bits) bytes, so the execution planner may reject FMA when setup or resident memory cannot be amortized.

Lazily generated direct addition table.

The generator is the model-valued direct kernel Model.DirectDyadicArithmetic.add, so the refinement theorem add_eq_spec makes the resulting table a table for Model.Spec.add.

Instances For

    Lazily generated direct subtraction table from the model-valued direct kernel.

    Instances For

      Lazily generated direct multiplication table from the model-valued direct kernel.

      Instances For

        Lazily generated direct division table using one quotient prefix and exact remainder.

        Instances For

          Lazily generated direct square-root table using one root prefix and exact square remainder.

          Instances For

            Lazily generated direct fused-multiply-add table from the model-valued direct kernel.

            Instances For