1. 1. Introduction
  2. Foundations
  3. 2. Terminology
  4. 3. Groups
  5. 4. Rings
  6. 5. Fields
  7. 6. Polynomials
    1. 6.1. Multiplying polynomials
    2. 6.2. Fast Fourier transform
  8. Cryptographic tools
  9. 7. Commitments
  10. 8. Polynomial commitments
    1. 8.1. Inner product argument
    2. 8.2. Different functionnalities
  11. Proof systems
  12. 9. Overview
  13. 10. zk-SNARKs
  14. 11. Custom constraints
  15. Background on PLONK
  16. 12. Overview
  17. 13. Glossary
  18. 14. Domain
  19. 15. Lagrange basis in multiplicative subgroups
  20. 16. Non-interaction with fiat-shamir
  21. 17. Plookup
  22. 18. Maller's optimization
  23. Kimchi
  24. 19. Overview
    1. 19.1. Arguments
      1. 19.1.1. Custom gates
      2. 19.1.2. Permutation
      3. 19.1.3. Lookup
  25. Snarky
  26. 20. Overview
  27. 21. API
  28. 22. snarky wrapper
  29. 23. Kimchi backend
  30. 24. Vars
  31. 25. Booleans
  32. 26. Circuit generation
  33. 27. Witness generation
  34. Pickles & Inductive Proof Systems
  35. 28. Overview
  36. 29. Accumulation
  37. 30. Deferred Computation
  38. 31. Passthough & Me-Only
  39. RFCs
  40. 32. RFC 0: Alternative zero-knowledge
  41. 33. RFC 1: Final check
  42. 34. RFC 2: Maller's optimization for kimchi
  43. 35. RFC 3: Plookup integration in kimchi
  44. 36. RFC 4: Foreign Field Addition
  45. 37. RFC 5: Foreign Field Multiplication
  46. 38. RFC 6: Keccak
  47. Specifications
  48. 39. Poseidon hash
  49. 40. Polynomial commitment
  50. 41. Pasta curves
  51. 42. Kimchi
  52. 43. Universal Reference String (URS)
  53. 44. Pickles
  54. 45. Consensus

Mina book

Passthrough and Me-Only