{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T12:01:41Z","timestamp":1793102501165,"version":"4.5.0"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032354266","type":"print"},{"value":"9783032354242","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-35424-2_18","type":"book-chapter","created":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T12:59:41Z","timestamp":1786366781000},"page":"524-556","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["NeutronNova: Group-Based Folding Done Right"],"prefix":"10.1007","author":[{"given":"Abhiram","family":"Kothapalli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srinath","family":"Setty","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,11]]},"reference":[{"key":"18_CR1","unstructured":"Nova: Recursive SNARKs without trusted setup. https:\/\/github.com\/Microsoft\/Nova"},{"key":"18_CR2","unstructured":"Ova: A slightly better Nova. https:\/\/hackmd.io\/V4838nnlRKal9ZiTHiGYzw"},{"key":"18_CR3","unstructured":"sonobe. https:\/\/github.com\/privacy-scaling-explorations\/sonobe\/"},{"key":"18_CR4","unstructured":"The Nexus zkVM (2024). https:\/\/github.com\/nexus-xyz\/nexus-zkvm"},{"key":"18_CR5","unstructured":"Hobbit: Space-efficient zkSNARK with optimal prover time. Cryptology ePrint Archive (2025)"},{"key":"18_CR6","unstructured":"Arun, A., Setty, S.: Nebula: efficient read-write memory and switchboard circuits for folding schemes. Cryptology ePrint Archive (2024)"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Arun, A., Setty, S., Thaler, J.: Jolt: SNARKs for VMs via lookups. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14656, pp. 3\u201333. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_1","DOI":"10.1007\/978-3-031-58751-1_1"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Comput. Complex. 2(4) (1992)","DOI":"10.1007\/BF01200430"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: STOC (1991)","DOI":"10.1145\/103418.103428"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-26954-8_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable zero knowledge with no trusted setup. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 701\u2013732. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_23"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-662-44381-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"E Ben-Sasson","year":"2014","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 276\u2013294. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_16"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKs and proof-carrying data. In: STOC (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"18_CR13","unstructured":"Blum, M., Evans, W., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. In: FOCS (1991)"},{"key":"18_CR14","unstructured":"Blumberg, A.J., Thaler, J., Vu, V., Walfish, M.: Verifiable computation using multiple provers. ePrint Report 2014\/846 (2014)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Boneh, D., Chen, B.: LatticeFold: a lattice-based folding scheme and its applications to succinct proof systems. Cryptology ePrint Archive. Paper 2024\/257 (2024)","DOI":"10.1007\/978-981-95-5099-9_11"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Boneh, D., Chen, B.: LatticeFold+: faster, simpler, shorter lattice-based folding for succinct proof systems. Cryptology ePrint Archive, Paper 2025\/247 (2025)","DOI":"10.1007\/978-3-032-01907-3_11"},{"key":"18_CR17","unstructured":"Bowe, S., Grigg, J., Hopwood, D.: Halo: recursive proof composition without a trusted setup. Cryptology ePrint Archive, Report 2019\/1021 (2019)"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Chen, B.: Protostar: generic efficient accumulation\/folding for special sound protocols. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14439, pp. 77\u2013110. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8724-5_3","DOI":"10.1007\/978-981-99-8724-5_3"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Chen, J.: Proofs for deep thought: accumulation for large memories and deterministic computations. In: Chung, KM., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15488, pp. 269\u2013301. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-0935-2_9","DOI":"10.1007\/978-981-96-0935-2_9"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-030-84242-0_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"B B\u00fcnz","year":"2021","unstructured":"B\u00fcnz, B., Chiesa, A., Lin, W., Mishra, P., Spooner, N.: Proof-carrying data without succinct arguments. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 681\u2013710. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_24"},{"key":"18_CR21","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Proof-carrying data from accumulation schemes. In: TCC (2020)"},{"key":"18_CR22","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Accumulation without homomorphism. In: ITCS (2024)"},{"key":"18_CR23","doi-asserted-by":"publisher","unstructured":"Bunz, B., Mishra, P., Nguyen, W., Wang, W.: Arc: accumulation for reed-solomon codes. In: Tauman Kalai, Y., Kamara, S.F. (eds.) CRYPTO 2025. LNCS, vol. 16006, pp. 128\u2013160. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01907-3_5","DOI":"10.1007\/978-3-032-01907-3_5"},{"key":"18_CR24","unstructured":"Buterin, V.: On-chain scaling to potentially \u00a0500 TX\/SEC through mass TX validation (2018). https:\/\/ethresear.ch\/t\/on-chain-scaling-to-potentially-500-tx-sec-through-mass-tx-validation\/3477"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: HyperPlonk: plonk with linear-time prover and high-degree custom gates. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14005, pp. 499\u2013530. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"18_CR26","unstructured":"Chiesa, A., Forbes, M.A., Spooner, N.: A zero knowledge sumcheck and its applications. CoRR abs\/1704.02086 (2017)"},{"key":"18_CR27","unstructured":"Daix-Moreux, P., Zhang, C.: PlasmaFold: an efficient and scalable layer 2 with client-side proving. Cryptology ePrint Archive, Paper 2025\/1300 (2025). https:\/\/eprint.iacr.org\/2025\/1300"},{"key":"18_CR28","unstructured":"Dao, Q., Thaler, J.: More optimizations to sum-check proving. Cryptology ePrint Archive, Paper 2024\/1210 (2024)"},{"key":"18_CR29","unstructured":"Diamond, B.E., Posen, J.: Succinct arguments over towers of binary fields. Cryptology ePrint Archive, Paper 2023\/1784 (2023)"},{"key":"18_CR30","unstructured":"Dimitriou, N., Garreta, A., Manzur, I., Vlasov, I.: Mova: nova folding without committing to error terms. Cryptology ePrint Archive, Paper 2024\/1220 (2024)"},{"key":"18_CR31","unstructured":"Eagen, L., Gabizon, A.: Protogalaxy: efficient ProtoStar-style folding of multiple instances. Cryptology ePrint Archive, Paper 2023\/1106 (2023)"},{"key":"18_CR32","unstructured":"Eagen, L., Gabizon, A., Sefranek, M., Towa, P., Williamson, Z.J.: StackProofs: private proofs of stack and contract execution using protogalaxy. Cryptology ePrint Archive, Paper 2024\/1281 (2024)"},{"key":"18_CR33","unstructured":"Gabizon, A., Williamson, Z.J.: plookup: a simplified polynomial protocol for lookup tables. Cryptology ePrint Archive (2020)"},{"key":"18_CR34","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: Plonk: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive (2019)"},{"key":"18_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"R Gennaro","year":"2013","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 626\u2013645. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37"},{"key":"18_CR36","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: STOC (2008)","DOI":"10.1145\/1374376.1374396"},{"key":"18_CR37","doi-asserted-by":"publisher","unstructured":"Golovnev, A., Lee, J., Setty, S., Thaler, J., Wahby, R.: Brakedown: linear-time and field-agnostic SNARKs for R1CS. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14082, pp. 193\u2013226. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"18_CR38","unstructured":"Gruen, A.: Some improvements for the PIOP for ZeroCheck. Cryptology ePrint Archive, Paper 2024\/108 (2024)"},{"key":"18_CR39","unstructured":"Hab\u00f6ck, U.: Multivariate lookups based on logarithmic derivatives. Cryptology ePrint Archive, Paper 2022\/1530 (2022)"},{"key":"18_CR40","doi-asserted-by":"crossref","unstructured":"Kaviani, D., Setty, S.: Vega: low-latency zero-knowledge proofs over existing credentials. Cryptology ePrint Archive (2025). https:\/\/eprint.iacr.org\/2025\/2094","DOI":"10.1109\/SP63933.2026.00182"},{"key":"18_CR41","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Parno, B.: Algebraic reductions of knowledge. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14084, pp. 669\u2013701. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_21","DOI":"10.1007\/978-3-031-38551-3_21"},{"key":"18_CR42","unstructured":"Kothapalli, A., Setty, S.: SuperNova: Proving universal machine executions without universal circuits. Cryptology ePrint Archive (2022)"},{"key":"18_CR43","unstructured":"Kothapalli, A., Setty, S.: Cyclefold: folding-scheme-based recursive arguments over a cycle of elliptic curves. Cryptology ePrint Archive, Paper 2023\/1192 (2023). https:\/\/eprint.iacr.org\/2023\/1192"},{"key":"18_CR44","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S.: HyperNova: recursive arguments for customizable constraint systems. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14929, pp, 345\u2013379. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_11","DOI":"10.1007\/978-3-031-68403-6_11"},{"key":"18_CR45","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S., Tzialla, I.: Nova: recursive zero-knowledge arguments from folding schemes. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13510, pp. 359\u2013388. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"18_CR46","doi-asserted-by":"crossref","unstructured":"Lee, J., Nikitin, K., Setty, S.: Replicated state machines without replicated execution. In: S&P (2020)","DOI":"10.1109\/SP40000.2020.00068"},{"key":"18_CR47","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. In: FOCS (1990)"},{"key":"18_CR48","unstructured":"Nguyen, W., Setty, S.: Neo: lattice-based folding scheme for CCS over small fields and pay-per-bit commitments. Cryptology ePrint Archive, Paper 2025\/294 (2025). https:\/\/eprint.iacr.org\/2025\/294"},{"key":"18_CR49","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"},{"key":"18_CR50","unstructured":"Setty, S., Angel, S., Gupta, T., Lee, J.: Proving the correct execution of concurrent services in zero-knowledge. In: OSDI (2018)"},{"key":"18_CR51","unstructured":"Setty, S., Lee, J.: Quarks: quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive, Report 2020\/1275 (2020)"},{"key":"18_CR52","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments. Cryptology ePrint Archive (2023)"},{"key":"18_CR53","doi-asserted-by":"publisher","unstructured":"Setty, S., Thaler, J., Wahby, R.: Unlocking the lookup singularity with Lasso. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14656, pp. 180\u2013209. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_7","DOI":"10.1007\/978-3-031-58751-1_7"},{"issue":"4","key":"18_CR54","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)","journal-title":"J. ACM"},{"key":"18_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-40084-1_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J Thaler","year":"2013","unstructured":"Thaler, J.: Time-optimal interactive proofs for circuit evaluation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 71\u201389. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_5"},{"key":"18_CR56","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: TCC, pp. 552\u2013576 (2008)"},{"key":"18_CR57","unstructured":"Wei, Y., et al.: Packed sumcheck over fields of small characteristic with application to verifiable FHE. Cryptology ePrint Archive (2025). https:\/\/eprint.iacr.org\/2025\/719"},{"key":"18_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-030-26954-8_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"T Xie","year":"2019","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: succinct zero-knowledge proofs with optimal prover computation. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 733\u2013764. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24"},{"key":"18_CR59","doi-asserted-by":"crossref","unstructured":"Zhao, J., Setty, S., Cui, W., Zaverucha, G.: MicroNova: folding-based arguments with efficient (on-chain) verification. In: S&P (2025)","DOI":"10.1109\/SP61157.2025.00168"},{"key":"18_CR60","unstructured":"Zhou, Z., Zhang, Z., Dong, J.: Proof-carrying data from multi-folding schemes. Cryptology ePrint Archive, Paper 2023\/1282 (2023)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35424-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T12:59:47Z","timestamp":1786366787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35424-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354266","9783032354242"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35424-2_18","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":"11 August 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}