Nullifier Sets

Algorithm

Nullifier Sets represent a cryptographic commitment scheme integral to zero-knowledge proofs, particularly within zero-knowledge rollups like StarkNet and zkSync. These sets function by storing hashes of transferred tokens, enabling efficient detection of double-spending attempts without revealing transaction details. The core principle involves a Merkle tree structure where each leaf node corresponds to a token transfer, and the root hash serves as a succinct representation of the entire set. Consequently, inclusion proofs demonstrate a token’s validity, while nullifier sets prevent the reuse of previously spent tokens, ensuring transactional integrity.