Imperial College London

DrNarankerDulay

Faculty of EngineeringDepartment of Computing

Reader in Computing Science
 
 
 
//

Contact

 

+44 (0)20 7594 8288n.dulay Website

 
 
//

Location

 

562Huxley BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@inproceedings{Khalil:2022:10.1145/3477314.3507056,
author = {Khalil, RA and Dulay, N},
doi = {10.1145/3477314.3507056},
pages = {236--245},
publisher = {ACM},
title = {RANC: reward-all nakamoto consensus},
url = {http://dx.doi.org/10.1145/3477314.3507056},
year = {2022}
}

RIS format (EndNote, RefMan)

TY  - CPAPER
AB - In this work we present Reward-All Nakamoto-Consensus (RANC), a Proof-of-Work cryptocurrency that resiliently rewards each miner with a number of coins that is directly proportional to its individual mining power, rather than to its relative share of the entire network's mining power as done in Bitcoin. Under this approach, the security of mining in RANC achieves near-perfect incentive compatibility, and near-zero censorship susceptibility, for adversarial mining shares up to 45%, but at the cost of regression in subversion-gain resilience. Moreover, mining rewards in RANC exhibit significantly lower variance for non-majority miners compared to NC, enabling dependable reward stability. Consequently, depending on the network transaction-fees, RANC improves miner's waiting time for rewards, and incentivizes forming mining pools smaller than required in Bitcoin for equal reward stability. A detailed specification of RANC is presented, along with an evaluation of the practicality and efficiency achieved by our prototype RANC implementation.
AU - Khalil,RA
AU - Dulay,N
DO - 10.1145/3477314.3507056
EP - 245
PB - ACM
PY - 2022///
SP - 236
TI - RANC: reward-all nakamoto consensus
UR - http://dx.doi.org/10.1145/3477314.3507056
UR - https://dl.acm.org/doi/10.1145/3477314.3507056
UR - http://hdl.handle.net/10044/1/98946
ER -