FPTalks on July 2: Tung-Che Chang (Rutgers)

19 views
Skip to first unread message

Pavel Panchekha

unread,
Jun 29, 2026, 11:07:06 PMJun 29
to fpb...@fpbench.org
Hello all!

The next FPTalks Seminar is Thursday, July 2 from 9–10am Pacific Time on Zoom:
https://washington.zoom.us/j/99708186928?pwd=HbhpebAtCWvoP4VQahYb8G1QpQnTgm.1

I'm super excited for Tung-Che to talk about the semantics, operations, and properties of P3109 in Lean:

The upcoming IEEE-P3109 standard for low-precision floating-point arithmetic can become the foundation of future machine learning hardware and software. Unlike the fixed types of IEEE-754, P3109 introduces a parametric framework defined by bitwidth, precision, signedness, and domain. This flexibility results in 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 comprehensive 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 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. This work provides a verified foundation for reasoning about P3109 and enables formal verification of future numerical software. Our Lean development is open source and publicly available.

Also, we are getting reading for our annual workshop. Please register for the event or even submit a talk. We're excited to see you all there.

—Pavel Panchekha
Reply all
Reply to author
Forward
0 new messages