VRDF: a network slicing algorithm based on VRF and VDF

Abstract

Blockchain technology solves the trust problem in the Internet, but there are limitations in the scalability of blockchain systems compared to traditional centralized servers, which restricts its development in practical applications. The sharding technology is a solution in the field of traditional database, which can solve the problem of limited database performance. Applying the sharding technology to blockchain system can make the blockchain system process transactions in parallel and thus improve its scalability. Therefore, studying the slicing algorithm can greatly improve the scalability of blockchain systems and promote the development and application of blockchain technology. In this paper, a random, fair, secure and stable network slicing method based on Verifiable Delay Function (VDF) and Verifiable Random Function (VRF) is proposed. Experiments show that compared with several typical blockchain system slicing algorithms, the slicing algorithm proposed in this paper has different degrees of improvement in security, throughput and storage.