Vitalik Buterin outlined the execution layer roadmap in a social media post, highlighting key adjustments to the state tree and virtual machine. Regarding the state tree, it supports upgrading the current hexadecimal Merkle Patricia tree to a binary tree structure based on a more efficient hash function via EIP-7864. This shortens Merkle branch lengths and reduces verification bandwidth costs. The hash function can be either Blake3 or Poseidon series. The binary tree scheme also groups storage slots into pages to reduce the cost of accessing adjacent storage and reserves metadata bits for future state expiration functionality. On the virtual machine side, Vitalik Buterin proposed a long-term direction of replacing the EVM, potentially using a RISC-V architecture. The new virtual machine needs to improve execution and proof efficiency, support ZK proof generation on the client side, and simplify code implementation. The deployment path includes first replacing pre-compiled contracts, then supporting the deployment of new virtual machine contracts, ultimately achieving backward compatibility and gradually replacing the EVM.