Merklization organizes blockchain data into Merkle trees, enabling efficient and secure verification of transactions and states through succinct proofs. Solana’s Merklization poses several challenges. Firstly, it merklizes transactions into multiple roots per block, complicating the creation of global state proofs. Additionally, state roots are calculated only once per epoch (approximately 2.5 days) and are not included in block headers. This absence of state roots in block headers makes verifying state and inclusion proofs difficult.

​
SOON’s Merklization Solution

  • Integration of Merkle Patricia Tries (MPT): Adopts the MPT model tailored for Solana’s account structure to manage and verify state efficiently.
  • Unique Entries for State Roots: Introduces UniqueEntry traits to embed state roots directly into SVM-based blockchains.
  • Periodic State Root Updates: Computes and submits state roots and withdrawal roots every 450 slots to Layer 1, ensuring consistent and verifiable state.
  • Fault-Proof Mechanisms: Supports inclusion proofs allowing validators to independently verify transaction integrity and state consistency.

​
Benefits of Merklization in SOON

  • Enhanced Security: Enables robust inclusion and fraud proofs, ensuring transaction and state integrity.
  • Improved Scalability: Efficient state management supports high transaction throughput and seamless Layer 1 integration.
  • Interoperability: Aligns with Ethereum’s MPT model, facilitating cross-chain operations and compatibility with existing blockchain infrastructures.
  • Support for Light Clients: Consistent state roots enable the development of light clients, enhancing accessibility and security.
  • Trustless Interactions: Ensures secure bridging between Layer 2 and Layer 1 through Merkle trees, enabling trustless verification of withdrawal transactions.
For more technical details, please dive into the article co-authored by Andrew on SOON and JoeC on Anza:

SVM Merklization on SOON