Hi all,
I’d like to have a sense of interest for a series of discussions about “Scaling Zcash” with Tachyon/Ragu.
- I’m interested
- No thanks
0
voters
There are ~100 slides per chapter, and there are 20+ chapters so far.
- The Problem
- Scaling Zcash
- An Introduction to Proof-Carrying Data
- Proof Structure
3. Statements and Challenges
4. Arithmetization
5. QAP and Polynomial Encoding
6. Polynomial Commitments
7. The Inner Product Argument
8. Batched Openings
9. The Complete Proof - Recursion
10. Recursive Proofs
11. Accumulation
12. Split Accumulation
13. Curve Cycles - Ragu
14. Revdot Folding
15. Wiring and the Registry
16. Endoscalars
17. Staging
18. Recursion in Ragu - Tachyon
19. Notes, Nullifiers, and Tachygrams
20. Pool State and Anchors
21. Oblivious Sync
22. The Proof Tree
23. Aggregation and Bundles - Final Recap
Some slides from chapter 1.
What level in math does this require?
Roughly the level of an upper-undergraduate student in computer science or mathematics who has taken a first course in cryptography.
Assumed going in:
- Linear algebra: vectors, linear combinations, inner products, matrices.
- Finite fields: arithmetic modulo a prime, and inverses. The examples mostly work in the small field F₄₃, so every number can be checked by hand.
- Polynomials: evaluation, multiplication, division with remainder, and roots.
- Elliptic curves: what a curve group is, adding points, and multiplying a point by a number. Only the definitions are needed; no curve theory.
- Discrete log and hashes: what it means for these to be hard. This is the level of an introductory cryptography course.
