if (foo) {  bar();  } else {    baz();  }           π v Block Txn

Trust, succinctly.

Mir is a distributed ledger for decentralized applications.

It uses cryptographic proofs to verify transactions, improving security and scalability.

Layer 1

The Problem with Decentralization

On existing blockchains, nodes verify each transaction by downloading it and executing the associated computation.

This is expensive and inefficient, especially for decentralized applications.

We need to verify transactions, but replicating computations 10,000+ times limits throughput.

Layer 1

Succinct Verification

We have amazing cryptographic tools called SNARKs that allow anyone to verify the output of a computation without re-executing it.

To create a transaction for any application, just a single node needs to perform a computation and generate a tiny, easily-verified proof.

There's no gas pricing, no huge state growth, and anyone can be a validator.

Recursive Verification

Since every transaction is accompanied by a proof, and proofs can be recursively verified, we could verify billions of transactions with a single proof, even for complex decentralized applications.

We can have a protocol with rich functionality, high throughput, and a decentralized validator pool, without diminished security or complex mechanisms like sharding.

The Team

Brendan Farmer

Brendan Farmer

Brendan was part of the founding team of a startup that was later acquired. He then studied math as an A.B. Duke Scholar.

Daniel Lubarov

Daniel Lubarov

Daniel came from Google, where he worked on Glass and Pixel Buds. Prior to that, he worked at Square where he built scalable and fault tolerant payment systems. He studied computer science at Harvey Mudd.

Stay Tuned

Mir is an early stage project. If you'd like to hear about our progress, please subscribe to our newsletter, where we will announce research publications and other major project updates.