Srinath Setty (@srinathtv) 's Twitter Profile
Srinath Setty

@srinathtv

Principal Researcher at Microsoft Research (@msftresearch)

ID: 398343409

linkhttps://www.microsoft.com/en-us/research/people/srinath/ calendar_today25-10-2011 22:46:05

486 Tweet

2,2K Takipçi

503 Takip Edilen

Srinath Setty (@srinathtv) 's Twitter Profile Photo

Nova’s HyperKZG implementation now powers @SpaceandTimeDB prover as well as its ability to verify proofs on-chain. The Blitzar library accelerates Nova’s MSMs on GPUs.

Srinath Setty (@srinathtv) 's Twitter Profile Photo

An excellent summary of Spartan, which has seen adoption in many projects in the space including Jolt zkVM, Binius64, and EF’s lean zkVM for the lean consensus layer!

Stanford Blockchain Club (@stanfordcrypto) 's Twitter Profile Photo

📖 Stanford Blockchain Review, Vol. 8 No. 6 #76 - “Cryptography Research Spotlight - An Overview of the LatticeFold Architectural Family” by Yavor from Stanford Blockchain Club features an in depth conversation with Dan Boneh on lattice-based folding schemes. review.stanfordblockchain.xyz/p/76-cryptogra…

Mario Yaksetig (@myaksetig) 's Twitter Profile Photo

Great read if you are curious and want to learn more about (real!) ZK! Really nice slides explaining the concept(s) clearly and in a very elegant manner

Srinath Setty (@srinathtv) 's Twitter Profile Photo

A zkSNARK has to prove: (1) a statement about a secret witness; and (2) a statement about circuit. In Pinocchio/Groth16, both are done together relying on a circuit-specific setup. A key idea in Spartan was to prove (2) efficiently; it works with any PCS including LigeroPCS!

Srinath Setty (@srinathtv) 's Twitter Profile Photo

Journey to fastest zkSNARK provers: Sum-check’92 ➜ IPs for low-depth circuits (GKR/CMT’12) ➜ SNARKs for low-depth circuits (vSQL’17) ➜ SNARKs for general circuits+lookups (Spartan’19) ➜ zkVMs via lookups (Lasso+Jolt’23, Twist+Shout’25) Sum-check also powers folding: Neo!

Journey to fastest zkSNARK provers:
Sum-check’92 
➜ IPs for low-depth circuits (GKR/CMT’12) 
➜ SNARKs for low-depth circuits (vSQL’17) 
➜ SNARKs for general circuits+lookups (Spartan’19) 
➜ zkVMs via lookups (Lasso+Jolt’23, Twist+Shout’25)

Sum-check also powers folding: Neo!
darya (@daryakaviani) 's Twitter Profile Photo

Here's how LLM providers (& anyone) should be doing age verification in 2025: Keep the ID private; prove "≥18" with ZK proofs. Our new paper with Srinath Setty "🌟Vega: Low‑Latency Zero-Knowledge Proofs over Existing Credentials" makes this practical today. eprint.iacr.org/2025/2094

Srinath Setty (@srinathtv) 's Twitter Profile Photo

PSE’s OpenAC is powered by the (Split)Spartan prover implemented in Microsoft/Spartan2 codebase and introduced in the recent Vega paper. Vega goes beyond SplitSpartan to achieve an even faster proofs of existing credentials by using the fold-and-reuse proving paradigm!