Solana has developed a solution that addresses one of the main obstacles to mainstream adoption.
The proposed amendments introduces new a "lattice-based" Hashing is a system which fundamentally alters the way in which blockchains track and verify user accounts.
The proposal, if approved, could become a benchmark for blockchain scaling, possibly influencing the way other networks address similar scaling issues.
"The main goal is to scale Solana to billions [of] accounts and compute a "Hashing of all Accounts" in practical time and space," You can also find out more about the following: You can also find out more about the proposal by clicking here. The article outlines a solution for the long-standing problem of high performance blockchains.
Solana, and all other blockchains must recalculate every user account on a regular basis. This process is becoming more demanding with the growth of the network.
This issue is known as the "state growth problem" among blockchain developers. Solana Labs co-founder Anatoly Yakovenko Discussed The challenge of May, last year.
"The problem comes down to this simple thing: New account creation has to actually create new accounts. Which means that a new account has to prove that it is new somehow," Yakovenko said.
Accounts’ Lattice hash eliminates the requirement to calculate again.
This approach is based on an advanced cryptographic method called "homomorphic hashing" The network can update state verification only by processing new accounts.
This new system maintains the 128-bit level of security while reducing computation overhead dramatically.
According to its authors, early implementations have yielded promising results. Two validator clients — Agave, and Firedancer — demonstrated the system’s practical viability. Decrypt Yakovenko, the author of this article has been reached to get more information.
The upgrade will be introduced through Solana's formal improvement process, requiring network-wide activation through validator voting.
The developers recommend that the roll-out be gradual, so nodes can precompute before activating fully.
Sebastian Sinclair edited the book