This repository is created to learn implementations of zero-knowledge STARK protocol.
Great tutorial by aszepieniec explains the math behind this proof system.
- There is no compression of transition constraints into one master constraint
- In production systems the length of the codeword is often reduced not by a factor 2 but a small power of 2. This optimization reduces the proof size and might even generate running time improvements
- Arithmetization step, which transforms the initial computation into an arithmetic constraint system
- Extension fields. EthSTARK operates over the finite field defined by a 62-bit prime, but the FRI step operates over a quadratic extension field thereof in order to target a higher security level.
- Advanced STARKs may define more constraint types (referring to AIR) in order to deal with memory or with consistency of registers within one cycle
- The code supporting the tutorial achieves scalability through preprocessing as opposed to group theory. Preprocessing is arguably not scalable if counted as verifier's work.