From f1be8409143ce5edaaefcaed9f6fe9365f7db992 Mon Sep 17 00:00:00 2001 From: Paul Gebheim Date: Mon, 20 Nov 2023 23:25:31 -0800 Subject: [PATCH] Update README.md (#1371) --- evm/README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/evm/README.md b/evm/README.md index accde940..b15bd776 100644 --- a/evm/README.md +++ b/evm/README.md @@ -1,10 +1,10 @@ -# Recursive Stateless ZK-EVM +# Provable Stateless ZK-EVM -Included here is an implementation of a stateless, recursive ZK-EVM client implemented using Plonky2. It currently supports the full Merkle-Patricia Tree and has all Shanghai opcodes implemented. +Included here is an implementation of a stateless, recursive ZK-EVM client implemented using Plonky2. It currently supports the full Merkle-Patricia Trie and has all Shanghai opcodes implemented. ## Performance -This implementation is able to provide transaction level proofs which are then recursively aggregated into a block proof. This means that proofs for a block can be efficiently distributed across a cluster of computers. As these proofs use Plonky2 they are CPU and Memory bound. The ability to scale horizontally across transactions increases the total performance of the system dramatically. End-to-end workflows are currently in progress to suport this proving mode against live evm networks. +This implementation is able to provide transaction level proofs which are then recursively aggregated into a block proof. This means that proofs for a block can be efficiently distributed across a cluster of computers. As these proofs use Plonky2 they are CPU and Memory bound. The ability to scale horizontally across transactions increases the total performance of the system dramatically. End-to-end workflows are currently in progress to support this proving mode against live evm networks. Furthermore the implementation itself is highly optimized to provide fast proving times on generally available cloud instances and does not require GPUs or special hardware.