{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:17:38Z","timestamp":1783009058929,"version":"3.54.5"},"reference-count":56,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,18]]},"DOI":"10.1109\/sp63933.2026.00099","type":"proceedings-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T19:34:20Z","timestamp":1782934460000},"page":"3223-3242","source":"Crossref","is-referenced-by-count":1,"title":["Nebula: Proving Machine Executions via Folding Schemes"],"prefix":"10.1109","author":[{"given":"Arasu","family":"Arun","sequence":"first","affiliation":[{"name":"New York University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srinath","family":"Setty","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"A secure decentralised generalised transaction ledger"},{"key":"ref2","volume-title":"Recursive SNARKs without trusted setup"},{"key":"ref3","volume-title":"Contracts for secure blockchain applications"},{"key":"ref4","volume-title":"A slightly better Nova"},{"key":"ref5","volume-title":"sonobe"},{"key":"ref6","volume-title":"The Nexus zkVM","year":"2024"},{"key":"ref7","volume-title":"Ethereum statistics and data - alchemy","year":"2023"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064030"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58751-1_1"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516734"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185352"},{"key":"ref14","article-title":"LatticeFold+: Faster, simpler, shorter latticebased folding for succinct proof systems","author":"Boneh","year":"2025","journal-title":"Cryptology ePrint Archive, Paper 2025\/247"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522733"},{"key":"ref16","volume-title":"the RISC Zero Team: RISC Zero zkVM: Scalable, transparent arguments of RISC-V integrity","author":"Bruestle","year":"2023"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8724-5_3"},{"key":"ref18","volume-title":"The dawn of hybrid layer 2 protocols","author":"Buterin","year":"2019"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-96-0935-2_9"},{"key":"ref20","volume-title":"Accumulation without homomorphism. Cryptology ePrint Archive, Paper 2024\/474","author":"B\u00fcnz","year":"2024"},{"key":"ref21","volume-title":"Announcing zeth: The first type zero zkevm","author":"Carstens","year":"2023"},{"key":"ref22","first-page":"314","volume-title":"Sublonk: Sublinear prover plonk. Proc. Priv. Enhancing Technol.","author":"Choudhuri","year":"2024"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-40061-5_12"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.23"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-96-0935-2_8"},{"key":"ref26","article-title":"Mova: Nova folding without committing to error terms","author":"Dimitriou","year":"2024","journal-title":"Cryptology ePrint Archive, Paper 2024\/1220"},{"key":"ref27","article-title":"ProtoGalaxy: Efficient ProtoStar-style folding of multiple instances","author":"Eagen","year":"2023","journal-title":"Cryptology ePrint Archive, Paper 2023\/1106"},{"key":"ref28","article-title":"Stackproofs: Private proofs of stack and contract execution using Protogalaxy","author":"Eagen","year":"2024","journal-title":"Cryptology ePrint Archive, Paper 2024\/1281"},{"key":"ref29","first-page":"186","article-title":"How to prove yourself: Practical solutions to identification and signature problems","volume-title":"Proceedings of the International Cryptology Conference (CRYPTO)","author":"Fiat","year":"1986"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"ref33","article-title":"SuperNova: Proving universal machine executions without universal circuits","author":"Kothapalli","year":"2022","journal-title":"Cryptology ePrint Archive, Report 2022\/1758"},{"key":"ref34","article-title":"CycleFold: Folding-scheme-based recursive arguments over a cycle of elliptic curves","author":"Kothapalli","year":"2023","journal-title":"Cryptology ePrint Archive, Report 2023\/1192"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_11"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675439"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00068"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48184-2_32"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_10"},{"key":"ref41","article-title":"Neo: Lattice-based folding scheme for CCS over small fields and pay-per-bit commitments","author":"Nguyen","year":"2025","journal-title":"Cryptology ePrint Archive, Paper 2025\/294"},{"key":"ref42","article-title":"Non-interactive and information-theoretic secure verifiable secret sharing","volume-title":"Proceedings of the International Cryptology Conference (CRYPTO)","author":"Pedersen","year":"1991"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"ref44","article-title":"Proving the correct execution of concurrent services in zero-knowledge","volume-title":"Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Setty"},{"key":"ref45","volume-title":"Proving the correct execution of concurrent services in zero-knowledge (extended version). ePrint Report 2018\/907","author":"Setty","year":"2018"},{"key":"ref46","article-title":"Quarks: Quadruple-efficient transparent zkSNARKs","volume-title":"Cryptology ePrint Archive, Report 2020\/1275","author":"Setty","year":"2020"},{"key":"ref47","article-title":"Twist and shout: Faster memory checking arguments via one-hot addressing and increments","author":"Setty","year":"2025","journal-title":"Cryptology ePrint Archive, Paper 2025\/105"},{"key":"ref48","article-title":"Customizable constraint systems for succinct arguments","author":"Setty","year":"2023","journal-title":"Cryptology ePrint Archive"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58751-1_7"},{"key":"ref50","volume-title":"Taking proof-based verified computation a few steps closer to practicality (extended version)","author":"Setty","year":"2012"},{"key":"ref51","article-title":"Taking proof-based verified computation a few steps closer to practicality","volume-title":"Proceedings of the USENIX Security Symposium","author":"Setty"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_1"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23097"},{"key":"ref55","volume-title":"Roll_up \/ roll_back snark side chain sim 17000 tps","author":"White","year":"2018"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00013"}],"event":{"name":"2026 IEEE Symposium on Security and Privacy (SP)","location":"San Francisco, CA, USA","start":{"date-parts":[[2026,5,18]]},"end":{"date-parts":[[2026,5,21]]}},"container-title":["2026 IEEE Symposium on Security and Privacy (SP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11573355\/11573356\/11573535.pdf?arnumber=11573535","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:27:58Z","timestamp":1782970078000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11573535\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":56,"URL":"https:\/\/doi.org\/10.1109\/sp63933.2026.00099","relation":{},"subject":[],"published":{"date-parts":[[2026,5,18]]}}}