Semantics, Operations, and Properties of P3109 Floating-Point Representations in Lean

Abstract

The upcoming IEEE P3109 standard for low-precision floating-point arithmetic can become the foundation of future machine learning hardware and software. Unlike IEEE-754, P3109 introduces a parametric framework defined by bitwidth, precision, signedness, and domain. This flexibility yields a vast combinatorial space of formats, some with as little as one bit of precision, alongside novel features such as stochastic rounding and saturation arithmetic. These deviations create a unique verification gap that this paper intends to address. This paper presents FLoPS, Formalization in Lean of the P3109 Standard, which is a formal model of P3109 in Lean. Our work serves as a rigorous, machine-checked specification that facilitates deep analysis of the standard. We demonstrate the model’s utility by verifying foundational properties and analyzing key algorithms within the P3109 context. Specifically, we reveal that FastTwoSum exhibits a novel property of computing the exact “overflow error” under saturation using any rounding mode, whereas previously established properties of the ExtractScalar algorithm fail for formats with one bit of precision. We also provide a verified executable bit-level kernel, with refinement proofs for rounding, saturation, projection, and the core arithmetic operations. This work provides a verified foundation for reasoning about P3109 and enables formal verification of future numerical hardware and software. Our Lean development is open source and publicly available.