  In the last few years there have been rapid developments in SMT solving for
finite fields. These include new decision procedures, new implementations of
SMT theory solvers, and new software verifiers that rely on SMT solving for
finite fields. To support interoperability in this emerging ecosystem, we
propose the SMT-LIB theory of finite field arithmetic (FFA). The theory defines
a canonical representation of finite field elements as well as definitions of
operations and predicates on finite field elements.
