Static-byte table and kernel construction #
Lazy certified tables and complete family kernel bundles are constructed from the format-independent tiny-table backend. Proof terms are erased, while the generated tables remain memoized runtime values.
Standard binary-interchange tables #
Lazily generated certified addition table for any static byte descriptor.
Instances For
Lazily generated certified subtraction table for any static byte descriptor.
Instances For
Lazily generated certified multiplication table for any static byte descriptor.
Instances For
Lazily generated certified division table for any static byte descriptor.
Instances For
Lazily generated certified square-root table for any static byte descriptor.
Instances For
Lazily generated certified fused-multiply-add table for any static byte descriptor.
Instances For
Build all six direct kernels from the shared format-independent byte-table backend.
Instances For
Build table-backed arithmetic with a certified model-level fused multiply-add.
For an eight-bit format, the four binary tables contain 4 * 256² byte entries and the square-root
table contains 256. Computing FMA with the supplied model kernel avoids a 256³-entry table.