{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:10:26Z","timestamp":1778249426129,"version":"3.51.4"},"publisher-location":"Cham","reference-count":70,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253354","type":"print"},{"value":"9783032253361","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-25336-1_8","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:14:37Z","timestamp":1778246077000},"page":"209-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sum-Check Protocol for\u00a0Approximate Computations"],"prefix":"10.1007","author":[{"given":"Dor","family":"Bitan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zachary","family":"DeStefano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shafi","family":"Goldwasser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yael Tauman","family":"Kalai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Thaler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Aaronson, S., Wigderson, A.: Algebrization: a new barrier in complexity theory. In: Dwork, C. (ed.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, 17\u201320 May 2008, pp. 731\u2013740. ACM (2008). https:\/\/doi.org\/10.1145\/1374376.1374481","DOI":"10.1145\/1374376.1374481"},{"key":"8_CR2","unstructured":"Angel, S., Blumberg, A.J., Ioannidis, E., Woods, J.: Efficient representation of numerical optimization problems for SNARKs. In: 31st USENIX Security Symposium (USENIX Security 2022), pp. 4273\u20134290. USENIX Association, Boston, MA (2022)"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Ar, S., Blum, M., Codenotti, B., Gemmell, P.: Checking approximate computations over the reals. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 786\u2013795. Association for Computing Machinery, New York, NY, USA (1993). https:\/\/doi.org\/10.1145\/167088.167288","DOI":"10.1145\/167088.167288"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 14\u201323 (1992). https:\/\/doi.org\/10.1109\/SFCS.1992.267813","DOI":"10.1109\/SFCS.1992.267813"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 2\u201313 (1992). https:\/\/doi.org\/10.1109\/SFCS.1992.267812","DOI":"10.1109\/SFCS.1992.267812"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Arora, V., Bhattacharyya, A., Fleming, N., Kelman, E., Yoshida, Y.: Low degree testing over the reals. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 738\u2013792. SIAM (2023)","DOI":"10.1137\/1.9781611977554.ch31"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Balb\u00e1s, D., Fiore, D., Vasco, M., Robissout, D., Soriente, C.: Modular sumcheck proofs with applications to machine learning and image processing. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 1437\u20131451. CCS 2023 (2023). https:\/\/doi.org\/10.1145\/3576915.3623160","DOI":"10.1145\/3576915.3623160"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-53644-5_2","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-53644-5_2","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) TCC 2016, Part II. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2"},{"key":"8_CR10","unstructured":"Bitan, D., DeStefano, Z., Goldwasser, S., Ishai, Y., Kalai, Y.T., Thaler, J.: Sum-check protocol for approximate computations. Cryptology ePrint Archive, Paper 2025\/2152 (2025). https:\/\/eprint.iacr.org\/2025\/2152"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s00145-024-09520-7","volume":"38","author":"AR Block","year":"2025","unstructured":"Block, A.R., Garreta, A., Tiwari, P.R., Zaj\u0105c, M.: On soundness notions for interactive oracle proofs. J. Cryptol. 38(1), 4 (2025)","journal-title":"J. Cryptol."},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-26954-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"D Boneh","year":"2019","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Zero-knowledge proofs on secret-shared data via fully linear PCPs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 67\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/978-3-030-84242-0_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Bootle","year":"2021","unstructured":"Bootle, J., Chiesa, A., Sotiraki, K.: Sumcheck arguments and their applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 742\u2013773. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_26"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Borwein, P., Erd\u00e9lyi, T.: Polynomials and Polynomial Inequalities. Graduate Texts in Mathematics, vol.\u00a0161. Springer, New York (1995). https:\/\/doi.org\/10.1007\/978-1-4612-0793-1","DOI":"10.1007\/978-1-4612-0793-1"},{"issue":"1","key":"8_CR15","first-page":"211","volume":"201","author":"A Brudnyi","year":"2003","unstructured":"Brudnyi, A.: On local behavior of analytic functions. J. Funct. Anal. 201(1), 211\u2013228 (2003)","journal-title":"J. Funct. Anal."},{"key":"8_CR16","unstructured":"Budzinskiy, S., Fang, W., Zeng, L., Petersen, P.: Numerical error analysis of large language models (2025). https:\/\/arxiv.org\/abs\/2503.10251"},{"key":"8_CR17","unstructured":"Campanelli, M., Hall-Andersen, M.: Fully succinct arguments over the integers from first principles. Cryptology ePrint Archive, Paper 2024\/1548 (2024). https:\/\/eprint.iacr.org\/2024\/1548"},{"key":"8_CR18","unstructured":"Canetti, R., Chen, Y., Holmgren, J., Lombardi, A., Rothblum, G.N., Rothblum, R.D.: Fiat-Shamir from simpler assumptions. Cryptology ePrint Archive, Paper 2018\/1004 (2018). https:\/\/eprint.iacr.org\/2018\/1004"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Canetti, R., et al.: Fiat-Shamir: from practice to theory. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, pp. 1082\u20131090. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3313276.3316380","DOI":"10.1145\/3313276.3316380"},{"key":"8_CR20","unstructured":"Chen, S., Cheon, J.H., Kim, D., Park, D.: Verifiable computing for approximate computation. Cryptology ePrint Archive, Paper 2019\/762 (2019). https:\/\/eprint.iacr.org\/2019\/762"},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Chen, S., Cheon, J.H., Kim, D., Park, D.: Interactive proofs for rounding arithmetic. IEEE Access 10 (2022). https:\/\/doi.org\/10.1109\/ACCESS.2022.3223136","DOI":"10.1109\/ACCESS.2022.3223136"},{"key":"8_CR22","unstructured":"Chiesa, A., Yogev, E.: Building cryptographic proofs from hash functions (2024). snargsbook.org\/,cC BY-SA 4.0"},{"key":"8_CR23","unstructured":"DeStefano, Z., Barrack, D., Dixon, M.: zkQMC: zero-knowledge proofs for (some) probabilistic computations using quasi-randomness. Cryptology ePrint Archive, Paper 2022\/1007 (2022). https:\/\/eprint.iacr.org\/2022\/1007"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Ernstberger, J., Zhang, C., Ciprian, L., Jovanovic, P., Steinhorst, S.: Zero-knowledge location privacy via accurate floating-point SNARKs. In: 2025 IEEE Symposium on Security and Privacy (SP), p. 57. IEEE Computer Society, Los Alamitos, CA, USA (2025). https:\/\/doi.org\/10.1109\/SP61157.2025.00057","DOI":"10.1109\/SP61157.2025.00057"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) Advances in Cryptology \u2013 CRYPTO 1986, pp. 186\u2013194. Springer, Heidelberg (1987)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"8_CR26","series-title":"Trends in Mathematics","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-030-74417-5_12","volume-title":"Extended Abstracts Fall 2019","author":"O Friedland","year":"2021","unstructured":"Friedland, O.: Remez-type inequalities and their applications. In: Abakumov, E., Baranov, A., Borichev, A., Fedorovskiy, K., Ortega-Cerd\u00e0, J. (eds.) Extended Abstracts Fall 2019. TM, vol. 12, pp. 73\u201379. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-74417-5_12"},{"issue":"2","key":"8_CR27","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s003650010020","volume":"17","author":"MI Ganzburg","year":"2001","unstructured":"Ganzburg, M.I.: Polynomial inequalities on measurable sets and their applications. Constr. Approx. 17(2), 275\u2013306 (2001). https:\/\/doi.org\/10.1007\/s003650010020","journal-title":"Constr. Approx."},{"key":"8_CR28","doi-asserted-by":"publisher","unstructured":"Garg, S., Jain, A., Jin, Z., Zhang, Y.: Succinct zero knowledge for floating point computations. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, pp. 1203\u20131216. Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3548606.3560653","DOI":"10.1145\/3548606.3560653"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Garreta, A., Waldner, H., Hristova, K., Dall\u2019Ava, L.: $$\\sf Zinc$$: succinct arguments with small arithmetization overheads from IOPs of proximity to the integers. Cryptology ePrint Archive, Paper 2025\/316 (2025). https:\/\/eprint.iacr.org\/2025\/316","DOI":"10.1007\/978-3-032-01907-3_9"},{"key":"8_CR30","doi-asserted-by":"publisher","unstructured":"Gemmell, P., Lipton, R., Rubinfeld, R., Sudan, M., Wigderson, A.: Self-testing\/correcting for polynomials and for approximate functions. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC 1991, pp. 33\u201342. Association for Computing Machinery, New York, NY, USA (1991). https:\/\/doi.org\/10.1145\/103418.103429","DOI":"10.1145\/103418.103429"},{"key":"8_CR31","unstructured":"Ghodsi, Z., Garg, S., Popa, R.A., Zaharia, M.: Safetynets: verifiable execution of deep neural networks on an untrusted cloud. In: Advances in Neural Information Processing Systems (NeurIPS) (2017)"},{"key":"8_CR32","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 113\u2013122. STOC, Victoria, British Columbia, Canada (2008). https:\/\/doi.org\/10.1145\/2699436","DOI":"10.1145\/2699436"},{"key":"8_CR33","doi-asserted-by":"publisher","unstructured":"He, H., Lab, T.M.: Defeating nondeterminism in LLM inference. Thinking Machines Lab: Connectionism (2025). https:\/\/doi.org\/10.64434\/tml.20250910. https:\/\/thinkingmachines.ai\/blog\/defeating-nondeterminism-in-llm-inference\/","DOI":"10.64434\/tml.20250910"},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Hida, Y., Li, X., Bailey, D.: Algorithms for quad-double precision floating point arithmetic. In: Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001, pp. 155\u2013162 (2001). https:\/\/doi.org\/10.1109\/ARITH.2001.930115","DOI":"10.1109\/ARITH.2001.930115"},{"key":"8_CR35","unstructured":"Holmgren, J.: On round-by-round soundness and state restoration attacks. Cryptology ePrint Archive, Paper 2019\/1261 (2019). https:\/\/eprint.iacr.org\/2019\/1261"},{"key":"8_CR36","doi-asserted-by":"publisher","first-page":"164047","DOI":"10.1109\/ACCESS.2021.3133442","volume":"9","author":"C Ju","year":"2021","unstructured":"Ju, C., Lee, H., Chung, H., Seo, J.H., Kim, S.: Efficient sum-check protocol for convolution. IEEE Access 9, 164047\u2013164059 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3133442","journal-title":"IEEE Access"},{"key":"8_CR37","doi-asserted-by":"publisher","unstructured":"Kang, D., Dao, T., Zaharia, M.: ZKML: an optimizing system for ML inference in zero-knowledge proofs. In: Proceedings of the ACM SIGMOD Conference (2024). https:\/\/doi.org\/10.1145\/3627703.3650088","DOI":"10.1145\/3627703.3650088"},{"key":"8_CR38","doi-asserted-by":"publisher","unstructured":"Kiwi, M., Magniez, F., Santha, M.: Approximate testing with relative error. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, STOC 1999, pp. 51\u201360. Association for Computing Machinery, New York, NY, USA (1999). https:\/\/doi.org\/10.1145\/301250.301269","DOI":"10.1145\/301250.301269"},{"key":"8_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-45878-6_2","volume-title":"Theoretical Aspects of Computer Science","author":"M Kiwi","year":"2002","unstructured":"Kiwi, M., Magniez, F., Santha, M.: Exact and approximate testing\/correcting of algebraic functions: a survey. In: Khosrovshahi, G.B., Shokoufandeh, A., Shokrollahi, A. (eds.) TACSci 2000. LNCS, vol. 2292, pp. 30\u201383. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45878-6_2"},{"issue":"2","key":"8_CR40","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0022-0000(03)00004-7","volume":"66","author":"M Kiwi","year":"2003","unstructured":"Kiwi, M., Magniez, F., Santha, M.: Approximate testing with error relative to input size. J. Comput. Syst. Sci. 66(2), 371\u2013392 (2003). https:\/\/doi.org\/10.1016\/S0022-0000(03)00004-7","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR41","unstructured":"Labs, M.: Scaling intelligence: verifiable decision forest inference with remainder (2024). https:\/\/github.com\/Modulus-Labs\/Papers\/blob\/master\/remainder-paper.pdf"},{"issue":"4","key":"8_CR42","doi-asserted-by":"publisher","first-page":"4254","DOI":"10.1109\/TDSC.2023.3348760","volume":"21","author":"S Lee","year":"2024","unstructured":"Lee, S., Ko, H., Kim, J., Oh, H.: vCNN: verifiable convolutional neural network based on zk-SNARKs. IEEE Trans. Dependable Secure Comput. 21(4), 4254\u20134270 (2024). https:\/\/doi.org\/10.1109\/TDSC.2023.3348760","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"4","key":"8_CR43","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM (JACM) 39(4), 859\u2013868 (1992)","journal-title":"J. ACM (JACM)"},{"key":"8_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-46541-3_25","volume-title":"STACS 2000","author":"F Magniez","year":"2000","unstructured":"Magniez, F.: Multi-linearity self-testing with relative error. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 302\u2013313. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46541-3_25"},{"issue":"1","key":"8_CR45","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/110829660","volume":"42","author":"O Meir","year":"2013","unstructured":"Meir, O.: IP=PSPACE using error-correcting codes. SIAM J. Comput. 42(1), 380\u2013403 (2013)","journal-title":"SIAM J. Comput."},{"key":"8_CR46","doi-asserted-by":"publisher","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constant-round interactive proofs for delegating computation. In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 49\u201362. ACM (2016). https:\/\/doi.org\/10.1145\/2897518.2897652","DOI":"10.1145\/2897518.2897652"},{"key":"8_CR47","unstructured":"Remez, E.Y.: Sur une propri\u00e9t\u00e9 des polyn\u00f4mes de Tchebycheff. Comm. Inst. Sci. Kharkow 13, 93\u201395 (1936), English translation available at https:\/\/history-of-approximation-theory.com\/fpapers\/remeztrans.pdf"},{"key":"8_CR48","doi-asserted-by":"publisher","unstructured":"Richard Shewchuk, J.: Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discret. Comput. Geom. 18(3), 305\u2013363 (1997). https:\/\/doi.org\/10.1007\/PL00009321","DOI":"10.1007\/PL00009321"},{"key":"8_CR49","doi-asserted-by":"publisher","unstructured":"Ron-Zewi, N., Rothblum, R.D.: Proving as fast as computing: succinct arguments with constant prover overhead. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 1353\u20131363. ACM (2022). https:\/\/doi.org\/10.1145\/3519935.3519956","DOI":"10.1145\/3519935.3519956"},{"key":"8_CR50","doi-asserted-by":"publisher","unstructured":"Ron-Zewi, N., Rothblum, R.D.: Local proofs approaching the witness length. J. ACM 71(3), 18:1\u201318:42 (2024). https:\/\/doi.org\/10.1145\/3661483","DOI":"10.1145\/3661483"},{"key":"8_CR51","doi-asserted-by":"publisher","unstructured":"Rubinfeld, R., Ergun, F., Kumar, S.: Approximate checking of polynomials and functional equations. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, p.\u00a0592. IEEE Computer Society, Los Alamitos, CA, USA (1996). https:\/\/doi.org\/10.1109\/SFCS.1996.548518","DOI":"10.1109\/SFCS.1996.548518"},{"key":"8_CR52","unstructured":"Rubinfeld, R.A.: A mathematical theory of self-checking, self-testing and self-correcting programs. Ph.D. thesis, Berkeley, USA (1991), uMI Order No. GAX91-26752"},{"issue":"4","key":"8_CR53","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701\u2013717 (1980). https:\/\/doi.org\/10.1145\/322217.322225","journal-title":"J. ACM"},{"key":"8_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/978-3-030-56877-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"S Setty","year":"2020","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 704\u2013737. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_25"},{"issue":"4","key":"8_CR55","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1145\/146585.146609","volume":"39","author":"A Shamir","year":"1992","unstructured":"Shamir, A.: IP = PSPACE. J. ACM 39(4), 869\u2013877 (1992). https:\/\/doi.org\/10.1145\/146585.146609","journal-title":"J. ACM"},{"key":"8_CR56","doi-asserted-by":"publisher","unstructured":"Singh, N., Dayama, P., Pandit, V.: Zero knowledge proofs towards verifiable decentralized ai pipelines. In: Eyal, I., Garay, J. (eds.) Financial Cryptography and Data Security, pp. 248\u2013275. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_12","DOI":"10.1007\/978-3-031-18283-9_12"},{"key":"8_CR57","doi-asserted-by":"publisher","unstructured":"Slote, J., Volberg, A., Zhang, H.: A dimension-free Remez-type inequality on the polytorus. Discret. Anal. (2025). https:\/\/doi.org\/10.19086\/da.137968","DOI":"10.19086\/da.137968"},{"key":"8_CR58","doi-asserted-by":"publisher","unstructured":"Soria-Vazquez, E.: Doubly efficient interactive proofs over infinite and non-commutative rings. In: Kiltz, E., Vaikuntanathan, V. (eds.) Theory of Cryptography, pp. 497\u2013525. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_18","DOI":"10.1007\/978-3-031-22318-1_18"},{"key":"8_CR59","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3520863","author":"H Sun","year":"2024","unstructured":"Sun, H., Bai, T., Li, J., Zhang, H.: zkDL: efficient zero-knowledge proofs of deep learning training. IEEE Trans. Inf. Forensics Secur. (2024). https:\/\/doi.org\/10.1109\/TIFS.2024.3520863","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"8_CR60","doi-asserted-by":"publisher","unstructured":"Sun, H., Li, J., Zhang, H.: zkLLM: zero knowledge proofs for large language models. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, CCS 2024, pp. 4405\u20134419. Association for Computing Machinery, New York, NY, USA (2024). https:\/\/doi.org\/10.1145\/3658644.3670334","DOI":"10.1145\/3658644.3670334"},{"issue":"2\u20134","key":"8_CR61","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/3300000030","volume":"4","author":"J Thaler","year":"2022","unstructured":"Thaler, J.: Proofs, arguments, and zero-knowledge. Found. Trends Priv. Secur. 4(2\u20134), 117\u2013660 (2022). https:\/\/doi.org\/10.1561\/3300000030","journal-title":"Found. Trends Priv. Secur."},{"key":"8_CR62","unstructured":"Thaler, J.: Sum-check is all you need: an opinionated survey on fast provers in snark design. Cryptology ePrint Archive (2025)"},{"key":"8_CR63","doi-asserted-by":"publisher","unstructured":"Tikhonov, S., Yuditskii, P.: Sharp Remez Inequality. Constr. Approx. 52(2), 233\u2013246 (2019). https:\/\/doi.org\/10.1007\/s00365-019-09473-2","DOI":"10.1007\/s00365-019-09473-2"},{"key":"8_CR64","unstructured":"V\u00e1zquez, A., et\u00a0al.: Doubly-efficient interactive proofs over infinite and non-commutative rings. In: ITCS (2022)"},{"key":"8_CR65","unstructured":"Weng, C., Yang, K., Xie, X., Katz, J., Wang, X.: Mystique: efficient conversions for zero-knowledge proofs with applications to machine learning. In: 30th USENIX Security Symposium (2021)"},{"key":"8_CR66","unstructured":"Yomdin, Y.: Generalized Remez Inequality for $$(s,p)$$-Valent Functions (2011). arxiv.org\/abs\/1102.2580"},{"key":"8_CR67","unstructured":"Zamir, O.: A note on non-composability of layerwise approximate verification for neural inference (2026). https:\/\/arxiv.org\/abs\/2602.15756"},{"key":"8_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73"},{"key":"8_CR69","unstructured":"Zkonduit: Easy Zero-Knowledge Inference (2024). https:\/\/github.com\/zkonduit\/ezkl"},{"key":"8_CR70","unstructured":"ZKProof: Zkproof community reference. version 0.3 (2022). https:\/\/docs.zkproof.org\/pages\/reference\/versions\/ZkpComRef-0-3.pdf"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25336-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:15:01Z","timestamp":1778246101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25336-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253354","9783032253361"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25336-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Justin Thaler is a Research Partner at a16z crypto and is an investor in various blockchain-based platforms, as well as in the crypto ecosystem more broadly (for general a16z disclosures, see\n                      \n                      ).","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosures"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}