Efficient SNARK for Floating-Point Computation

Ask about this paper

Ask your agent about it.

Lune has read the top-tier papers around this one, so every answer names the papers it rests on.

Related papers

• Accelerating and verifying constant-time modular inversionDaniel J. Bernstein, Han-Ting Chen, John R. Harrison, Cesare Huang et al.EUROCRYPT 2026 · 1 citation
• xJsnark: A Framework for Efficient Verifiable ComputationAhmed E. Kosba, Charalampos Papamanthou, Elaine ShiS&P 2018 · 121 citations
• Zero-Knowledge RAM: Doubly Efficient and Black-BoxYuval Ishai, Rafail Ostrovsky, Akash ShahEUROCRYPT 2025 · 2 citations
• Polynomial Commitments for Galois Rings and Applications to SNARKs Over $\mathbb {Z}_{2^k}$Yuhao Jia, Songsong Li, Chaoping Xing, Yizhou Yao et al.CRYPTO 2025 · 1 citation
• Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and ExtensionsReo Eriguchi, Kazuma Ohara, Shota Yamada, Koji NuidaCRYPTO 2021 · 5 citations