Pith. sign in

REVIEW 1 cited by

Implicit Consensus: Blockchain with Unbounded Throughput

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1705.11046 v3 pith:QSMIOGH2 submitted 2017-05-31 cs.DC

classification cs.DC
keywords consensusblockchainthroughputimplicitindividualsystemtechniquetransactions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recently, the blockchain technique was put in the spotlight as it introduced a systematic approach for multiple parties to reach consensus without needing trust. However, the application of this technique in practice is severely restricted due to its limitations in throughput. In this paper, we propose a novel consensus model, namely the implicit consensus, with a distinctive blockchain-based distributed ledger in which each node holds its individual blockchain. In our system, the consensus is not on the transactions, but on a special type of blocks called Check Points that are used to validate individual transactions. Our system exploits the ideas of self-interest and spontaneous sharding and achieves unbounded throughput with the transaction reliability that equivalent to traditional Byzantine fault tolerance schemes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Byzantine Consensus in the Random Asynchronous Model

    cs.DC 2025-02 conditional novelty 7.0 of 10

    Random message scheduling makes Byzantine consensus possible at n=2f+1 and n=f+2 with probabilistic safety, with matching impossibility results.

Pith tools