Rediscover mathematics, cryptography, computer science and more through engaging articles.
Featured Post
A short exploration on the intersection of privacy and auditability, and the ideas and techniques we use to reconcile them.
Transparency is now solved, but there's still the question of efficiency. Time to get creative with the domains we compute over.
All the pieces are finally in place. Time to build our first real zk-SNARK.
It's finally time to formalize what "zero knowledge" truly means
The next step in our journey will see us looking at a new and important commitment mechanism, designed for polynomials
No trusted setup, no pairings, and no problem: STARKs take a radically different path, and it starts with a new way to think about computation.
A look at the bridge between the representation layer of problems, and the proving layer.
We explore the mysterious and misunderstood concept of entropy, and discover how it pops up in unexpected places.
Before we go on any further, we must stop and take a look at one of the most important algorithms enabling most of the things we're doing
We now look at a second technique to build SNARKs that aims to fix some of the shortcomings in our previous exploration.
Now that we understand zero knowledge, we must take some time to inspect how it fares under non-interactivity.
With commitment schemes at hand, we turn our attention once again to proving systems
arkana
