OAK

VRF-PoW: Proof of Work Consensus With Verifiable Random Function

Metadata Downloads
Author(s)
Kim, SeungminChoi, HaeungYoon, MinhoLee, Heungno
Type
Article
Citation
IEEE Transactions on Network Science and Engineering, v.13, pp.6293 - 6309
Issued Date
2026-01
Abstract
Proof of Work (PoW) is a fundamental and widely adopted consensus mechanism in blockchain systems that enables effective consensus in permissionless environments, solely through block propagation without additional message exchange between nodes. However, PoW can result in excessive energy consumption and network centralization. This paper proposes VRF-PoW, a novel consensus protocol that reduces energy consumption while preserving the decentralized and permissionless nature of PoW. The VRF-PoW method integrates Verifiable Random Functions (VRFs) into the PoW process, reducing network energy consumption. To prevent Sybil attacks, this work introduces a pre-PoW phase. Further, this work validates VRF-PoW via a theoretical analysis and numerical evaluation. The results demonstrate that VRF-PoW significantly reduces energy consumption compared to the traditional PoW, while maintaining decentralization, stable block generation, and network liveness. © 2013 IEEE.
Publisher
IEEE Computer Society
ISSN
2327-4697
DOI
10.1109/TNSE.2026.3657405
URI
https://scholar.gist.ac.kr/handle/local/33612
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.