Consensus Mechanism Design based on Structured Directed Acyclic Graphs

Guangju Wang; Guangyuan Zhang; Jiahao He; Jiheng Zhang

REVIEW

Consensus Mechanism Design based on Structured Directed Acyclic Graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1901.02755 v1 pith:O73OQHU6 submitted 2019-01-09 cs.DC math.PR

Jiahao He , Guangju Wang , Guangyuan Zhang , Jiheng Zhang This is my paper · ORCID

classification cs.DCmath.PR

keywords designstructureacyclicconsensusdirectedmechanismtransactionassignment

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We introduce a structure for the directed acyclic graph (DAG) and a mechanism design based on that structure so that peers can reach consensus at large scale based on proof of work (PoW). We also design a mempool transaction assignment method based on the DAG structure to render negligible the probability that a transaction being processed by more than one miners. The result is a significant scale-up of the capacity without sacrificing security and decentralization.

Discussion (0). Continue with ORCID to comment.

Pith tools