The next major Zcash protocol upgrade, called Sapling, has been delayed by six weeks (one release cycle). Sapling introduces significant efficiency improvements for shielded transactions that will pave the way
The Overwinter network upgrade will include a new feature called ‘Transaction Expiry.’ This will allow transactions in the mempool to expire after a given number of blocks, effectively timing out
Zcash’s shielded transactions rely on zk-SNARKs — small, fast-to-verify zero-knowledge proofs of arbitrarily complicated statements. These proving schemes rely on a set of public parameters that can be used to
We support science. Open scientific investigation is the only way for developers to learn what works and what doesn’t work to protect users and fulfill our mission. Today, George Kappos,
We have updated our checklist of good UX practices with specific advice on handling Zcash features. Our intent is to provide Zcash wallet developers with guidance on making design decisions
We at Zcash are committed to the security and safety of our user community as we seek to empower everyone with economic freedom and opportunity. Zcash has engaged five leading
Announcing Zcash Overwinter, the first “software-updates-required” network upgrade for Zcash. The purpose of Overwinter is to strengthen the protocol for future network upgrades, paving the way for the Zcash Sapling
Zcash’s next major protocol upgrade, codenamed Sapling, will feature a number of improvements to the performance, security and usability of our shielded transactions. This is the first in a series
<< Part VI In Part VI, we saw an outline of the Pinocchio zk-SNARK. We were missing two things – an HH that supports both addition and multiplication that is
<< Part V In part V we saw how a statement Alice would like to prove to Bob can be converted into an equivalent form in the “language of polynomials”
<< Part IV In the three previous parts, we developed a certain machinery for dealing with polynomials. In this part, we show how to translate statements we would like to
<< Part III In this part, we build on Part II and III to develop a protocol for verifiable blind evaluation of polynomials, which we will define shortly. In Part
