Pith. Sign in

RECORD

Proof of Luck: an Efficient Blockchain Consensus Protocol

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Mitar Milutinovic, Warren He, Howard Wu, Maxinder Kanwal

Cryptography and Security · Submitted 16 Mar 2017

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim 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.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1703.05435 (version 1)
Pith IDBGFWVXTD, Pith's permanent record of this paper and its review
CitationHoward Wu, Maxinder Kanwal, Mitar Milutinovic, Warren He. "Proof of Luck: an Efficient Blockchain Consensus Protocol." arXiv:1703.05435 (2017). https://pith.science/paper/BGFWVXTD
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,892 input tokens.

What the abstract itself states, as probabilities: claims first 0.09 · states limitation 0.78 · human participants 0.03 · controlled comparison 0.06 · randomized assignment 0.04 · states quantitative result 0.27 · compares with prior results 0.42 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

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.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 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. contribution 1.00 0.88 0.10 asserted 0.99
s1 First, we show how using TEEs for existing proof of work schemes can make mining equitably distributed by preventing the use of ASICs. contribution 0.94 0.83 0.07 asserted 1.00
s2 Next, we extend the design with proof of time and proof of ownership consensus primitives to make mining energy- and time-efficient. contribution 0.96 0.90 0.05 asserted 0.99
s3 Further improving on these designs, we present a blockchain using a proof of luck consensus protocol. contribution 1.00 0.92 0.25 asserted 1.00
s4 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. contribution 0.60 0.88 0.69 asserted 1.00
s5 Lastly, we discuss a potential protection against up to a constant number of compromised TEEs. contribution 0.57 0.70 0.06 hedged possibility 0.88

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from argument 0.79.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original 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.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 1 sentence without a confident label

Cites as background 1 paper
  • To improve transaction confirmation times in Bitcoin, several approaches have been proposed, e.g., using uncles [ref] and dividing blocks into micro and macro blocks [ref] .

    Bitcoin-NG: A Scalable Blockchain Protocol · Related Work · 0.83

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.