sfZinc: Succinct Arguments with Small Arithmetization Overheads from IOPs of Proximity to the Integers
Albert Garreta, Hendrik Waldner, Ilia Vlasov, Katerina Hristova, Luca Dall'Ava, Marko Cupic, Matthew Klein
2025Year
3Citations
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.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 520abe5e-f233-40ea-a4fc-3926a5f5aaf5Related papers
- Faster Sounder Succinct Arguments and sfIOPsJustin Holmgren, Ron D. RothblumCRYPTO 2022 · 6 citations
- Succinct Non-interactive Arguments for DistributionsZhengzhong Jin, Mingqi Lu, Bo Peng, Yue YuCRYPTO 2026
- Lattice-Based Succinct Arguments from Vanishing Polynomials - (Extended Abstract)Valerio Cini, Russell W. F. Lai, Giulio MalavoltaCRYPTO 2023 · 38 citations
- Proving as fast as computing: succinct arguments with constant prover overheadNoga Ron-Zewi, Ron D. RothblumSTOC 2022 · 23 citations
- FICS and FACS: Fast IOPPs and Accumulation via Code-SwitchingAnubhav Baweja, Pratyush Mishra, Tushar Mopuri, Matan ShtepelCRYPTO 2026
