Design a Proof Of Solvency protocol with Halo2 Workshop
summary
Workshop shows how to build a Halo2 circuit that implements Summa’s zk proof-of-solvency: assets are committed on‑chain via exchange signatures, liabilities are a Merkle-sum tree whose root goes to a contract, and a Halo2 circuit proves assets ≥ liabilities. Circuit composes a Poseidon hashing chip, a range check chip to prevent field overflow, and Merkle-level chips. Benchmarks use 2^15 users and two assets, solvency proof generation is a fraction of a second, inclusion proofs are fast and parallelizable and verified locally. Open problems: PIR for inclusion retrieval and private proofs of assets without revealing signing keys.
AI-written summary · about
chapters (6)
- 0:00Start
- 2:22Book authentication today
- 18:37Mental model: The grid
- 20:47Traditional Development
- 30:28Range Check Chip
- 33:59Open Challenges
related talks
45mHalo 2 Community Showcase
01h 09mProofs - Practice 1
28mEvolution of Optimistic Rollup proofs
58mA Forest of Levers: The Performance of Orchard
33mAn Introduction to Zero Knowledge Proofs
28mRings and trees: how to prove coin ownership
37mSeraphis Tx Protocol
18mRevolutionizing Privacy: Luke, Sarang, Aram & Reuben on Full Membership Proofs