Polynomials

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

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

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!

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

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!

An expansion upon the ideas behind simpler commitment schemes, providing important tools for more complex constructions down the road

Combining polynomials and digital signatures brings forth a cool new functionality, in the form of Threshold Signatures!

Polynomials play an important role in many cryptographic applications. This article is dedicated to giving a brief intro to the topic