Pith. sign in

REVIEW 1 cited by

Optimal AoI-based Block Propagation and Incentive Mechanism for Blockchain Networks in Web 3.0

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.12807 v2 pith:WQNTTBGT submitted 2024-03-19 cs.GT

classification cs.GT
keywords blockpropagationblockchainsaobiproposeblockchaindataefficiency
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Web 3.0 is regarded as a revolutionary paradigm that enables users to securely manage data without a centralized authority. Blockchains, which enable data to be managed in a decentralized and transparent manner, are key technologies for achieving Web 3.0 goals. However, Web 3.0 based on blockchains is still in its infancy, such as ensuring block freshness and optimizing block propagation for improving blockchain performance. In this paper, we develop a freshness-aware block propagation optimization framework for Web 3.0. We first propose a novel metric called Age of Block Information (AoBI) based on the concept of age of information to quantify block freshness. AoBI measures the time elapsed from the freshest transaction generation to the completion of block consensus. To make block propagation optimization tractable, we classify miners into five different states and propose a block propagation model for public blockchains inspired by epidemic models. Moreover, considering that the miners are bounded rational, we propose an incentive mechanism based on the evolutionary game for block propagation to improve block propagation efficiency. Numerical results demonstrate that compared with other block propagation mechanisms in public blockchains, the proposed scheme has a higher block forwarding probability, which improves block propagation efficiency and decreases the minimum value of average AoBI.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. VietMed-MCQ: A Consistency-Filtered Data Synthesis Framework for Vietnamese Traditional Medicine Evaluation

    cs.CL 2026-01 conditional novelty 5.0 of 10

    A dual-model consistency filter and a 94.2% expert-approved sample back VietMed-MCQ, a 3,190-question Vietnamese Traditional Medicine quiz where Qwen2.5 models beat Vietnamese-specialized models by 7.2%.

Pith tools