Disclaimer:All content on this platform is sourced from the internet and is provided for informational purposes only. None of the content represents the views of this site, nor does it constitute investment advice. Please exercise caution when investing.
Vitalik outlines the execution layer roadmap, covering state trees and virtual machine changes
Svmuu News: Vitalik posted on social media outlining the execution layer roadmap, with a focus on two key adjustments: the state tree and the virtual machine. Regarding the state tree, EIP-7864 supports upgrading the current hexadecimal Merkle-Patricia tree to a binary tree structure based on more efficient hash functions, thereby shortening Merkle branch lengths and reducing verification bandwidth costs. The hash functions can utilize the Blake3 or Poseidon series. The binary tree solution also groups storage slots into pages to reduce the cost of accessing adjacent storage and reserves metadata bits for future state expiration features. Regarding the virtual machine, Vitalik Buterin proposed a long-term direction of replacing the EVM, potentially adopting the RISC-V architecture. The new virtual machine must improve execution and proof efficiency, support client-side generation of ZK proofs, and simplify code implementation. The deployment path involves first replacing precompiled contracts, then supporting the deployment of new virtual machine contracts, and ultimately achieving backward compatibility while gradually replacing the EVM.
Disclaimer: This content reflects the author's personal views only and does not constitute investment advice. If you find any violations, please Click to Report
Recommended Reading


