1. halo2
2. 1. Concepts
   1. 1.1. Proof systems
   2. 1.2. PLONKish Arithmetization
   3. 1.3. Chips
   4. 1.4. Gadgets
3. 2. User Documentation
   1. 2.1. Developer tools
   2. 2.2. A simple example
   3. 2.3. Lookup tables
   4. 2.4. Gadgets
   5. 2.5. Tips and tricks
   6. 2.6. WASM Guide
4. 3. Developer Documentation
   1. 3.1. Feature development
5. 4. Design
   1. 4.1. Proving system
      1. 4.1.1. Lookup argument
      2. 4.1.2. Permutation argument
      3. 4.1.3. Circuit commitments
      4. 4.1.4. Vanishing argument
      5. 4.1.5. Multipoint opening argument
      6. 4.1.6. Inner product argument
      7. 4.1.7. Comparison to other work
   2. 4.2. Protocol Description
   3. 4.3. Implementation
      1. 4.3.1. Proofs
      2. 4.3.2. Fields
      3. 4.3.3. Selector combining
   4. 4.4. Gadgets
      1. 4.4.1. Elliptic curve cryptography
         1. 4.4.1.1. Witnessing points
         2. 4.4.1.2. Incomplete and complete addition
         3. 4.4.1.3. Fixed-base scalar multiplication
         4. 4.4.1.4. Variable-base scalar multiplication
      2. 4.4.2. Sinsemilla
         1. 4.4.2.1. MerkleCRH
      3. 4.4.3. Decomposition
      4. 4.4.4. SHA-256
         1. 4.4.4.1. 16-bit table chip
6. 5. Background Material
   1. 5.1. Fields
   2. 5.2. Polynomials
   3. 5.3. Cryptographic groups
   4. 5.4. Elliptic curves
   5. 5.5. Polynomial commitment using inner product argument
   6. 5.6. Recursion