AirScript: Arithmetization for zk-STARKs
summary
AirScript defines execution traces as dynamic and static registers, transition functions and constraints, and compiles to Air assembly consumed by the genSTARK prover. The MinC example runs a single-register trace for 64 steps over a finite field, uses a repeating static round-constant (1,2,3,4), composes transition constraints into one polynomial, and generates a STARK proof via JavaScript that verifies successfully. Practical tradeoffs: constraint degree drives proof cost.
AI-written summary · about
chapters (6)
- 0:00Introduction to AIR
- 0:51Computations and constraints
- 3:11Core concepts of AIR
- 5:53Advanced AIR architecture
- 9:20STARK proof generation
- 11:29Practical implementation
related talks
01h 35mSTARK – Zero-Knowledge Proof Protocol
26mA verified algebraic representation of Cairo program execution
01h 05mInclusive Accountability at Scale via Proofs
16mScaling with STARKs
36mPanel Discussion
44mTooling for building zkEVM: PIL and Circom
54mSnarky: Algebraic effects in the Coda cryptocurrency
16mDecentralized and Permissionless ZK-Rollups