Skip to content
SotaZK Labs docs
Language
Initializing search
GitHub
SotaZK Labs docs
GitHub
DOCUMENTATION REPOSITORY
Articles
Articles
Proofs arguments and zero knowledge
Proofs arguments and zero knowledge
Chapter 12: \(\Sigma\)-Protocols and Commitments from Hardness of Discrete Logarithm
Chapter 19: Bird’s Eye View of Practical Arguments
Chapter 2: The Power of Randomness (Fingerprinting and Freivalds’ Algorithm)
Chapter3 - Definitions and Technical Preliminaries
Chapter 4 - Interactive Proofs
Chapter 5 - Publicly Verifiable, Non-interactive Arguments via Fiat-Shamir
Proofs, Arguments, and Zero-Knowledge
Quadratic arithmetic programs from zero to hero
Quadratic arithmetic programs from zero to hero
Quadratic Arithmetic Programs (QAP)
Seminar innovative internet technologies
Seminar innovative internet technologies
Seminar Innovative Internet Technologies
Why and how zk snark works
Why and how zk snark works
Chapter 1 - Introduction
Chapter 2 - The medium of a proof
Chapter 3 - Non-Interactive Zero Knowledge of a Polynomial
Notes
Zcash protocol
Zcash protocol
Chapter 1: Introduction
Chapter 2: Notations
Chapter 3: Concepts
Zk snarks under the hood
Zk snarks under the hood
Zk snarks under the hood
Docs
Docs
Cyclotomic Polynomials and Primitive Roots of Unity
DARK: Diophantine Argument of Knowledge
Fast Reed - Solomon Interactive Oracle Proof of Proximity
The GSW FHE Scheme
Lattice-based Homomorphic Signatures
Monolith Hash
Non-Native Field Arithmetic
Nova
PLONK: Permutations over Lagrange-Bases for Oecumenical Noninteractive Knowledge
Plookup: A Simplified Polynomial Protocol for Lookup Tables
Reed-Solomon Fingerprinting
Reinforced Concrete
STARK Engine
STARK’s Mechanics
Zk Comparison
ZkPorter: Revolutionizing Layer 2 Scaling
ZK-Rollups after EIP-4844
zkSync Era
Terms
Terms
Abelian
Adleman’s Theorem
Advice Column
Arguments
Arithmetization
Ate Pairing
Barycentric equation
Base field
BLS12 - 381
Boolean Circuit
Boolean Formula
Boundary Constraints
Characteristic
Chinese Remainder Theorem
Chip
Circuit
Codeword
Commitment Scheme
Common Reference String (CRS)
Computation
Computational Integrity
Coordinate Pair Accumulator
Correlation-Intractability (CI)
Diophantine equation
Diophantine Set
Discrete Logarithm
Divisor
Doubly-Efficient
Elliptic Curve (EC)
Elliptic curve group
Elliptic Curve Pairings
Embedding Degree
Extension
Extension Fields
Fast Fourier Transforms
Fermat’s Little Theorem
Fiat Shamir
Folding Scheme
Fundamental Theorem Of Algebra
Gadget Matrix
Gate
GKR Protocol
Group
Holography
Homogeneous Polynomial or Projective Model
Homomorphic Encryption
Interactive Proofs
IP
IVC
Kintsugi Strategy
Knowledge Of Exponent (KOE)
Lagrange Interpolation
Language
Lattice
Learning With Errors
Low Degree
Low-degree Extension
Miller Algorithm
Modular Arithmetic
Multilinear
NP
Pairings or Bilinear Maps
Pinocchio Protocol
Polynomial-time computation
Poseidon Hash Function
Preimage Sampling
Prime Or Finite Fields
Quadratic Fields
R1CS
Random Oracle Model (ROM)
Rational Function
Recursive SNARKs
Relation
Restriction
Rollups: Streamlining Blockchain Scalability
Round-by-round Soundness
Scalar field
Schwartz-Zippel Lemma
Selector Function
Statement
Structured Reference String (SRS)
Succinct
Sum-Check Protocol
Symbolic Evaluation
Tate Pairing
Transition Constraints
Trapdoor
Trapdoor For Uniform Random Matrix
Trusted Setup
Uniform Reference String (URS)
Uniqueness of Multilinear Extension
Vector Commitment
Witness
ZK-Friendly Hash
Zero knowledge Succinct Non-interactive Arguments of Knowledge (zkSNARK)
Zero Knowledge Scalable Transparent Arguments of Knowledge (zkSTARK)
Zero knowledge proof (ZKP)
Polynomial commitment
Polynomial commitment
Polynomial Commitment
Kate Commitment (KZG)
Dory Commitment
Language
¶
Any subset
\(L ⊆ \{0,1\}^n\)
is called a language.
Comments
Back to top