Indexed Merkle Tree (Nullifier Tree)
Learn about indexed merkle trees, an efficient data structure for nullifier trees that enables fast non-membership proofs and batch insertions in Aztec.
Learn about indexed merkle trees, an efficient data structure for nullifier trees that enables fast non-membership proofs and batch insertions in Aztec.
Understand how Aztec's note tagging system allows users to efficiently discover and decrypt notes that belong to them without relying on brute force or off-chain communication.
Learn how Aztec manages public and private storage slots, siloing data by contract address to maintain privacy and prevent cross-contract data collisions.