Succinct (@SuccinctLabs) / X

19h

2026: All rollups will be ZK 2027: All bridges will be ZK Succinct has secured >$3B in bridge volume with @AcrossProtocol and @Agglayer. ... And we're just getting started.

00:00

What is a SNARK, and why do hash-based SNARKs matter for post-quantum security? @kleptographic breaks it down in simple terms, from our X Space on Flock with @SuccinctLabs last week.

00:00

Jul 7

AI-assisted formal verification is becoming standard practice for ZK. Soundness bugs are found in the math underlying code. Formal verification is the only way to catch them. LLMs have dramatically reduced the effort required to formally verify proof systems securing billions.

Project Tachyon

@TachyonZcash

Jul 7

Zcash's new Ironwood pool is being formally verified to rule out all undetectable counterfeiting bugs, up to the underlying cryptographic assumptions. tachyon.z.cash/blog/detecting…

An Experiment in Formal Verification with Claude

Jul 7

We experimented with AI to formally verify VEIL, a ZK compiler. Claude wrote most of the Lean 4 proofs, guided by our cryptographers. Not only did the verification catch a bug, but human effort dropped to 1-2x of writing the paper, versus the usual 10x.

From blog.succinct.xyz

Jul 3

Missed yesterday's spaces on Flock? We've got you covered with notes on: → Q-day timelines → Flock: The fastest SNARK prover for standard hashes → What it means for Ethereum's post-quantum roadmap ft. @benediktbuenz, @ronrothblum, @kleptographic and @drakefjustin.

Jul 3

Jul 3

Listen to the full spaces below, hosted by @EspressoSys and @SuccinctLabs 👇

Espresso ☕️

@EspressoSys

Jul 2

Flock: Fast SNARK Proving for Post Quantum Crypto x.com/i/spaces/1Dxle…

Espresso ☕️

Host

Flock: Fast SNARK Proving for Post Quantum Crypto

196 tuned in

Jul 2

59:26

Jul 2

In 2 hours, we will be hosting a panel with @EspressoSys to dig into Flock, a new SNARK for proving batches of standard hash functions and its impact on PQC. Hear from the authors @benediktbuenz, @ronrothblum, @kleptographic, and guest, @drakefjustin.

Espresso ☕️

Host

Flock: Fast SNARK Proving for Post Quantum Crypto

4 tuned in

Jul 2

2:05

Jun 30

This Thursday, we're digging into Flock, a new SNARK for proving batches of standard hash function and its implications for PQ cryptography. Tune in with authors @benediktbuenz, @ronrothblum, @kleptographic, and guest, @drakefjustin. July 2 | 11am ET 👉 x.com/i/spaces/1Oxwb…

Jun 30

Catch up on Flock before the spaces:

Introducing Flock: a new SNARK for proving batches of standard hash functions at just 250× the cost of computing them natively. Developed by @benediktbuenz from @EspressoSys, @ronrothblum, and NYU's William Wang, Flock puts Ethereum's Post Quantum target in reach.

History in the making?

We just created the fastest SNARK prover ever built, and the first capable of keeping pace with Espresso consensus. Introducing Flock, co-created by our Co-Founder & NYU Prof @benediktbuenz, @ronrothblum from @SuccinctLabs, & NYU's William Wang. Here's why it matters🧵⤵️

Introducing Flock: a new SNARK for proving batches of standard hash functions at just 250× the cost of computing them natively. Developed by @benediktbuenz from @EspressoSys, @ronrothblum, and NYU's William Wang, Flock puts Ethereum's Post Quantum target in reach.

Replying to @SuccinctLabs

.@benediktbuenz joined @AnnaRRose and @kobigurk on the latest @zeroknowledgefm to discuss Flock’s design and impact on post-quantum crypto. Give it a listen:

Zero Knowledge Podcast

@zeroknowledgefm

🎙 @AnnaRRose & @kobigurk chat with @benediktbuenz, from @EspressoSys & @nyuniversity. They catch up on Espresso, his research on hash-based folding, DKGs for threshold signatures, and Flock, a fast batch-proof system built almost entirely with AI-written code.

How Close Can Proving Get to Computing? Introducing Flock

Flock is a research prototype, not meant for production yet, but the code is open source and the paper has the full protocol and benchmarks. If you're working on post-quantum signatures, VDFs, or anything dominated by hashing, try it and help push the overhead lower. → Paper:

The overhead of proving over computing A Succinct Non-Interactive Argument of Knowledge (SNARK) lets an untrusted party prove they did a computation correctly by handing over a small receipt that...

How Close Can Proving Get to Computing? Introducing Flock

The overhead of proving over computing A Succinct Non-Interactive Argument of Knowledge (SNARK) lets an untrusted party prove they did a computation correctly by handing over a small receipt that...