Redbelly Blockchain builds upon recent scientific advances in the context of distributed computing game theory and formal verification to apply blockchains to the real world. In this paper, we present how Redbelly Blockchain combines these results to remedy vulnerabilities that affect modern blockchains.

In this paper,  it is proposed that an implementation of fair separability where the cost of outputting transactions remains consistent for the inputs of all processes, which enhances resilience to chain-quality attacks.

In this paper, we remedy this paradox by model checking for the first time a blockchain consensus used in industry. We propose a holistic approach to verify the consensus algorithm of the Redbelly Blockchain, for any number n of processes and any number f < n/3 of Byzantine processes.

In this paper, we present the first bare metal comparison of modern blockchains, including Algorand, Avalanche, Diem, Ethereum, Quorum and Solana. This evaluation was conducted with the recent Diablo benchmark suite, a framework to evaluate the performance of different blockchains on the same ground.

In this paper, we introduce Aion, a set of order-fair protocols for SMR. We first leverage trusted execution environments (TEEs) to enable processes to compute the times when commands  are broadcast by their issuers. We then integrate this information into  existing consensus protocols to devise order-fair SMR protocols that are both leader-based and leaderless.

Byzantine fault tolerant consensus protocols are implemented with consecutive broadcasts but suffer from a low throughput at large geographical scale or planetary scale. A reason for this inefficiency is believed to be their all-to-all communication complexity, which led researchers to design new consensus protocols with more consecutive one-to-all broadcasts but cumulatively fewer messages.

Decentralization promises to remedy the drawbacks of the web by executing decentralized applications (DApps) on blockchains. Unfortunately, modern blockchains cannot support realistic web application workloads mainly due to congestion. We introduce the Smart Redbelly Blockchain (SRBB), a provably correct permissionless blockchain.

With the recent advent of blockchains, we have witnessed a plethora of blockchain proposals. In this paper, we propose the most extensive evaluation of blockchain to date.

As blockchain has found applications to track ownership of digital assets, it is crucial for companies to adopt more secure blockchains than the ones proven vulnerable to network attacks before moving them in production.

Collecting anonymous opinions finds various applications ranging from simple whistleblowing, releasing secretive information, to complex forms of voting, where participants rank candidates by order of preferences.

In this paper, we introduce the community blockchain that bridges the gap between these public blockchains and constrained blockchains.

In this paper, we discuss the mainstream blockchain consensus algorithms and how the classic Byzantine consensus can be revisited for the blockchain context. In particular, we discuss proof-of-work consensus and illustrate the differences between the Bitcoin and the Ethereum proof-of-work consensus algorithms.

In this paper, we introduce Polygraph, the first accountable Byzantine consensus algorithm.

This paper introduces a new leaderless Byzantine consensus called the Democratic Byzantine Fault Tolerance (DBFT) for blockchains.