How Ouroboros Samasika Upholds Mina’s Goals of Decentralization
Mina Protocol leverages Ouroboros Samasika, a succinct proof-of-stake consensus mechanism, to achieve strong decentralization properties.
Discover the latest about Mina-catch up with what's new about the tech and community, participate in conversations we're having, and read what others have to say.
Mina Protocol leverages Ouroboros Samasika, a succinct proof-of-stake consensus mechanism, to achieve strong decentralization properties.
The entire Mina blockchain is about 22kb - the size of a couple of tweets.
In PLONK (considered as an interactive oracle proof), the prover sends the verifier several polynomials. They are evaluated at some k points during the course of the protocol. Of course, if we want zero-knowledge, we would require that those evaluations do not reveal anything about the proof's underlying witness.
Pickles is a new proof system and associated toolkit that is the first deployed SNARK capable of recursive composition with no trusted setup.
Blockchain architectures today are very inefficient at being both scalable and decentralized, a challenge widely referred to as the scalability trilemma. In this piece, I propose a new mental model called ScaDe (Scalability-per-unit-of-Decentralization) that helps the industry design better blockchains.
An explanation of how Coda Protocol uses recursive zk-SNARKs to enable a succinct blockchain and solve legacy blockchain issues of decentralization and scalability.
In a one-of-a-kind opportunity for community members, Coda Protocol’s Genesis token program will prepare participants to become the first block producers upon mainnet launch.
What if we could, without trust, interact with other parties, and be assured through cryptography that our data would never be leaked? This is where zk-SNARKs come in. In the same way that Bitcoin was a call to action around reasserting our financial ownership, SNARKs in the same vein will help us assert our computational ownership.
The Complete Guide to Crypto's Most Powerful Proofs
Zero-knowledge proofs (ZKPs) are a powerful cryptographic primitive that enables you to prove that you have a secret, without revealing it to anyone. If you are hearing about ZKPs for the first time, you are likely to say "Hah! That sounds impossible." Read on to get an intuitive understanding of what they are.
Simulating real numbers using finite field arithmetic
A global competition to speed up the SNARK prover
Mina uses advanced cryptography and recursive zk-SNARKs to deliver true decentralization at scale.
Mina makes it simple to run a node, build and join the community.
