• Corpus ID: 211146700

SURFACE: A Practical Blockchain Consensus Algorithm for Real-World Networks

@article{Ren2020SURFACEAP,
  title={SURFACE: A Practical Blockchain Consensus Algorithm for Real-World Networks},
  author={Zhijie Ren and Ziheng Zhou},
  journal={ArXiv},
  year={2020},
  volume={abs/2002.07565}
}
SURFACE, standing for Secure, Use-case adaptive, and Relatively Fork-free Approach of Chain Extension, is a consensus algorithm that is designed for real-world networks and enjoys the benefits from both the Nakamoto consensus and Byzantine Fault Tolerance (BFT) consensus. In SURFACE, a committee is randomly selected every round to validate and endorse the proposed new block. The size of the committee can be adjusted according to the underlying network to make the blockchain mostly fork-free… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 46 REFERENCES
Implicit Consensus: Blockchain with Unbounded Throughput
TLDR
This paper proposes a novel consensus model, namely the implicit consensus, with a distinctive blockchain-based distributed ledger in which each node holds its individual blockchain in which the consensus is not on the transactions, but on a special type of blocks called Check Points that are used to validate individual transactions.
HotStuff: BFT Consensus in the Lens of Blockchain
TLDR
This work presents HotStuff, a leader-based Byzantine fault-tolerant replication protocol for the partially synchronous model that enables a correct leader to drive the protocol to consensus at the pace of actual network delay with communication complexity that is linear in the number of replicas.
Prism: Deconstructing the Blockchain to Approach Physical Limits
TLDR
Prism, a new proof-of-work blockchain protocol, which can achieve 1) security against up to 50% adversarial hashing power; 2) optimal throughput up to the capacity C of the network; 3) confirmation latency for honest transactions proportional to the propagation delay D; and eventual total ordering of all transactions.
Scaling Nakamoto Consensus to Thousands of Transactions per Second
TLDR
Conflux is a fast, scalable and decentralized blockchain system that optimistically process concurrent blocks without discarding any as forks and achieves a transaction throughput of 5.76GB/h while confirming transactions in 4.5-7.4 minutes.
DFINITY Technology Overview Series, Consensus System
TLDR
DFINITY consensus algorithm is made to scale through continuous quorum selections driven by the random beacon, which gracefully handles temporary losses of network synchrony including network splits, while it is provably secure under synchrony.
Bitcoin-NG: A Scalable Blockchain Protocol
TLDR
This paper implements Bitcoin-NG, a new blockchain protocol designed to scale, which is Byzantine fault tolerant, is robust to extreme churn, and shares the same trust model obviating qualitative changes to the ecosystem.
POLKADOT: VISION FOR A HETEROGENEOUS MULTI-CHAIN FRAMEWORK
  • Computer Science
  • 2016
TLDR
This paper introduces an architecture, the heterogeneous multi-chain, which fundamentally sets the two parts of the consensus architecture too closely together, and puts forward a means of providing backwards compatibility with one or more pre-existing networks such as Ethereum.
Chainspace: A Sharded Smart Contracts Platform
TLDR
This work presents the design, rationale, and details of Chainspace, and argues through evaluating an implementation of the system about its scaling and other features; it illustrates a number of privacy-friendly smart contracts for smart metering, polling and banking and measure their performance.
Transaction Propagation on Permissionless Blockchains: Incentive and Routing Mechanisms
TLDR
This work formally defines the problem of incentivizing nodes for transaction propagation and proposes an incentive mechanism where each node involved in the propagation of a transaction receives a share of the transaction fee.
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
TLDR
“Ouroboros” is presented, the first blockchain protocol based on proof of stake with rigorous security guarantees and it is proved that, given this mechanism, honest behavior is an approximate Nash equilibrium, thus neutralizing attacks such as selfish mining.
...
1
2
3
4
5
...