ZK Lang
The goal of our project is to build zero-knowledge proof systems for optimization, search, and parsing tasks, as well as building languages for implementing zero-knowledge proof systems.
Team
Projects
Coral: Fast Succinct Non-Interactive Zero-Knowledge CFG Proofs
Coral is designed for parsing. It can prove that a commitment to byte stream is correctly parsed into a structured object. It has applications to:
- Parsing in zk-TLS and zkAuthorization systems
- Proving that JSON Web Tokens are correctly constructed
- Enhancing zk-Middlebox systems to understand formats like JSON
Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex Proofs
Reef generates efficient zero-knowledge proofs for applications like:
- Proving the strength of passwords
- Proving the provenance of email despite redactions
- Proving the validity of oblivious DNS queries
- Proving the existence of mutations in DNA
Otti: Efficient Representation of Numerical Optimization Problems for SNARKS
Otti shows how to use (probabilistic) certificates of optimality to build an NP checker that makes it possible to generate zero-knowledge proofs for:
- Proving optimality of scheduling and resource allocation tasks
- Proving training of simple neural networks
Spice: Proving the correct execution of concurrent services in zero-knowledge
Spice was the first project to incorporate offline memory checking (read set/write set checks) into ZK Proofs. Spice makes it possible to generate zero-knowledge proofs for applications like:
- Inter-bank transactions
- Blockchain aggregators (rollups)
- Dark pools