# Proof of Luck: an Efficient Blockchain Consensus Protocol

## TL;DR

This paper introduces a blockchain consensus protocol called Proof of Luck that leverages trusted execution environments to achieve energy-efficient, fair, and low-latency transaction validation with robust security features.

## Contribution

The paper presents a novel proof of luck consensus protocol using TEEs, improving fairness, efficiency, and security over existing blockchain consensus mechanisms.

## Key findings

- Achieves low-latency transaction validation
- Provides energy-efficient consensus with negligible energy use
- Ensures equitable mining distribution

## Abstract

In the paper, we present designs for multiple blockchain consensus primitives and a novel blockchain system, all based on the use of trusted execution environments (TEEs), such as Intel SGX-enabled CPUs. First, we show how using TEEs for existing proof of work schemes can make mining equitably distributed by preventing the use of ASICs. Next, we extend the design with proof of time and proof of ownership consensus primitives to make mining energy- and time-efficient. Further improving on these designs, we present a blockchain using a proof of luck consensus protocol. Our proof of luck blockchain uses a TEE platform's random number generation to choose a consensus leader, which offers low-latency transaction validation, deterministic confirmation time, negligible energy consumption, and equitably distributed mining. Lastly, we discuss a potential protection against up to a constant number of compromised TEEs.