Reading list for ZKP algorithms and implementations

Are you looking into various Zero Knowledge Proof algorithm and tools? Do you wonder which ones are the most relevant algorithms and implementations? What are the differences between the different approaches? Then you found the right blog entry! This is an introduction to the ZKP Vault page - you’ll find information how to view it locally, and how to add new information under local usage.

ZKPs Timeline

When we started the e-ID project, we were mostly aware of Native Sigma Protocols which allow to create equality checks, range proofs, or other simple proofs using Pedersen Commitments. A set of new algorithms allowed to do various optimized proofs, but there were no equality proofs between their blinding algorithms, so Composed Proofs were used to link these different optimized algorithms. Then came ZKP Circuits, first as a computationally expensive generic solution, but which could compile a high level representation of the proof, e.g., a DSL, into a constraint system like R1CS or other. Since 2026, ZKP Virtual Machines can create proofs about even more complex programs which interact with other programs.

Research Papers

The mkdoc view of [ZKP Vault] offers various entry-points to our resources, and mkdoc’s search functionality runs locally in your browser. In Resources/Papers we list all papers which we think are relevant to the current state of ZKPs. This is similar to ZKProof Wiki, but we took advantage of Claude to fill all templates for the papers in the list.

Local ZKP-Vault Usage

The easiest way to browse the ZKP-Vault is by browsing it on the github page. It is updated automatically with every push to the main branch.

For local usage, clone the repository, and then open it as a vault in Obsidian.

If you want to add new papers, you can find information in the README. Of course, you can also ask your LLM to do it:

Follow the instructions in README.md to add the following paper:

URL-TO-THE-PAPER