Consensus Mechanism Design based on Structured Directed Acyclic Graphs
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:O73OQHU6record.jsonopen to challenge →
classification
cs.DC
math.PR
keywords
designstructureacyclicconsensusdirectedmechanismtransactionassignment
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.