Papers › Modeling the Block Verification Time of Zcash
Modeling the Block Verification Time of Zcash
Fabian Stiehle, Erik Daniel, Florian Tschorsch
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
An important aspect of the propagation delay in blockchain networks is the block verification time, which is also responsible for the so-called verifier's dilemma. Models for the block verification time can help to understand and improve the verification process. Moreover, modeling the verification time is necessary for blockchain network simulations. In this paper, we present JOIST, a new model for the block verification time of Zcash. We identify computationally complex operations in the verification process of Zcash, and derive our model based on characteristic transaction features. We evaluate JOIST and show that the model is consistently more accurate than existing models, which consider the block size only.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections