Опубликована: Май 16, 2025
Язык: Английский
Опубликована: Май 16, 2025
Язык: Английский
Future Internet, Год журнала: 2025, Номер 17(2), С. 72 - 72
Опубликована: Фев. 7, 2025
This study addresses a critical challenge in modern blockchain systems: the excessive size of Merkle proofs state verification, which significantly impacts scalability and efficiency. As highlighted by Ethereum’s founder, Vitalik Buterin, current Patricia Tries (MPTs) are highly inefficient for stateless clients, with worst-case reaching approximately 300 MB. We present comprehensive probabilistic analysis path length distributions MPTs to optimize proof while maintaining security guarantees. Our novel mathematical model characterizes distribution lengths tries containing random validates it through extensive computational experiments. The findings reveal logarithmic scaling average respect number addresses, unprecedented precision predicting structural properties across scales from 100 million addresses. research demonstrates remarkable accuracy, discrepancies between theoretical experimental results not exceeding 0.01 all tested scales. By identifying verifying right-skewed nature distributions, we provide insights optimizing generation reduction. practical implementation guidelines demonstrate potential reductions up 70% optimized structuring node layout. work bridges gap computer science engineering, offering immediate applications client optimization efficient state-proof generation.
Язык: Английский
Процитировано
0Lecture notes in computer science, Год журнала: 2025, Номер unknown, С. 127 - 139
Опубликована: Янв. 1, 2025
Язык: Английский
Процитировано
0Digital Communications and Networks, Год журнала: 2025, Номер unknown
Опубликована: Апрель 1, 2025
Язык: Английский
Процитировано
0Lecture notes in networks and systems, Год журнала: 2025, Номер unknown, С. 282 - 294
Опубликована: Янв. 1, 2025
Язык: Английский
Процитировано
0Опубликована: Май 16, 2025
Язык: Английский
Процитировано
0