🪄
Zk Notes
  • Groth16 explained
    • Background
    • 1. Arithmetization
    • 2. R1CS representation
    • 3. QAP (QAP: The S in Succinct)
    • 4. Encrypting QAP
    • 5. Salting / Shifting
    • Muh Privacy: Separating public and private inputs
      • Final - Proving key, Verifier Key
  • Circom
    • #1 Circom: Introduction
    • #2 Circom: Template parameters, Variables, Loops
    • #2.1 Circom: Quadratic Constraints
    • #3 Circom: Parametrizing circuits
    • #3.1 Symbolic Variables
    • #4 Circom: Intermediate signals
    • #5 Circom: Witness, Proof generation and Verification
    • #6 Circom: signal output
    • #7 Circom: Comparator Circuits
    • 🚧#8 Circom: Other Reference Circuits
    • 🚧#9 Circom: Public and Private Inputs
    • Division: integer and modulo
  • 0xPARC ZK Learning Group
    • [ZK Learning Group 2] Circom workshop #1
    • [ZK Learning Group 2] Circom workshop #2
    • [ZK Learning Group 2] Trusted setup workshop
  • ZK Puzzles (Rareskills)
    • Add.circom
    • Equality.circom
    • FourBitBinary
    • AllBinary
    • MultiAND
    • MultiOR
    • IsSorted
    • HasAtLeastOne
    • IntDiv
    • IntDivOut
    • IntSqrt
  • Misc
    • Background
      • Three Reasons to Use Modular Arithmetic in ZKPs
      • Proving systems
    • Inputs
    • Components of a proof system
  • Abstract Math
    • Linear Algebra
      • Unit Vectors / Basis Vectors
      • Linear Combination
      • Linear transformations and matrices
      • Determinant
    • Set theory
      • Binary Operator
      • Magma, Semigroups, and Monoids, and Groups
    • Modular Arithmetic
      • Equivalence relations
      • The quotient remainder theorem
      • Modular addition and subtraction
      • Modular Multiplication
      • Modular exponentiation
      • Modular inverses
Powered by GitBook