1. 1. Instruction Set Architecture
2. 1. 1.1. Data Structures
   2. 1.2. Registers
   3. 1.3. Instructions
3. 2. Arithmetization
4. 1. 2.1. Arithmetization Overview
   2. 2.2. Program Table
   3. 2.3. Processor Table
   4. 1. 2.3.1. Instruction Groups
      2. 2.3.2. Instruction-Specific Transition Constraints
   5. 2.4. Operational Stack Table
   6. 2.5. Random Access Memory Table
   7. 2.6. Jump Stack Table
   8. 2.7. Hash Table
   9. 2.8. Cascade Table
   10. 2.9. Lookup Table
   11. 2.10. U32 Table
5. 3. Table Linking
6. 1. 3.1. Permutation Argument
   2. 3.2. Evaluation Argument
   3. 3.3. Lookup Argument
7. 4. Memory-Consistency
8. 1. 4.1. Contiguity of Memory-Pointer Regions
   2. 4.2. Clock Jump Differences and Inner Sorting
   3. 4.3. Proof of Memory Consistency
9. 5. Program Attestation
12. 6. Index Sampling
13. 7. Sum Check