{"id":1193441,"date":"2026-11-04T16:55:14","date_gmt":"2026-11-04T23:55:14","guid":{"rendered":"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/?post_type=msr-project&#038;p=1193441"},"modified":"2026-11-06T16:28:06","modified_gmt":"2026-11-06T23:28:06","slug":"proof-based-general-purpose-computing","status":"publish","type":"msr-project","link":"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/project\/proof-based-general-purpose-computing\/","title":{"rendered":"Proof-based general-purpose computing"},"content":{"rendered":"<section class=\"mb-3 moray-highlight\">\n\t<div class=\"card-img-overlay mx-lg-0\">\n\t\t<div class=\"card-background  has-background- card-background--full-bleed\">\n\t\t\t<img loading=\"lazy\" decoding=\"async\" width=\"2560\" height=\"1441\" src=\"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-scaled.png\" class=\"attachment-full size-full\" alt=\"diagram\" style=\"\" srcset=\"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-scaled.png 2560w, https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-300x169.png 300w, https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-1024x576.png 1024w, https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-768x432.png 768w, https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-1536x865.png 1536w, https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-2048x1153.png 2048w, https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-1066x600.png 1066w, https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-655x368.png 655w, https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-240x135.png 240w, https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-640x360.png 640w, https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-960x540.png 960w, https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-1280x720.png 1280w, https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-content\/uploads\/2026\/11\/ProofBasedComputing-hero-1920x1080.png 1920w\" sizes=\"auto, (max-width: 2560px) 100vw, 2560px\" \/>\t\t<\/div>\n\t\t<!-- Foreground -->\n\t\t<div class=\"card-foreground d-flex mt-md-n5 my-lg-5 px-g px-lg-0\">\n\t\t\t<!-- Container -->\n\t\t\t<div class=\"container d-flex mt-md-n5 my-lg-5 \">\n\t\t\t\t<!-- Card wrapper -->\n\t\t\t\t<div class=\"w-100 w-lg-col-5\">\n\t\t\t\t\t<!-- Card -->\n\t\t\t\t\t<div class=\"card material-md-card py-5 px-md-5\">\n\t\t\t\t\t\t<div class=\"card-body \">\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\n<h1 id=\"proof-based-general-purpose-computing\" class=\"wp-block-heading\">Proof-based general-purpose computing<\/h1>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/div>\n\t<\/div>\n<\/section>\n\n\n\n<div class=\"wp-block-group is-layout-constrained wp-block-group-is-layout-constrained\">\n\n\n<p class=\"wp-block-paragraph\">General-purpose cryptographic proof systems enable the following. A program runs, and along with its output it produces a short proof, a cryptographic certificate that this program, on these inputs, produced this output. The proof is small and fast to check. Whoever receives it can confirm the result in milliseconds without rerunning the program, and can pass the proof on to anyone else who needs the same assurance. With the zero-knowledge property, the proof also reveals nothing about inputs that should stay private. <\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Cryptographic proof systems were invented in the 1980s. Three challenges kept them from becoming a general tool, because all three were not solved at the same time.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Efficiency and scale.<\/strong>&nbsp;Producing a proof once took trillions of times more computation than running the program. The prover&#8217;s memory also grew with the length of the computation, which made long-running computations impractical to prove.&nbsp;<\/li>\n\n\n\n<li><strong>Generality and usability.<\/strong>&nbsp;Many proof systems require developers to rewrite a program by hand as a cryptographic circuit. This takes months, must be redone on every change, and is a frequent source of security bugs.&nbsp;<\/li>\n\n\n\n<li><strong>Security.<\/strong>&nbsp;Many proof systems rely on elliptic curves, which a sufficiently large quantum computer could break. Others need a trusted setup, or rest on newer assumptions that have had less scrutiny.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">For more than a decade, Microsoft Research has worked to make cryptographic proof systems practical. We highlight two results: <strong>Nova<\/strong> <strong>(2022)<\/strong> and <strong>Magnetar (2026)<\/strong>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<h3 id=\"spotlight-nova-and-folding-proving-computations-of-any-size\" class=\"wp-block-heading\">Spotlight: Nova and folding \u2014 proving computations of any size<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>The problem.<\/strong>&nbsp;Many real-world computations are long, or keep running indefinitely. Examples include ledgers and blockchains that keep processing transactions. Proving such a computation in one shot needs prover memory that grows with its length, which makes long-running computations impractical to prove.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>The idea.<\/strong>&nbsp;Nova introduced&nbsp;<strong>folding schemes<\/strong>. With folding, a prover handles a computation of any length. This is done by producing a proof for a step and then updating it by executing another step. Updating the proof by a step costs the same however many steps came before, and checking the proof does not get harder as the computation grows. Nova started a line of folding-based proof systems, from elliptic-curve designs to plausibly post-quantum, lattice-based ones.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>The Nova family.<\/strong> A series of works improved Nova&#8217;s prover time, verifier time, and proof sizes; built folding scheme using lattices; applied folding schemes to real-world applications.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2023\/573\">HyperNova<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/strong>&nbsp;(CRYPTO 2024). Folding for a general class of problems while minimizing the prover&#8217;s work<\/li>\n\n\n\n<li><strong><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2024\/1606\">NeutronNova<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/strong>&nbsp;(CRYPTO 2026). Improves upon HyperNova further to reduce recursion costs while expanding folding to a broader class of problems<\/li>\n\n\n\n<li><strong><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2024\/1605\">Nebula<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/strong>&nbsp;(IEEE S&P 2026, Distinguished Paper Award). Extends folding schemes with memory checking, providing a folding-based zkVM<\/li>\n\n\n\n<li><strong><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2024\/2099\">MicroNova<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/strong>&nbsp;(IEEE S&P 2025). Folding with a verifier efficient enough for Ethereum.<\/li>\n\n\n\n<li><strong><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2026\/242\">Neo and SuperNeo<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/strong>&nbsp;(CRYPTO 2026). Lattice-based folding for a general class of problems. Features a fast commitment scheme and plausible post-quantum security.<\/li>\n\n\n\n<li><strong><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2025\/2094\">Vega<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/strong>&nbsp;(IEEE S&P 2026).  Vega proves facts from government credentials such as mobile driver&#8217;s licenses. It uses NeutronNova to fold the many computation steps over a credential into one, and then folds with a random step using Nova to add zero-knowledge.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>From Nova to Magnetar.<\/strong>&nbsp;The goal Nova set, proving computations of any size, carries through to Magnetar. Magnetar proves a computation in pieces and combines the pieces, using efficient recursion built on standard hash functions (see below).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<h3 id=\"spotlight-nova-and-folding-proving-computations-of-any-size\" class=\"wp-block-heading\">Spotlight: Magnetar<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\"><strong><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2026\/2423\">Magnetar: High-speed post-quantum RV64 zkVM from standard hashes<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Magnetar is a zero-knowledge virtual machine (zkVM), meaning it proves program executions on a standard machine (e.g., RV64IM). It is the first zkVM to have all three of these properties at once: it proves general-purpose programs, it is post-quantum secure from standard hash functions, and its recursion is efficient.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>General-purpose.<\/strong>&nbsp;Magnetar proves programs compiled to 64-bit RISC-V (RV64IM). Developers write in Rust, Go, or C, compile as usual, and prove the program as written. An Ethereum Virtual Machine (EVM) written in Rust or Go runs inside Magnetar. That yields a zkEVM for existing smart contracts.<\/li>\n\n\n\n<li><strong>Fast.<\/strong>&nbsp;On a laptop, it proves 2^22-cycle executions at 7.2\u20138.7 million cycles per second. It is 10 to 39 times faster on average than the prior fastest comparable systems. An optimized Magnetar reaches 9.5\u201312.8 million cycles per second, which raises each speedup by about 1.3\u00d7.<\/li>\n\n\n\n<li><strong>Small proofs that are fast to check.<\/strong>&nbsp;Proofs are about 600 KiB and verify in 11\u201313 ms.<\/li>\n\n\n\n<li><strong>Standard cryptography only.<\/strong>&nbsp;Security rests on a standard hash function such as SHA-256 or SHA-3. Magnetar needs no elliptic curves and no lattices; no special-purpose hash functions such as Poseidon; no trusted setup; no unproven conjecture about error-correcting codes. Hash functions underlie the hash-based signatures that NIST standardized as its conservative post-quantum option.<\/li>\n\n\n\n<li><strong>Proofs of proofs.<\/strong>&nbsp;Checking a Magnetar proof is mostly hashing and binary-field arithmetic, which is exactly what Magnetar proves efficiently. So Magnetar can prove a computation of any size by proving it in pieces and combining them. It can also prove a long-running system such as a ledger or a blockchain.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">Links:&nbsp;<a href=\"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/blog\/proof-based-general-purpose-computing-with-magnetar\/\">Blog<\/a><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n\n\n<h3 id=\"news\" class=\"wp-block-heading\">News<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>October 2026.<\/strong>&nbsp;Microsoft Research introduces Magnetar on its blog (<a href=\"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/blog\/proof-based-general-purpose-computing-with-magnetar\/\">blog<\/a>,&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2026\/2423\">paper<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>).<\/li>\n\n\n\n<li><strong>August 2026.<\/strong>&nbsp;NeutronNova and Neo and SuperNeo appear at CRYPTO 2026.<\/li>\n\n\n\n<li><strong>May 2026.<\/strong>&nbsp;A Microsoft Research blog post presents Vega: zero-knowledge proofs for digital identity in the age of AI (<a href=\"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/blog\/vega-zero-knowledge-proofs-for-digital-identity-in-the-age-of-ai\/\">blog<\/a>). Vega and Nebula appear at IEEE S&P 2026.<\/li>\n\n\n\n<li><strong>May 2025.<\/strong>&nbsp;MicroNova appears at IEEE S&P 2025.<\/li>\n\n\n\n<li><strong>August 2024.<\/strong>&nbsp;HyperNova appears at CRYPTO 2024, and Reef at USENIX Security 2024.<\/li>\n\n\n\n<li><strong>May 2024.<\/strong>&nbsp;Lasso and Jolt appear at EUROCRYPT 2024.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n\n\n<h3 id=\"publications\" class=\"wp-block-heading\">Publications<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Magnetar: High-speed post-quantum RV64 zkVM from standard hashes<\/strong>. Srinath Setty.&nbsp;<em>Preprint, 2026<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2026\/2423\">ePrint 2026\/2423<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>BinarySpartan: Spartan over binary fields<\/strong>. Srinath Setty.&nbsp;<em>Preprint, 2026<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2026\/1656\">ePrint 2026\/1656<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Neo and SuperNeo: Post-quantum folding with pay-per-bit costs over small fields<\/strong>. Wilson Nguyen, Srinath Setty.&nbsp;<em>CRYPTO 2026<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2026\/242\">ePrint 2026\/242<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>NeutronNova: Group-based folding done right<\/strong>. Abhiram Kothapalli, Srinath Setty.&nbsp;<em>CRYPTO 2026<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2024\/1606\">ePrint 2024\/1606<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Vega: Low-Latency Zero-Knowledge Proofs over Existing Credentials<\/strong>. Darya Kaviani, Srinath Setty.&nbsp;<em>IEEE S&P 2026<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2025\/2094\">ePrint 2025\/2094<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Nebula: Proving machine executions using folding schemes<\/strong>. Arasu Arun, Srinath Setty.&nbsp;<em>IEEE S&P 2026<\/em>, <em>Distinguished Paper Award<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2024\/1605\">ePrint 2024\/1605<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Neo: Lattice-based folding scheme for CCS over small fields and pay-per-bit commitments<\/strong>. Wilson Nguyen, Srinath Setty.&nbsp;<em>Preprint, 2025<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2025\/294\">ePrint 2025\/294<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Twist and Shout: Faster memory checking arguments via one-hot addressing and increments<\/strong>. Srinath Setty, Justin Thaler, Michael Zhu.&nbsp;<em>Preprint, 2025<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2025\/105\">ePrint 2025\/105<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>MicroNova: Folding-based arguments with efficient (on-chain) verification<\/strong>. Jiaxing Zhao, Srinath Setty, Weidong Cui, Greg Zaverucha.&nbsp;<em>IEEE S&P 2025<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2024\/2099\">ePrint 2024\/2099<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex Proofs<\/strong>. Sebastian Angel, Eleftherios Ioannidis, Elizabeth Margolin, Srinath Setty, Jess Woods.&nbsp;<em>USENIX Security 2024<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2023\/1886\">ePrint 2023\/1886<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>BabySpartan: Lasso-based SNARK for non-uniform computation<\/strong>. Srinath Setty, Justin Thaler.&nbsp;<em>Preprint, 2023<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2023\/1799\">ePrint 2023\/1799<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Jolt: SNARKs for Virtual Machines via Lookups<\/strong>. Arasu Arun, Srinath Setty, Justin Thaler.&nbsp;<em>EUROCRYPT 2024<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2023\/1217\">ePrint 2023\/1217<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Unlocking the lookup singularity with Lasso<\/strong>. Srinath Setty, Justin Thaler, Riad S. Wahby.&nbsp;<em>EUROCRYPT 2024<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2023\/1216\">ePrint 2023\/1216<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>CycleFold: Folding-scheme-based recursive arguments over a cycle of elliptic curves<\/strong>. Abhiram Kothapalli, Srinath Setty.&nbsp;<em>Preprint, 2023<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2023\/1192\">ePrint 2023\/1192<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Revisiting the Nova Proof System on a Cycle of Curves<\/strong>. Wilson Nguyen, Dan Boneh, Srinath Setty.&nbsp;<em>Preprint, 2023<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2023\/969\">ePrint 2023\/969<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>HyperNova: Recursive arguments for customizable constraint systems<\/strong>. Abhiram Kothapalli, Srinath Setty.&nbsp;<em>CRYPTO 2024<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2023\/573\">ePrint 2023\/573<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Customizable constraint systems for succinct arguments<\/strong>&nbsp;(CCS, SuperSpartan). Srinath Setty, Justin Thaler, Riad S. Wahby.&nbsp;<em>Preprint, 2023<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2023\/552\">ePrint 2023\/552<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>SuperNova: Proving universal machine executions without universal circuits<\/strong>. Abhiram Kothapalli, Srinath Setty.&nbsp;<em>Preprint, 2022<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2022\/1758\">ePrint 2022\/1758<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Transparency Dictionaries with Succinct Proofs of Correct Operation<\/strong>&nbsp;(Verdict, Phalanx). Ioanna Tzialla, Abhiram Kothapalli, Bryan Parno, Srinath Setty.&nbsp;<em>NDSS 2022<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2021\/1263\">ePrint 2021\/1263<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Brakedown: Linear-time and field-agnostic SNARKs for R1CS<\/strong>. Alexander Golovnev, Jonathan Lee, Srinath Setty, Justin Thaler, Riad S. Wahby.&nbsp;<em>CRYPTO 2023<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2021\/1043\">ePrint 2021\/1043<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Nova: Recursive Zero-Knowledge Arguments from Folding Schemes<\/strong>. Abhiram Kothapalli, Srinath Setty, Ioanna Tzialla.&nbsp;<em>CRYPTO 2022<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2021\/370\">ePrint 2021\/370<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Linear-time and post-quantum zero-knowledge SNARKs for R1CS<\/strong>. Jonathan Lee, Srinath Setty, Justin Thaler, Riad S. Wahby.&nbsp;<em>Preprint, 2021<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2021\/030\">ePrint 2021\/030<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Quarks: Quadruple-efficient transparent zkSNARKs<\/strong>. Srinath Setty, Jonathan Lee.&nbsp;<em>Preprint, 2020<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2020\/1275\">ePrint 2020\/1275<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Verifiable state machines: Proofs that untrusted services operate correctly<\/strong>. Srinath Setty, Sebastian Angel, Jonathan Lee.&nbsp;<em>ACM SIGOPS Operating Systems Review, 2020<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2020\/758\">ePrint 2020\/758<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Replicated state machines without replicated execution<\/strong>&nbsp;(Piperine). Jonathan Lee, Kirill Nikitin, Srinath Setty.&nbsp;<em>IEEE S&P 2020<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2020\/195\">ePrint 2020\/195<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Spartan: Efficient and general-purpose zkSNARKs without trusted setup<\/strong>. Srinath Setty.&nbsp;<em>CRYPTO 2020<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2019\/550\">ePrint 2019\/550<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n\n\n\n<li><strong>Proving the correct execution of concurrent services in zero-knowledge<\/strong>&nbsp;(Spice). Srinath Setty, Sebastian Angel, Trinabh Gupta, Jonathan Lee.&nbsp;<em>OSDI 2018<\/em>.&nbsp;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/eprint.iacr.org\/2018\/907\">ePrint 2018\/907<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/li>\n<\/ul>\n\n\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/blog\/proof-based-general-purpose-computing-with-magnetar\/\">Proof-based general-purpose computing with Magnetar<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/blog\/vega-zero-knowledge-proofs-for-digital-identity-in-the-age-of-ai\/\">Vega: Zero-knowledge proofs for digital identity in the age of AI<\/a><\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">&nbsp;<\/p>\n\n\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>General-purpose cryptographic proof systems enable the following. A program runs, and along with its output it produces a short proof, a cryptographic certificate that this program, on these inputs, produced this output. The proof is small and fast to check. Whoever receives it can confirm the result in milliseconds without rerunning the program, and can [&hellip;]<\/p>\n","protected":false},"featured_media":1193876,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","footnotes":""},"research-area":[13558],"msr-locale":[268875],"msr-impact-theme":[],"msr-pillar":[],"class_list":["post-1193441","msr-project","type-msr-project","status-publish","has-post-thumbnail","hentry","msr-research-area-security-privacy-cryptography","msr-locale-en_us","msr-archive-status-active"],"msr_project_start":"","related-publications":[],"related-downloads":[],"related-videos":[],"related-groups":[],"related-events":[],"related-opportunities":[],"related-posts":[],"related-articles":[],"tab-content":[],"related-researchers":[{"type":"user_nicename","display_name":"Srinath Setty","user_id":33709,"people_section":"Related people","alias":"srinath"},{"type":"guest","display_name":"Weidong Cui","user_id":1193861,"people_section":"Related people","alias":""},{"type":"guest","display_name":"Ioanna Tzialla","user_id":1193475,"people_section":"Related people","alias":""},{"type":"guest","display_name":"Sai Deng","user_id":1193857,"people_section":"Related people","alias":""},{"type":"guest","display_name":"Wilson Nguyen","user_id":1193619,"people_section":"Related people","alias":""},{"type":"guest","display_name":"Abhiram Kothapalli","user_id":1193859,"people_section":"Related people","alias":""}],"msr_research_lab":[],"msr_impact_theme":[],"_links":{"self":[{"href":"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-project\/1193441","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-project"}],"about":[{"href":"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-project"}],"version-history":[{"count":32,"href":"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-project\/1193441\/revisions"}],"predecessor-version":[{"id":1193886,"href":"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-project\/1193441\/revisions\/1193886"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/media\/1193876"}],"wp:attachment":[{"href":"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/media?parent=1193441"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=1193441"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=1193441"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=1193441"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/new-cm-edgedigital.pages.dev\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=1193441"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}