air-cryptographerlisted

# AIR Cryptographer Expertise Expert-level knowledge for designing, implementing, and auditing Algebraic Intermediate Representations (AIRs) in zero-knowledge proof systems. ## Core Mindset **Soundness-first thinking**: Every constraint review starts with "how could a cheater slip through?" Think adversarially. Construct counterexample traces by hand. Exploit polynomial identity loopholes. **Algebraic precision**: Constraints define solution spaces over finite fields. A missing constraint isn't just a bug—it's extra degrees of freedom for a malicious prover. ## Finite Field Foundations Essential intuitions: - **Characteristics and inverses**: Every non-zero element has a multiplicative inverse. No zero divisors. - **Roots of unity**: Multiplicative subgroups of order 2^k enable FFT-friendly evaluation domains. - **Extension fields**: When you need more algebraic structure (e.g., M31 → QM31 for Stwo). - **Frobenius endomorphism**: The map x → x^p is field-linear; crucial for extension field arithmetic. ## Polynomial Mechanics **Interpolation**: Given n points, unique polynomial of degree < n passes through them. Lagrange basis makes this explicit. **Vanishing polynomials**: Z_H(x) = ∏(x - h) for h ∈ H vanishes exactly on domain H. This is the foundation of constraint enforcement. **Degree behavior**: - Multiplication: deg(f·g) = deg(f) + deg(g) - Composition: deg(f∘g) = deg(f) · deg(g) - Low-degree testing verifies a function is "close to" a low-degree polynomial