Ofelimos: Combinatorial Optimization via Proof-of-Useful-Work

Fitzi, Matthias; Kiayias, Aggelos; Panagiotakos, Giorgos; Russell, Alexander

doi:10.1007/978-3-031-15979-4_12

Cited by 7 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, when a sharding blockchain is scaled to contain more participants and shards, it is even promising to achieve higher transaction throughput, as multiple shards are expected to process different transactions in parallel [38]. Currently, significant attention has been directed towards blockchain sharding, with notable examples including [3,10,15,23,28,29,33,37,53,55].…”

Section: Introductionmentioning

confidence: 99%

FleetChain: A Secure Scalable and Responsive Blockchain Achieving Optimal Sharding

Liu

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Sharding enhances blockchain scalability by dividing the network into shards, each managing specific unspent transaction outputs or accounts. As an introduced new transaction type, cross-shard transactions pose a critical challenge to the security and efficiency of sharding blockchains. Current solutions, however, either prioritize security with assumptions and substantial investments, or focus on reducing overhead and overlooking security considerations.In this paper, we present Kronos, a generic and efficient sharding blockchain consensus ensuring robust security. At the core of Kronos, we introduce a "buffer" mechanism for atomic crossshard transaction processing. Shard members collectively maintain a buffer to manage cross-shard inputs, ensuring that a transaction is committed only if all inputs are available, and no fund is transferred for invalid requests. While ensuring security including atomicity, Kronos processes transactions with optimal intra-shard communication overhead. A valid cross-shard transaction, involving 𝑥 input shards and 𝑦 output shards, is processed with a minimal intra-shard communication overhead factor of 𝑥 + 𝑦. Additionally, we propose a reduction for transaction invalidity proof generation to simple and fast multicasting, leading to atomic rejection without executing full-fledged Byzantine fault tolerance (BFT) protocol in optimistic scenarios. Moreover, Kronos adopts a newly designed "batch" mechanism, reducing inter-shard message complexity for cross-shard transactions from O (𝜆) to O ( 𝑚log𝑚 𝑏 𝜆) without sacrificing responsiveness (where 𝑚 denotes number of shards, 𝑏 denotes the batch size of intra-shard consensus, and 𝜆 is security parameter).Kronos operates without dependence on any time or client honesty assumption, serving as a plug-in sharding blockchain consensus supporting applications in diverse network environments including asynchronous ones. We implement Kronos using two prominent BFT protocols: asynchronous Speeding Dumbo (NDSS'22) and partial synchronous HotStuff (PODC'19). Extensive experiments (over up to 1000 AWS EC2 nodes across 4 AWS regions) demonstrate Kronos achieving a substantial throughput of 68.6ktx/sec with 1.7sec latency. Compared with state-of-the-art solutions, Kronos outperforms in all cases, achieving up to a 42× improvement in throughput and a 50% reduction in latency when cross-shard transactions dominate the workload. CCS CONCEPTS• Security and privacy → Distributed systems security.

show abstract