Probably my favorite CoNGA2022 talk is the first one, A Case for Correctly Rounded Elementary Functions (starts at about 10m), which presents a methodology and library, already implemented into LLVM for floats, of elementary functions (lg, sin, cos, etc etc) that are 1. correctly rounded to the last bit, 2. are faster than the previous algorithms, 3. and can be downcasted to any smaller format while preserving correct rounding.

The posit standard requires correctly rounded elementary functions in order for an implementation to be considered compliant. This means that every standards-compliant posit implementation is now also deterministic.