Confronta i metodi

	Consenso su Blockchain	HMAC	zk-SNARK
Campo	Crittografia	Crittografia	Crittografia
Famiglia	Machine learning	Machine learning	Machine learning
Anno di origine	2008	1997	2014
Ideatore	Satoshi Nakamoto	Hugo Krawczyk	Eli Ben-Sasson
Tipo	consensus mechanism	cryptographic authentication mechanism	zero-knowledge argument of knowledge
Fonte seminale	Nakamoto, S. (2008). Bitcoin: A peer-to-peer electronic cash system. Retrieved from https://bitcoin.org/bitcoin.pdf	Krawczyk, H., Bellare, M., & Crechanko, R. (1997). HMAC: Keyed-Hashing for Message Authentication. RFC 2104.	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.
Alias	consensus algorithm, PoW, PoS, distributed consensus	HMAC, keyed hash function	zk-SNARK, zero-knowledge proof, SNARK
Correlati	3	3	3
Sintesi	Blockchain consensus mechanisms are distributed protocols that enable a network of untrusted nodes to agree on the correct state of a ledger without a central authority. Introduced with Bitcoin in 2008, consensus mechanisms like Proof of Work and Proof of Stake ensure that modifications to the blockchain cannot be made unilaterally by any participant. Consensus mechanisms are fundamental to cryptocurrency and blockchain applications, making them resistant to tampering and censorship.	HMAC (Hash-Based Message Authentication Code) is a cryptographic algorithm for authenticating messages using a secret key and a hash function. Standardized in RFC 2104 (1997), HMAC can be combined with any cryptographic hash function (SHA-256, SHA-3, etc.) to create a message authentication code (MAC). HMAC provides both data integrity and authentication, detecting both accidental corruption and deliberate tampering, and is widely used in web security (TLS/SSL), API authentication, and network protocols.	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.