Introducing Dynamic zk-SNARKs—a breakthrough from the Lagrange research team Weijie Wang, @chbpap, @s_shravan, and @dipapadopo Dynamic zk-SNARKs mark a major step forward in making real-time, updatable cryptographic proofs a reality Here’s what that means and why it matters 🧵

2/ Traditional zk-SNARKs are limited in their static nature—if your data changes, you have to rebuild the whole proof from scratch (AKA slow, expensive, and impractical for data-intensive apps). Dynamic zk-SNARKs remove these limitations.

3/ In short, Dynamic zk-SNARKs let you update a proof when your data changes—no need for starting over. Imagine updating a receipt instead of printing a new one every time a customer adds an item (faster, cheaper and smarter—practical for data-intensive apps).

4/ This research poses immense benefits for real-world use-cases. e.g.: – AI that keeps learning – Games with real-time logic – Blockchains tracking live data – Smart contracts adjusting as inputs shift Dynamic zk-SNARKs make these use cases verifiable without wasting compute.

5/ Imagine this… 💭 - An AI gives you an answer - A Dynamic zk-SNARK proves it’s correct. - You give the AI a new input, building upon your previous one. - With the Dynamic zk-SNARK, an AI can update the proof for the new answer in seconds (no need to recompute everything).

6/ Cheers to our research team for redefining what we can achieve with ZK technology One breakthrough at a time, we’re pioneering AI that is safe, verifiable and trustworthy Catch the talk at SBC ‘25: Read the full paper here: