পদ্ধতির তুলনা করুন

	zk-STARK	zk-SNARK
ক্ষেত্র	ক্রিপ্টোগ্রাফি	ক্রিপ্টোগ্রাফি
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2018	2014
প্রবর্তক	Eli Ben-Sasson	Eli Ben-Sasson
ধরন	transparent zero-knowledge argument of knowledge	zero-knowledge argument of knowledge
মৌলিক উৎস	Ben-Sasson, E., Bentov, I., Horesh, Y., & Riabzev, M. (2019). Scalable, transparent, and post-quantum secure computational integrity. In IACR Cryptology ePrint Archive, Report 2018/046.	Ben-Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014). Zerocash: Decentralized Anonymous Payments from Bitcoin. In IEEE Symposium on Security and Privacy (SP), pp. 459-474.
অপর নাম	zk-STARK, transparent argument of knowledge, STARK	zk-SNARK, zero-knowledge proof, SNARK
সম্পর্কিত	3	3
সারসংক্ষেপ	A zk-STARK (Zero-Knowledge Scalable Transparent Argument of Knowledge) is a cryptographic proof system allowing a prover to convince a verifier of a computation's correctness without trusted setup or revealing computational details. Introduced by Ben-Sasson and colleagues in 2018, zk-STARKs address a key limitation of zk-SNARKs: they require no preprocessing phase vulnerable to corruption. Instead, STARKs rely only on cryptographic hash functions, making them simpler, more transparent, and believed to be post-quantum secure.	A zk-SNARK (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge) is a cryptographic proof system that allows a prover to convince a verifier that a statement is true without revealing any information beyond the statement's validity. The acronym describes its key properties: it requires no interaction, proofs are short (succinct), and verification is efficient. zk-SNARKs were popularized by their application in the Zcash cryptocurrency but have since found use in blockchain scaling solutions, privacy-preserving computations, and verifiable computing.