Ethereum layer 2 scaling has needs for running expensive compute offchain with efficient verification on chain.
-
Zero knowledge
- Polynomial Commitment Scheme
- KZG Polynomial Commitment Scheme
- FRI
- Binius
- Interactive oracle proof
- Fiat shamir transformation makes it non-interactive
- Arithmatic Circuits and Constrains System
- R1CS
- PLONK, Groth16
- Proof composition
- Sum check protocol
- GKR Protocol
- Optimize
- Prover efficiency
- Prover succintness
- Verifier efficiency
- Trusted setup
- Recursive SNARK
- Polynomial Commitment Scheme
-
Rollup
- Optimistic rollup
- Post data to layer 1 and assume it's correct
- Use fraud proofs
- Withdrawal time long, so liquidity exits are given by hop protocol and connext
- ZK Rollup
- Should be validity rollup, as ZK property noy used in general, succintness is used
- Use validity proofs
- ZK-SNARK - validity proof
- zkSync
- Computational extensive
- Optimistic rollup
-
Rollups
- Sidechain
- All transactions are handled in the sidechain
- SNARK
- ZK Rollups
- Loopring
- Deversifi
- zkSync
- Optimistic rollups
- Optimism
- ZK Rollups
-
Channels
- State channels
- Raeden
- Lightening
- Payment Channels
- State channels
-
Plasma
- child chain
- OMG
- Polygon Matic
-
Sidechains
- xDai
-
Rollups and Data Availability - Building a Modular Blockchain Stack
-
Projects
- Polygon Hermez
- Polygon Nightfall
- Polygon Miden zkEVM
- Polygon Zero
- zkSync Era
- StarkNet
- Scroll
- SNARK / zk SNARK
- A succinct proof that something is true
- Private transactions on the public blockchain
- Compliance
- Online both party
- Maintaining confidentiality
- Building a SNARK
- ZKEVM
- ZKSync