The Algorand (ALGO) project has developed a new cryptographic primitive called Pointproofs. The squad believes they are a significant improvement to the Merkle proofs used in many blockchain systems.

Cointelegraph spoke with Sergey Gorbunov, Algorand'south head of cryptography, to learn more than about the paper that he and his team published on April 19.

A major development for stateless blockchains

Smart contract blockchains like Algorand and Ethereum (ETH) rely on sharing a common state, which is the sum of all business relationship balances and smart contract variables that define the blockchain.

A major outcome with this approach is that the state tends to go swollen over time, making the blockchain progressively harder to validate.

In order to fix this, both Algorand and Ethereum are working to implement a "stateless" approach. Instead of storing the entire country, nodes would simply compute the changes to the land from ane block to the next, relying on cryptographic commitments to ensure that these changes are valid.

This arroyo still requires nodes that concur the unabridged state, but they are no longer necessary for consensus. Gorbunov noted:

"By decoupling who stores the state versus who tin can run the consensus, you are enabling more people to participate in the consensus itself."

Megabytes of saved bandwidth

The traditional manner of using Merkle proofs adds meaning overhead restrictions for each transaction. Gorbunov explained that each transaction needs 320 bytes of data for one proof. In a sample of 10,000 transactions, "that ends up being a three.2 megabyte overhead, if y'all were to use Merkle trees," explained Gorbunov.

This poses major issues for a stateless blockchain. Ane of the tradeoffs of this approach is a significant increase in network bandwidth when propagating new blocks, an issue that could hinder its functioning.

This is where Pointproofs come in. They utilize pairing-based cryptography to let the aggregation of multiple proofs. The benefits are meaning, as he explained:

"Every proof itself submitted past private users is merely 48 bytes. So you lot tin can accept these x,000 proofs in a block of transactions and aggregate them once more."

The upshot is just one 48 byte proof that can still be verified equally entirely right for all transactions.

Not just for Algorand

Merkle copse operate across many blockchains, including in Bitcoin (BTC) block headers. While Gorbunov explained that Bitcoin is unlikely to need Pointproofs due to having only one Merkle tree per cake, he believes that Ethereum'south stateless client implementation may benefit from them.

According to Gorbunov, Ethereum developers are considering a dissimilar solution named polynomial commitments, "which are non ideal," he said. He argued that Pointproofs would be an improvement, urging Ethereum developers to consider including them.