Quang Dao
@QuangVDao
PhD student @SCSatCMU.
Working toward zk too cheap to meter & formally verified by default
2.2K Following 1.2K Followers
New from LayerZero Research: Formal Verification of Jolt Bytecode Expansion.
We’ve formally verified a core component of Jolt, the zk-VM powering Zero’s proving architecture.
Read the full writeup:
Show more
I'm so excited 𝔹itℤ by @0xAlbertG et al. is now public!
It combines boolean and integer relations, free range checks and efficient binary field commitments. In short: your proof system is no longer tied to a particular finite field.
The performance exceeded our expectations. Despite being field agnostic, it performed better on real world tasks than systems fine-tuned for the task.
We completely changed the ProveKit roadmap for 𝔹itℤ, and I expect others will too!
Show more
Breakthrough result!
This closes the final gap to have lattice based SNARKs everywhere and for everything
LaBinius: Lattice-based Polynomial Commitment Scheme over a Binary Field.
Excited to present LaBinius, my recent work with @gregor_seiler.
We show how to instantiate an Ajtai commitment over extremely efficient cyclotomic power-of-three rings and then connect it with a polynomial opening mod 2, so that R/2R is a binary field.
Such a PCS is bridged with SOTA frontends, including Flock and Binius, to obtain end-to-end proofs of standard hashes with throughput of tens of thousands per second.
Show more
In slightly more than a month (vis @nasqret!) introduced new ideas which have propagated through several papers:
followed by
and
Are there any others?
Show more
Velvet 2.0 is out: now based on Lean's most recent verification machinery, easier to set up, and 10x faster. New: exception specs, ghost state, named proof goals, lots of case studies from Dijkstra to lazy segment trees. And a new shiny webpage:
Show more
Today we introduce Open Math Model: open models and tools for mathematics.
Built for everyday research, shaped by the mathematical community, and developed in the open.
Read our co-founder Terence Tao’s blog:
Show more
Bend 2 is here!
It is a new programming language that blocks AI mistakes via *proof checking* - the same technique big AI labs used to solve open math problems, like Navier-Stokes.
It is also very fast, and runs on GPUs.
Watch the video. Link in the comments.
Show more
@badcryptobitch @StoffelMPC I see, thanks.
Latest generation of zk is far more performant than your expectations. Jolt for instance proves 1 million RISC-V cycles using only 2-3GB of RAM (soon will go down to <1GB).
In general, zk is converging to ~3 orders of magnitude overhead over native computation
Show more
Cryptographic protocols should be formally verified
How do we do it in Lean, the fastest-growing proof assistant?
Introducing VCVio ( a base layer for crypto proofs in Lean
Joint work with @dtumad, @alexanderlhicks, James Waters & Nick Hopper
🧵/n
Show more
Our newest sum-check optimizations are out!
We propose a *better* domain for sum-check: the infinity hypercube.
Evaluations over this domain give *precisely* the monomial coefficients, and lead to a ~10% prover speedup over 128+ bits prime fields
🧵/ n
Show more
