arXiv subjects

Jia Kan

Publications and source records attributed to Jia Kan.

5 recordsLinked to original sources

arXiv2024

Towards the Blockchain Massive Adoption with Permissionless Storage

Blockchain technology emerged with the advent of Bitcoin and rapidly developed over the past few decades, becoming widely accepted and known by the public. However, in the past decades, the massive adoption of blockchain technology has yet to come. Rather than the scalability issue, the blockchain application is challenged by its expensive usage cost. However, the high cost of blockchain usage is deeply connected with the blockchain consensus and security mechanism. The permissionless blockchain must maintain its high cost for security against the 51% Attack. Chain users indirectly cover the cost as coins are appointed for blockchain usage fees. This conflict prevents the massive adoption of blockchain. Thus, blockchain must be improved to solve those problems: 1. The cost of blockchain usage should be low enough. 2. The blockchain should remain decentralized. 3. The scalability of blockchain must meet the demand. In my thesis, new approaches are applied to solve the issues above. The key contribution is the discovery of the useful PoW. It extends the Nakamoto PoW with another usage of file data encoding during the same Nakamoto Consensus computation to prove honest data preservation. Based on this theory, a permissionless storage network is proposed as the new security engine for the blockchain. It bridges the high blockchain security cost to the storage users with real demands who are willing to pay for the storage resource. On the other hand, the chain users can benefit from the low transaction fee. Meanwhile, we also provide a scalability solution to shard the blockchain. It enables high TPS and keeps decentralization. The solutions in this thesis provide the answers to all the dependencies of the massive adoption.

cs.CR↗

arXiv2022

Wider: Scale Out Blockchain With Sharding by Account

The development of blockchain applications increased the demand for blockchain performance. Among the attempts of many blockchain scale-out solutions, sharding can improve performance and reduce the storage requirements of each node. Sharding enhances the throughput of the entire blockchain. Most sharding solutions have a fixed number of shards. We propose Wider chain with sharding by account. The number of shards is increased to unlimited. Meanwhile, Wider combines the idea of rollup and retains the main chain to confirm the status of the subchains. This design can avoid the Proof of Work computing power being scattered to the subchains and ensure the security of the blockchain.

cs.DC↗

arXiv2019

MTFS: Merkle-Tree-Based File System

The blockchain technology has been changing our daily lives since Bitcoin - i.e., the first decentralized cryptocurrency - was invented and released as open-source software by an unidentified person or a group called Satoshi Nakamoto in 2009. Of many applications which can be implemented based on the blockchain, storage is an important one, a notable example of which is the InterPlanetary File System (IPFS). IPFS is a distributed web based on a peer-to-peer hypermedia protocol to make the web faster, safer, and more open and focuses on public accessible files. To provide a solution for private file storage in the blockchain way, in this paper we propose a Merkle-tree-based File System (MTFS). In MTFS, the blockchain is more than a trust machine; it is an abstract of a cluster system. Distributed random nodes form a tree network cluster without a central controller to provide a secure private storage service and faster message propagation. Advance proxy re-encryption algorithm is applied to guarantee secure file exchanges under permission. Merkle tree will make sure that the files are distributed among the service nodes in a balanced way. The proposed MTFS can be used not only for personal file storage and exchange but also for industry requiring mutual trust in file uploading and downloading in making contracts like insurances.

cs.NI↗

arXiv2018

Improve Blockchain Performance using Graph Data Structure and Parallel Mining

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.

cs.CR↗

arXiv2018

Boost Blockchain Broadcast Propagation with Tree Routing

In recent years, with the rapid development and popularization of BitCoin, the research of blockchain technology has also shown growth. It has gradually become a new generation of distributed, non-centralized and trust-based technology solution. However, the blockchain operation is expensive and transaction is delayed. Take BitCoin as an example. On the one hand, a block is produced every ten minute. On the other hand, once the new block is generated, it takes a certain time to propagate world wide. The slow speed of propagation determines that BitCoin can not use too small block interval time. Ethereum also faces similar problems, so the concept of uncle block was introduced to reduce blockchain forks. This paper introduces a new tree structure based broadcast propagation routing model, providing a novel method to organize network nodes and message propagation mechanism. In oder to avoid the single node failure problem, the tree cluster routing is proposed. The research shows that the tree based routing can accelerate broadcast convergence time and reduce redundant traffic.

cs.DC↗