Jordi Baylina, a core developer of Polygon zkEVM, an upcoming L2 scaler on zero-knowledge proofs (ZKPs), has responded to the co-founder of Solana, Anatoly Yakovenko, who said that provers have not been able to keep up with the chain developments.
Yakovenko was talking about scaling solutions in regard to blockchain development.
Yakovenko claimed on Twitter that provers, elements of L2 systems responsible for the validity of transactions broadcast to the L1 mainnet, have not been able to keep up with the underlying chain.
Provers can only maintain the same speed as the L1 when data loads are intermittent. This requirement, however, cannot be met in real blockchain systems.
As a result, the only productive way Solana [SOL] addresses the scaling problem is to process a never-ending chain of state dependencies.
Polygon’s (MATIC) Jordi Baylina dismisses Attack on ZK rollups
Baylina discussed the true limitations of ZK-centric designs, stating his disagreements.
The data aggregation processes between L1 and L2, according to Baylina, can be organized in parallel proof trees. This system is adaptable and free of design constraints, at least in the case of Polygon’s zkEVM (MATIC).
“So you can build a tree of proofs where the root proves a full chain segment. You can build this tree with the shape you want and in parallel,” stated Baylina.
Baylina added that in the case of Polygon’s (MATIC) zkEVM, the sending of aggregated proof on-chain is a one-time event that takes 30 minutes.
However, there are some limitations to ZK-based systems. Data availability issues, for example, have yet to be addressed. In this regard, implementing danksharding and the EIP 4844 update may be beneficial to Ethereum (ETH) and its rollups.
Polygon [MATIC] will launch its zkEVM scaling solution towards the end of March this year. It is expected to break through resource-efficiency and transactional speed barriers for Ethereum-based blockchain systems.
Source : ambcrypto
