{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T12:01:40Z","timestamp":1793102500918,"version":"4.5.0"},"publisher-location":"Cham","reference-count":44,"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_10","type":"book-chapter","created":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:00:17Z","timestamp":1786366817000},"page":"267-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Twist and\u00a0Shout: Faster Memory Checking Arguments via\u00a0One-Hot Addressing and\u00a0Increments"],"prefix":"10.1007","author":[{"given":"Srinath","family":"Setty","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Justin","family":"Thaler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,11]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"10_CR2","unstructured":"Waterman, A., Asanovic, K.: The RISC-V instruction set manual (2017). https:\/\/riscv.org\/wp-content\/uploads\/2017\/05\/riscv-spec-v2.2.pdf"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Arun, A., Setty, S., Thaler, J.: Jolt: snarks for virtual machines via lookups. In: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT (2024)","DOI":"10.1007\/978-3-031-58751-1_1"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1490270.1490272","volume":"1","author":"S Aaronson","year":"2009","unstructured":"Aaronson, S., Wigderson, A.: Algebrization: a new barrier in complexity theory. ACM Trans. Comput. Theory (TOCT) 1(1), 1\u201354 (2009)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Chen, J.: Proofs for deep thought: accumulation for large memories and deterministic computations. In International Conference on the Theory and Application of Cryptology and Information Security, pp. 269\u2013301. Springer (2025)","DOI":"10.1007\/978-981-96-0935-2_9"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Brehm, M., Chen, B., Fisch, B., Resch, N., Rothblum, R.D., Zeilberger, H.: Fast SNARKs from interleaved RAA codes. Cryptology ePrint Archive, Blaze (2024)","DOI":"10.1007\/978-3-031-91134-7_5"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Bootle, J., Cerulli, A., Groth, J., Jakobsen, S., Maller, M.: Arya: nearly linear-time zero-knowledge proofs for correct program execution. In: Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT) (2018)","DOI":"10.1007\/978-3-030-03326-2_20"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Blum, M., Evans, W., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), 1991. Journal version in Algorithmica (1994)","DOI":"10.1007\/BF01185212"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: HyperPlonk: plonk with linear-time prover and high-degree custom gates. In: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (2023)","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"10_CR10","unstructured":"Dore, D.: TaSSLE: lasso for the commitment-phobic. Cryptology ePrint Archive (2024)"},{"key":"10_CR11","unstructured":"Diamond, B.E., Posen, J.: Succinct arguments over towers of binary fields. Cryptology ePrint Archive, Paper 2023\/1784 (2023). https:\/\/eprint.iacr.org\/2023\/1784"},{"key":"10_CR12","unstructured":"Benjamin, E., Diamond, J., Posen: polylogarithmic proofs for multilinears over binary towers. Cryptology ePrint Archive (2024)"},{"key":"10_CR13","unstructured":"Dao, Q., Thaler, J.: More optimizations to sum-check proving. Cryptology ePrint Archive. Paper 2024\/1210 (2024)"},{"key":"10_CR14","unstructured":"Eagen, L., Fiore, D., Gabizon, A.: CQ: cached quotients for fast lookups. Cryptology ePrint Archive (2022)"},{"key":"10_CR15","unstructured":"Housni, Y.E., Botrel, G.: EDMSM: multi-scalar-multiplication for SNARKs and faster montgomery multiplication. Cryptology ePrint Archive (2022)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Garreta, A., Manzur, I.: FLI: folding lookup instances. Cryptology ePrint Archive. Paper 2024\/1531 (2024)","DOI":"10.1007\/978-981-96-0935-2_13"},{"key":"10_CR17","unstructured":"Goldberg, L., Papini, S., Riabzev, M.: Cairo-a turing-complete stark-friendly CPU architecture. Cryptology ePrint Archive (2021)"},{"key":"10_CR18","unstructured":"Gruen, A.: Some improvements for the PIOP for zerocheck. Cryptology ePrint Archive (2024)"},{"key":"10_CR19","unstructured":"Gabizon, A., Williamson, Z.J.: Plookup: a simplified polynomial protocol for lookup tables. Cryptology ePrint Archive (2020)"},{"key":"10_CR20","unstructured":"Hab\u00f6ck, U.: Multivariate lookups based on logarithmic derivatives. Cryptology ePrint Archive. Paper 2022\/1530 (2022)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Kothapalli, A., Setty, S.: HyperNova: recursive arguments for customizable constraint systems. In: Annual International Cryptology Conference, pp. 345\u2013379 (2024)","DOI":"10.1007\/978-3-031-68403-6_11"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Kaviani, D., Setty, S.: Vega: low-latency zero-knowledge proofs over existing credentials. Cryptology ePrint Archive. Paper 2025\/2094 (2025)","DOI":"10.1109\/SP63933.2026.00182"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Kohrita, T., Towa, P.: Zeromorph: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments. Cryptology ePrint Archive (2023)","DOI":"10.1007\/s00145-024-09519-0"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Lee, J.: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments. In: Theory of Cryptography Conference, pp. 1\u201334. Springer (2021)","DOI":"10.1007\/978-3-030-90453-1_1"},{"key":"10_CR25","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) (1990)"},{"key":"10_CR26","unstructured":"Lipton, R.J.: Fingerprinting sets. Princeton University, Department of Computer Science (1989)"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Lipton, R.J.: Efficient checking of computations. In: Annual Symposium on Theoretical Aspects of Computer Science, pp. 207\u2013215. Springer (1990)","DOI":"10.1007\/3-540-52282-4_44"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Barreto, P.S.L.M., Schwabe, P.: On compressible pairings and their computation. In: Proceedings of the International Conference on Cryptology in Africa (AFRICACRYPT), pp. 371\u2013388 (2008)","DOI":"10.1007\/978-3-540-68164-9_25"},{"key":"10_CR29","unstructured":"Nair, V., Thaler, J., Zhu, M.: Proving CPU executions in small space. Cryptology ePrint Archive. Paper 2025\/611 (2025)"},{"key":"10_CR30","unstructured":"Papini, S., Hab\u00f6ck, U.: Improving logarithmic derivative lookups using GKR. Cryptology ePrint Archive (2023)"},{"key":"10_CR31","unstructured":"Setty, S., Angel, S., Gupta, T., Lee, J.: Proving the correct execution of concurrent services in zero-knowledge. In: Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI) (2018)"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Proceedings of the International Cryptology Conference (CRYPTO) (2020)","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"10_CR33","unstructured":"Setty, S., Lee, J.: Quarks: quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive, Report 2020\/1275 (2020)"},{"key":"10_CR34","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments. Cryptology ePrint Archive (2023)"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Setty, S., Thaler, J., Wahby, R.: Unlocking the lookup singularity with Lasso. In: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT (2024)","DOI":"10.1007\/978-3-031-58751-1_7"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Thaler, J.: Time-optimal interactive proofs for circuit evaluation. In: Proceedings of the International Cryptology Conference (CRYPTO) (2013)","DOI":"10.1007\/978-3-642-40084-1_5"},{"issue":"2\u20134","key":"10_CR37","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)","journal-title":"Found. Trends Priv. Secur."},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Vu, V., Setty, S., Blumberg, A.J., Walfish, M.: A hybrid architecture for verifiable computation. In: Proceedings of the IEEE Symposium on Security and Privacy (S&P) (2013)","DOI":"10.1109\/SP.2013.48"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient zkSNARKs without trusted setup. In: Proceedings of the IEEE Symposium on Security and Privacy (S&P) (2018)","DOI":"10.1109\/SP.2018.00060"},{"key":"10_CR40","unstructured":"Zapico, A., Buterin, V., Khovratovich, D., Maller, M., Nitulescu, A., Simkin, M.: Lookup arguments in sublinear time. Cryptology ePrint Archive, Caulk (2022)"},{"key":"10_CR41","unstructured":"Zerrell, T.: Using continuations to prove any EVM transaction (2023). https:\/\/risczero.com\/blog\/continuations. Accessed 01 Oct 2025"},{"key":"10_CR42","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Genkin, D., Katz, J., Papadopoulos, D., Papamanthou, C.: vRAM: faster verifiable RAM with program-independent preprocessing. In: Proceedings of the IEEE Symposium on Security and Privacy (S&P) (2018)","DOI":"10.1109\/SP.2018.00013"},{"key":"10_CR43","unstructured":"Zapico, A., Gabizon, A., Khovratovich, D., Maller, M., R\u00e0fols, C.: Nearly optimal lookup arguments. Cryptology ePrint Archive, Baloo (2022)"},{"key":"10_CR44","unstructured":"Zhao, J., Setty, S., Cui, W.: MicroNova: folding-based arguments with efficient (on-chain) verification. Cryptology ePrint Archive. Paper 2024\/2099 (2024)"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:00:23Z","timestamp":1786366823000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35424-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354266","9783032354242"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35424-2_10","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":"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"}}]}}