Zero Knowledge Proofs

We now look at a second technique to build SNARKs that aims to fix some of the shortcomings in our previous exploration.

All the pieces are finally in place. Time to build our first real zk-SNARK.

A look at the bridge between the representation layer of problems, and the proving layer.

Now that we understand zero knowledge, we must take some time to inspect how it fares under non-interactivity.

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

The next step in our journey will see us looking at a new and important commitment mechanism, designed for polynomials

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

With commitment schemes at hand, we turn our attention once again to proving systems

Time to start building on top of the primitives we know so far!

After stocking up with hashes, now's time for another big protagonist of this ZK story!

Time for hashes to take the stage, bringing along a few cool tricks!

A broader look at the connection between different computation models, and the importance of arithmetic circuits

We now move forward to our first truly general computation correctness proving mechanism!

Before moving onto new proving systems, we must introduce a very necessary tool!

As we get closer to general proving systems, we are required to look at computation models, which brings us to circuits!

Equipped with finite fields and polynomials, it’s time to take a look at our very first proving system!

Time for our first basic mathematical concepts!

We embark on a new journey solely dedicated to ZK technology!

Moving on from Polkadot, we now cover the intersection between two cutting edge technologies: blockchain and zero knowledge proofs

Following from SNARKs, we now explore another type of knowledge proofs tailored for scalability

Let’s get practical, and build some arithmetic circuits!

This second round of zero knowledge proofs will take us on a journey to understand a more general framework. Hang tight!

Before moving on into more complex zero knowledge proofs, we need to introduce a new model: arithmetic circuits!

We take a leap into the world of zero-knowledge proofs by exploring one of the many ZKP protocols out there: Bulletproofs

A gentle introduction to some very useful schemes: key exchange, commitment schemes, zero-knowledge proofs, verifiable random functions