2026
Spain: Succinct proofs for numerical computations
The starting insight of Spain is that since numerical computations inherently have approximation error, the constraint formalism should likewise allow for approximate satisfiability, and this paper introduces a new proof protocol and new ways to translate computations to constraints.
Zachary DeStefano, N. Golub, Zile Huang et al.
· IACR Cryptology ePrint Archi... · 0 citations