Layer 2 (L2) solutions have recently been developed with the aim of increasing scalability and throughput of traditional blockchain networks such as Bitcoin and Ethereum. The main idea of L2 is to move expensive computations out of the main (L1) network and post back only a summary of the performed transactions. This allows L2 solutions to inherit the security and trustworthiness of L1 while reducing computation and transaction costs. However, data availability, namely the possibility for all blockchain participants to access the data processed outside L1 to verify state transitions independently, is a challenge in L2 solutions. Namely, while on-chain data availability approaches suffer from high costs and long waiting times, off-chain approaches can pose data security risks. This paper takes into consideration the recent introduction of the blob data structure and proposes an Adaptive Multi-Factor Scoring (AMFS) to efficiently manage blobs while dynamically optimizing cost and waiting time. The proposed solution ensures low waiting times and blob posting costs, particularly for small rollups, by implementing the concept of shared blob, maintaining security without compromising performance.
Adaptive Multi-Factor Scoring in Shared Blob for Improving Data Availability in Layer 2 Blockchains
Saif, Muhammad Bin;Migliorini, Sara;Spoto, Fausto
2025-01-01
Abstract
Layer 2 (L2) solutions have recently been developed with the aim of increasing scalability and throughput of traditional blockchain networks such as Bitcoin and Ethereum. The main idea of L2 is to move expensive computations out of the main (L1) network and post back only a summary of the performed transactions. This allows L2 solutions to inherit the security and trustworthiness of L1 while reducing computation and transaction costs. However, data availability, namely the possibility for all blockchain participants to access the data processed outside L1 to verify state transitions independently, is a challenge in L2 solutions. Namely, while on-chain data availability approaches suffer from high costs and long waiting times, off-chain approaches can pose data security risks. This paper takes into consideration the recent introduction of the blob data structure and proposes an Adaptive Multi-Factor Scoring (AMFS) to efficiently manage blobs while dynamically optimizing cost and waiting time. The proposed solution ensures low waiting times and blob posting costs, particularly for small rollups, by implementing the concept of shared blob, maintaining security without compromising performance.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.