{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T17:11:58Z","timestamp":1762362718897,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032004949","type":"print"},{"value":"9783032004956","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:00:00Z","timestamp":1762387200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:00:00Z","timestamp":1762387200000},"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-00495-6_9","type":"book-chapter","created":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T17:07:14Z","timestamp":1762362434000},"page":"162-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Intmax2: A ZK-Rollup with\u00a0Minimal Onchain Data and\u00a0Computation Costs Featuring Decentralized Aggregators"],"prefix":"10.1007","author":[{"given":"Erik","family":"Rybakken","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leona","family":"Hioki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Yaksetig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denisa","family":"Diaconescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franti\u0161ek","family":"Silv\u00e1\u0161i","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Sutherland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,6]]},"reference":[{"key":"9_CR1","unstructured":"Blocks: Block time. Ethereum Development Documentation. https:\/\/ethereum.org\/en\/developers\/docs\/blocks\/#block-time, Accessed 20 July 20 2025"},{"key":"9_CR2","unstructured":"Nethermind formal verification team. https:\/\/www.nethermind.io\/formal-verification"},{"key":"9_CR3","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, Paper 2018\/046 (2018). https:\/\/eprint.iacr.org\/2018\/046"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-030-03329-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Drijvers, M., Neven, G.: Compact multi-signatures for smaller blockchains. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 435\u2013464. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_15"},{"key":"9_CR5","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent snarks from dark compilers. Cryptology ePrint Archive, Paper 2019\/1229 (2019). https:\/\/eprint.iacr.org\/2019\/1229"},{"key":"9_CR6","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, P., Ward, N.: Marlin: Preprocessing zksnarks with universal and updatable srs. Cryptology ePrint Archive, Paper 2019\/1047 (2019). https:\/\/eprint.iacr.org\/2019\/1047"},{"key":"9_CR7","unstructured":"Chiesa, A., Ojha, D., Spooner, N.: Fractal: Post-quantum and transparent recursive proofs from holography. Cryptology ePrint Archive, Paper 2019\/1076 (2019). https:\/\/eprint.iacr.org\/2019\/1076"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-47560-8_13","volume-title":"Secure IT Systems","author":"R Dahlberg","year":"2016","unstructured":"Dahlberg, R., Pulls, T., Peeters, R.: Efficient sparse merkle trees. In: Brumley, B.B., R\u00f6ning, J. (eds.) NordSec 2016. LNCS, vol. 10014, pp. 199\u2013215. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47560-8_13"},{"key":"9_CR9","unstructured":"Dompeldorius, A.: Springrollup. https:\/\/github.com\/adompeldorius\/springrollup (2021), Accessed 20 July 20 2025"},{"key":"9_CR10","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Paper 2019\/953 (2019). https:\/\/eprint.iacr.org\/2019\/953"},{"key":"9_CR11","unstructured":"Garg, S., Goel, A., Jain, A., Policharla, G.V., Sekar, S.: $$\\sf zkSaaS$$: zero-knowledge snarks as a service. Cryptology ePrint Archive, Paper 2023\/905 (2023). https:\/\/eprint.iacr.org\/2023\/905"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 291\u2013304. Association for Computing Machinery, New York (1985). https:\/\/doi.org\/10.1145\/22145.22178","DOI":"10.1145\/22145.22178"},{"key":"9_CR13","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. Cryptology ePrint Archive, Paper 2016\/260 (2016). https:\/\/eprint.iacr.org\/2016\/260"},{"key":"9_CR14","unstructured":"Hioki, L.: Intmax: Trustless and near-zero gas cost token transfer payment system. https:\/\/ethresear.ch\/t\/intmax-trustless-and-near-zero-gas-cost-token-transfer-payment-system\/13904, Accessed: 20 July 2025"},{"key":"9_CR15","unstructured":"Mac\u00a0Lane, S.: Categories for the working mathematician, vol.\u00a05. Springer Science & Business Media (2013)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: Zero-knowledge snarks from linear-size universal and updateable structured reference strings. Cryptology ePrint Archive, Paper 2019\/099 (2019). https:\/\/eprint.iacr.org\/2019\/099","DOI":"10.1145\/3319535.3339817"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-030-79876-5_37","volume-title":"Automated Deduction \u2013 CADE 28","author":"L Moura","year":"2021","unstructured":"Moura, L., Ullrich, S.: The lean 4 theorem prover and programming language. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 625\u2013635. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_37"},{"key":"9_CR18","unstructured":"Nguyen, W., Boneh, D., Setty, S.: Revisiting the nova proof system on a cycle of curves. Cryptology ePrint Archive, Paper 2023\/969 (2023). https:\/\/eprint.iacr.org\/2023\/969"},{"key":"9_CR19","unstructured":"team, B.F.: Plasma prime design proposal. https:\/\/ethresear.ch\/t\/plasma-prime-design-proposal\/4222, Accessed 20 July 2025"},{"key":"9_CR20","unstructured":"(@vbuterin), V.B., (@dankrad), D.F., (@protolambda), D.L., (@asn d6), G.K., (@lightclient), M.G., (@Inphi), M.T., (@adietrichs), A.D.: Eip-4844: Shard blob transactions [draft]. Ethereum Improvement Proposals, no. 4844 (2022). https:\/\/eips.ethereum.org\/EIPS\/eip-4844"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security. FC 2025 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-00495-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T17:07:17Z","timestamp":1762362437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-00495-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,6]]},"ISBN":["9783032004949","9783032004956"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-00495-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,6]]},"assertion":[{"value":"6 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Miyakojima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc25.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}