Sequential Proof-of-Work for Fair Staking and Distributed Randomness Beacons

08/24/2020
by   José I. Orlicki, et al.
0

We propose a new Proof-of-Stake consensus protocol based on a Sequential Proof-of-Work constructed with a verifiable random function (VRF) and a verifiable delay function (VDF) that has the following properties: a) all addresses with positive stake can participate; b) is fair because the coin stake is proportional to the distribution of rewards; c) is resistant to several classic blockchain attacks such as Sybil attacks, "Nothing-at-stake" attacks and "Winner-takes-all" attacks. We call it Vixify Consensus. We introduce a variant of sequential Proof-of-Work puzzles with applications on Distributed Randomness Beacons.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/13/2022

Proof-of-randomness protocol for blockchain consensus: the white paper version 1.0

A proof-of-randomness (PoR) protocol could be a fair and low energy-cost...
research
06/07/2019

A Unifying Hybrid Consensus Protocol

We introduce Unity, a new consensus algorithm for public blockchain sett...
research
07/08/2021

Proof-of-Stake Mining Games with Perfect Randomness

Proof-of-Stake blockchains based on a longest-chain consensus protocol a...
research
03/07/2019

Invariant Safety for Distributed Applications

We study a proof methodology for verifying the safety of data invariants...
research
12/11/2021

Delay Function with Fixed Effort Verification

A Verifiable Delay Function (VDF) is a function that takes a specified (...
research
09/14/2021

A Double-Linked Blockchain Approach Based on Proof-of-Refundable-Tax Consensus Algorithm

In this paper we propose a double-linked blockchain data structure that ...
research
11/15/2022

Faster Verifiable Delay Function For Shorter Delay Parameter

A Verifiable Delay Function (VDF) is a function that takes a specified s...

Please sign up or login with your details

Forgot password? Click here to reset