Improve Blockchain Performance using Graph Data Structure and Parallel Mining

Jia Kan, Shangzhe Chen, Xin Huang
8/31/2018
cs.CRcs.DC

No confident code implementation found for this paper.

Abstract

Blockchain technology is ushering in another break-out year, the challenge of blockchain still remains to be solved. This paper analyzes the features of Bitcoin and Bitcoin-NG system based on blockchain, proposes an improved method of implementing blockchain systems by replacing the structure of the original chain with the graph data structure. It was named GraphChain. Each block represents a transaction and contains the balance status of the traders. Additionally, as everyone knows all the transactions in Bitcoin system will be baled by only one miner that will result in a lot of wasted effort, so another way to improve resource utilization is to change the original way to compete for miner to election and parallel mining. Researchers simulated blockchain with graph structure and parallel mining through python, and suggested the conceptual new graph model which can improve both capacity and performance.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{kan2018improve,
  title  = {Improve Blockchain Performance using Graph Data Structure and Parallel Mining},
  author = {Jia Kan and Shangzhe Chen and Xin Huang},
  year   = {2018},
  eprint = {1808.10810},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1808.10810}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1808.10810.svg)](https://codeofpaper.com/paper/1808.10810)

Discussion