zk-STARK：Zero-knowledge proofs without a trusted setup
zk-STARK is a zero-knowledge proof system that emphasizes scalability and transparency. It requires no initial trusted setup and is based on collision-resistant hash functions, but its proof data is typically larger, which may also result in higher transmission and usage costs.
First, understand zero-knowledge proofs
A zero-knowledge proof is a cryptographic verification method: the prover can convince the verifier that a statement is true without revealing the private information used to prove it. It is suitable for privacy-sensitive scenarios such as identity authentication, allowing users to prove that they are authorized to access something while reducing the exposure and centralized storage of information such as names, email addresses, or dates of birth.
zk-STARK Key features of
zk-STARK stands for “Zero-Knowledge Scalable Transparent Argument of Knowledge.” Unlike zk-SNARK which requires an initial trusted setup between the prover and verifier, it does not require this step. Instead, it uses a cryptographic structure based on collision-resistant hash functions and relies less on complex number-theoretic assumptions.
Trade-offs behind the advantages
zk-STARK Its cryptographic assumption structure is relatively simple and is also considered less affected by issues related to quantum computing attacks. However, its proofs are typically larger than zk-SNARK large 10 to 100 times. The larger data volume may increase processing and transmission costs and limit its use in applications that require proofs to be sent online.
Original Tutorial
https://www.binance.com/zh-CN/academy/glossary/zk-starks
Mark it complete when you understand it.
Opening a lesson does not complete it automatically. You can change its status at any time.