City Research Online

Abstract

Early open blockchain designs face low throughput, high latency, and prohibitive costs for setting up a full node. New designs improve this with innovative mechanisms for handling transactions and the blockchain state, often assuming locality properties in the workload of transactions. Temporal locality allows efficient space management such as light nodes or snapshot-based bootstrap. Disjoint access parallelism, which depends on spatial locality, enables parallel processing of non-conflicting transactions. We analyze locality properties and their interplay in the largest transactional workload available to date, that of Ethereum. Our results show that, although transactions generally display good locality, a minority of accounts are responsible for caching- or parallelism-unfriendliness, calling for specific identification and handling in future blockchain designs.

Publication Type:	Conference or Workshop Item (Paper)
Additional Information:	© 2024 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Subjects:	H Social Sciences > HG Finance H Social Sciences > HN Social history and conditions. Social problems. Social reform Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments:	School of Science & Technology School of Science & Technology > Computer Science
SWORD Depositor:	Symplectic Administrator

Export

Downloads