Welcome to Aztec's research library, a collection of papers, primers and articles to help you understand the mathematical magic underpinning Aztec's cryptosystems.
A technique using lookup tables to enable logic on 8-bit binary strings, enabling efficient hash verification of non-SNARK-friendly hashes e.g. SHA-256.
This new scheme abstracts the Kate polynomial commitment scheme to enable one committed point to prove that a number of polynomials have been evaluated at each of a fixed set of points. Summary by Ariel Gabizon, Aztec Chief Scientist.
A highly efficient universal SNARK, introducing a new circuit arithmetisation and the notion of 'selector polynomials', bound together by a permutation argument.
Demonstrating fast proof construction times over Pedersen hashes
Aztec's PLONK implementation delivers fast proof construction times over MiMC hashes
ZK-SNARK private assets are usually administrated using a pair of Merkle trees, a dense 'new note' tree and a sparse nullifier tree. This article explains the rationale for this architecture.