An R1CS Based Implementation of Bulletproofs
summary
An R1CS-based Bulletproofs library implements range proofs and a constraint-system API in Rust and claims the fastest Rust implementation of Bulletproof range proofs; it uses Merlin transcripts, a two-phase commit/challenge flow to derive Fiat–Shamir scalars, and an R1CS API called the R1CS constraint API that exposes multiplicative and linear constraints plus randomized challenges. Practical gadgets include a polynomial-based shuffle (3 constraints per pair), merge/split and range-checks, a confidential assets (cloak) protocol whose cost is only slightly above a plain range proof, and an evolving ZK VM with code and spec available on GitHub.
AI-written summary · about
chapters (7)
- 0:00Introduction to bulletproofs
- 1:08Constraint system basics
- 2:22Interactive proof challenges
- 4:32Shuffle gadget demonstration
- 10:52Confidential assets protocol
- 15:17Zero-knowledge smart contracts
- 18:12Q&A and technical discussion
related talks
17mRobust Constant-Time Cryptography
19mCounterexamples in Safe Rust
09mFormally Secure Hardware with Rust
45mBuilding Safe and Secure Systems in Rust
01h 00mKeynote: Bringing Verified Cryptographic Protocols to Practice
26mBuilding Private And Secure Applications Easily Using The Sunscreen FHE Compiler&Rust
36mRust's trait system is a proof engine, let's make it prove us an ABI!
09mRustc: How I Learned to Respect the Compiler