Search

Search for projects by name or address

ZK Catalog

ZKsync Lite logo
ZKsync LiteMatter Labs

About

A Plonk proving system designed by Matter Labs to prove custom predefined state transitions of ZKsync Lite.


  • Total Value SecuredTVS
    $28.19 M0.23%

  • Trusted Setups

    Used in

    ApeX Omni logo

    Verifiers

    4

    Used in

    ApeX Omni logo

    Verifiers

    4

    Tech Stack

    zkVM
    Zksync
    BN254
    App-specific circuits
  • Total Value SecuredTVS
    $28.19 M0.23%
  • About

    A Plonk proving system designed by Matter Labs to prove custom predefined state transitions of ZKsync Lite.



    Total
    Canonically BridgedCanonically Bridged ValueCanonical
    Natively MintedNatively Minted TokensNative
    Externally BridgedExternally Bridged ValueExternal

    ETH & derivatives
    Stablecoins
    BTC & derivatives
    Other

    Proof systemThe infrastructure that allows projects to verify their state transitions. It is composed by onchain verifiers and offchain provers. The main two flavors are optimistic and ZK proof systems, but they can be combined in a hybrid model. In general though, if a system is able to accept state roots optimistically, even if it has a ZK component, it is considered an optimistic proof system.

    ZKSync Lite proverAn entity that generates the cryptographic proof to convince the verifier that the statement is true. In a ZK-Rollup, the prover generates the ZK (validity) proof to submit to the verifier contract. is a monolithic SNARKShort for "succinct non-interactive argument of knowledge", a SNARK is a widely used type of zero-knowledge proof that is short and fast to verify. Different kinds of SNARKs are usually systematized by proof size, verification time, and type of setup. The most famous SNARKs are Groth16, PLONK/Marlin, Bulletproofs, and STARKs. proving system that generates validity proofs for the state transition of ZKSync Lite L2Layer 2 (L2) is a category of technical solutions aimed to scale the base layer in a trust minimized way. This category includes solutions like rollups as well as state channels and plasma. Other solutions are able to scale further, but with the introduction of additional trust assumptions, which are therefore not trust minimized. Sometimes the term Layer 2 is used to refer to include these solutions too, like validiums and optimiums, but to distinguish between trust minimized and non trust minimized solutions they are often referred to as "light" L2s, opposed to "strong" L2s like rollups.. It is a Plonk system over BN254 curve with custom circuits designed to prove the specific state transition function of the L2, including deposits and withdrawals, transfers, swaps, NFT operations. The proof system itself is implemented in the bellman library, while many base cryptographic primitives are implemented in franklin library.

    Aztec Ignition

    Zksync

    Detailed description

    Aztec Ignition is a trusted setupGeneration of a piece of data that must then be used for some cryptographic protocol to run. Generating this data requires some secret information. The "trust" comes from the fact the secret must be destroyed after the ceremony, otherwise cryptographic properties of the protocol could be broken. Once the data is generated, and the secrets are forgotten, no further participation from the creators of the ceremony is required. There are two types of trusted setups for SNARKs: (i) trusted setup per circuit where it is generated from scratch for each circuit, (ii) trusted universal setup per proving system where it can be used for several circuits. ceremony for KZG commitmentsA polynomial commitment scheme that allows a prover to compute a commitment to a polynomial, with the properties that this commitment can later be opened at any position: the prover shows that the value of the polynomial at a certain position is equal to a claimed value. KZG is widely used as it’s applicable both for univariate and k-variate polynomials, is efficient for batch proofs, and is able to generate many proofs at once relatively fast. It is also proof generation time efficient: the time for prover to commit to a polynomial is linear on the degree of the polynomial. over BN254 curve that was run by Aztec for KZG commitment over BN254 curve in 2019. It included 176 participants and was publicly open for participation.

    List of different onchain verifiers for this proving system. Unique ID distinguishes different deployments of the same verifier from different verifiers (e.g. different versions).

    Plonk: Zksync

    Matter Labs Rust implementation of Plonk proving system, originally developed for ZKsync Lite (old ZKsync).

    Verifier
    Verification
    Used in
    Known deployments
    ZkLink verifier ApeX Omni
    ApeX Omni logo
    ZKsync Lite verifier 1
    ZKsync Lite verifier 4
    ZKsync Lite verifier 8