Last month, the second and final public testnet for Polygon zkEVM went live. Included in that rollout were meaningful improvements to the throughput, latency, and efficiency of the prover.In the first testnet, Polygon’s Hermez team, lead by Jordi Baylina, deliberately throttled performance to prioritize controlled testing of the soundness and correctness of the prover. | polygon.technology
The very first recursive proofs of general computation, now live on Ethereum Mainnet| Medium
An in-depth look at using recursion and recursive proofs in o1js to create efficient, infinitely growing structures for applications like Mina. Learn how to use o1js for constructing and verifying simple and complex recursive programs in your zkApp.| docs.minaprotocol.com
Zero-Knowledge Proofs (ZKPs), which generate evidence for a third party to confirm the accurate execution of a computation, and Fully Homomorphic Encryption (FHE), which enables calculations on encrypted data, will be combined with distributed systems algorithms, that are capable of tolerating significant network failures and similar to those employed by Bitcoin. Together they will be utilized to comply with regulations while creating trustless applications.| LambdaClass Blog
Introduction During the last few months, we have been developing a bridge between Mina and Ethereum. Mina is a layer-1 blockchain that uses zero-knowledge proofs (zk-SNARKs) to maintain its size at 22 kB. The bridge serves two purposes: 1. Allowing cross-chain transactions seamlessly. 2. Allowing applications to leverage Mina's zero-knowledge| LambdaClass Blog
Introduction Over the last decade, SNARKs (succinct, non-interactive arguments of knowledge) and STARKs (scalable, transparent arguments of knowledge) have been gaining attention due to their applications in verifiable private computation and scalability of blockchains. Groth introduced this proof system in 2016 and saw an early application in ZCash. The protocol| LambdaClass Blog