ResilientDB

Gupta, Suyash; Rahnama, Sajjad; Hellings, Johan; Sadoghi, Mohammad

doi:10.14778/3380750.3380757

Cited by 77 publications

(14 citation statements)

References 70 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Elastic chain-based blockchains. Conventional chain-based blockchains attempt to optimize performance by leveraging resilient BFT consensus [31], [32], adaptive architecture [33], [34], or elastic sharding and storage [25], [35], [36]. For instance, ResilientDB [31] divides nodes into different clusters and pipelines the BFT consensus.…”

Section: Related Workmentioning

confidence: 99%

“…Conventional chain-based blockchains attempt to optimize performance by leveraging resilient BFT consensus [31], [32], adaptive architecture [33], [34], or elastic sharding and storage [25], [35], [36]. For instance, ResilientDB [31] divides nodes into different clusters and pipelines the BFT consensus. FlexChain [33] disaggregates multiple resources into independent resource pools, thus enabling efficient processing of workloads with diverse resource requirements.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

MorphDAG: A Workload-Aware Elastic DAG-Based Blockchain

Zhang,

Xiao,

et al. 2024

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

Directed Acyclic Graph (DAG)-based blockchain represents a paradigm shift from conventional blockchains, which has the potential to drastically improve throughput performance through concurrent storage and executions. In practice, however, existing DAG-based blockchains fail to deliver such promises, often with limited throughput, high conflicts, and security vulnerabilities under dynamic workloads. The root causes are their unawareness of the workload characteristics of different workload sizes and skewed access patterns. In this paper, we propose MorphDAG, the first workload-aware DAG-based blockchain that can significantly enhance throughput without compromising security and achieve elastic scaling under realistic workloads. We derive the theoretically optimal degree of storage concurrency to achieve high throughput while retaining system security as the workload size changes, while enabling fine-grained concurrency adjustment that accommodates a Proof-of-Stake (PoS)-based consensus protocol. We develop a dual-mode transaction processing mechanism that effectively resolves the conflicts brought by skewed access. We implement a prototype of MorphDAG and evaluate under real-world workloads. Extensive evaluations demonstrate that MorphDAG improves end-to-end throughput by up to 2.3× and 2.4× over state-of-the-art DAG-based blockchain systems AdaptChain and OHIE, respectively.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

MorphDAG: A Workload-Aware Elastic DAG-Based Blockchain

Zhang,

Xiao,

et al. 2024

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

show abstract

“…RingBFT [40] and SharPer [41] accelerate crossshard transactions by enhancing consensus algorithms. CA-PER [42], ResilientDB [43], and RCC [44] improve consensus algorithms to apply concurrent transaction execution. Compared to these researches, Trie-Hashimoto focuses more on database performance by optimizing the way to store the huge state data of the blockchain with a new mining algorithm.…”

Section: Related Workmentioning

confidence: 99%

Trie-Hashimoto: State Trie-Based Proof-of-Work Mining for Optimizing Blockchain Storage

Kim,

Lee,

Moon

2024

IEEE Access

View full text Add to dashboard Cite

Blockchain makes heavy use of cryptographic hashing to achieve integrity and consensus in a peer-to-peer network, but hashing causes some inefficiencies. For example, blockchain stores data with their hash digest as a key in the database, so the blockchain always reads and writes data in a random order. This can affect blockchain performance, especially for account-based blockchains such as Ethereum, which must maintain a huge, hash-based data structure for accounts, called the state trie. Also, Proof-of-Work (PoW) consensus algorithm requires the miners to find a nonce that makes the block hash lower than a difficulty threshold, but ASICs with parallel hashing have made PoW use a large dataset such as the Ethash DAG for memory-hardness and ASIC-resistance. Unfortunately, verification of the nonce is not easy for many light clients, which cannot deal with the overhead caused by the dataset. This paper proposes a novel PoW mining algorithm named Trie-Hashimoto to address these issues. Trie-Hashimoto adds a nonce field in a state trie node. It then makes the miners find a nonce of every newly-created trie node for a new block such that each node has a hash digest whose prefix is equal to the block number. This can accelerate the database performance by storing the trie nodes in a sequential order. The way for Trie-Hashimoto to achieve memoryhardness is also different. It uses the block headers that any client must maintain, obviating a separate dataset. Furthermore, it allows partial verification using a few Merkle proofs of accounts, so that a client with minimal resources or even a smart contract in another interoperable blockchain can verify a block with a high probability. Finally, Trie-Hashimoto discourages big mining pools by increasing the network overhead among the miners. Our experiment on the Geth client with 500K blocks and 100M accounts shows that Trie-Hashimoto improves the transaction execution time tangibly, reducing the full synchronization time by half. It also shows that Trie-Hashimoto has enough memory-hardness as Ethash. Lastly, a Trie-Hashimoto mining pool should exchange messages highly frequently, proportional to the total number of miners.INDEX TERMS Blockchain, LevelDB, memory hardness, proof-of-work mining, state trie.

show abstract

“…The number of nodes increases, along with a full-featured NoSQL query language, effective querying, and managing permissions. In [35], a new resilient distributed database system was submitted. Geo-Scale Byzantine Fault Tolerant Consensus Protocol (GeoBFT) is a new geo-scale Byzantine fault-tolerant consensus protocol proposed in this paper.…”

Section: Databasementioning

confidence: 99%

A Survey on Blockchain-Based Search Engines

2021

View full text Add to dashboard Cite

With the increasing growth of different types of data, search engines have become an essential tool on the Internet. Every day, billions of queries are run through few search engines with several privacy violations and monopoly problems. The blockchain, as a trending technology applied in various fields, including banking, IoT, education, etc., can be a beneficial alternative. Blockchain-based search engines, unlike monopolistic ones, do not have centralized controls. With a blockchain-based search system, no company can lay claims to user’s data or access search history and other related information. All these data will be encrypted and stored on a blockchain. Valuing users’ searches and paying them in return is another advantage of a blockchain-based search engine. Additionally, in smart environments, as a trending research field, blockchain-based search engines can provide context-aware and privacy-preserved search results. According to our research, few efforts have been made to develop blockchain use, which include studies generally in the early stages and few white papers. To the best of our knowledge, no research article has been published in this regard thus far. In this paper, a survey on blockchain-based search engines is provided. Additionally, we state that the blockchain is an essential paradigm for the search ecosystem by describing the advantages.

show abstract

ResilientDB

Cited by 77 publications

References 70 publications

MorphDAG: A Workload-Aware Elastic DAG-Based Blockchain

MorphDAG: A Workload-Aware Elastic DAG-Based Blockchain

Trie-Hashimoto: State Trie-Based Proof-of-Work Mining for Optimizing Blockchain Storage

A Survey on Blockchain-Based Search Engines

Contact Info

Product

Resources

About