Announcing the Sapling MPC
Zcash’s shielded transactions rely on zk-SNARKs — small, fast-to-verify zero-knowledge proofs of arbitrarily complicated statements. These proving schemes rely on
Maintaining Privacy
We support science. Open scientific investigation is the only way for developers to learn what works and what doesn’t work
Updated Zcash UX Guidelines for Wallet Developers
We have updated our checklist of good UX practices with specific advice on handling Zcash features. Our intent is to
2018 Zcash Security Audit Details
We at Zcash are committed to the security and safety of our user community as we seek to empower everyone
Overwinter
Announcing Zcash Overwinter, the first “software-updates-required” network upgrade for Zcash. The purpose of Overwinter is to strengthen the protocol for
Cultivating Sapling: New Crypto Foundations
Zcash’s next major protocol upgrade, codenamed Sapling, will feature a number of improvements to the performance, security and usability of
Explaining SNARKs Part VII: Pairings of Elliptic Curves
<< Part VI In Part VI, we saw an outline of the Pinocchio zk-SNARK. We were missing two things –
Explaining SNARKs Part VI: The Pinocchio Protocol
<< Part V In part V we saw how a statement Alice would like to prove to Bob can be
Explaining SNARKs Part V: From Computations to Polynomials
<< Part IV In the three previous parts, we developed a certain machinery for dealing with polynomials. In this part,
Explaining SNARKs Part IV: How to make Blind Evaluation of Polynomials Verifiable
<< Part III In this part, we build on Part II and III to develop a protocol for verifiable blind
Bellman: zk-SNARKs in Rust
Bellman is a Rust-language library for building zk-SNARKs — small, cheap-to-verify zero-knowledge proofs of arbitrary computations. The goal of bellman
Explaining SNARKs Part III: The Knowledge of Coefficient Test and Assumption
<< Part II In Part II, we saw how Alice can blindly evaluate the hiding :math:`E(P(s))` of her polynomial :math:`P`
