Off-chain scaling techniques allow mutually distrustful parties to execute a contract locally among themselves instead of on the global blockchain. Parties involved in the transaction maintain a multi-signature fraud-proof off-chain replicated state machine, and only resort to on-chain consensus when absolutely necessary (e.g., when two parties disagree on a state). Off-chain scaling is the only way to support fully scale-out decentralized applications ("dApps") with better privacy and no compromise on the trust and decentralization guarantees. It is the inflection point for blockchain mass adoption, and will be the engine behind all scalable dApps. Celer Network is an Internet-scale, trust-free, and privacy-preserving platform where everyone can quickly build, operate, and use highly scalable dApps. It is not a standalone blockchain but a networked system running on top of existing and future blockchains. It provides unprecedented performance and flexibility through innovation in off-chain scaling techniques and incentive-aligned cryptoeconomics. Celer Network embraces a layered architecture with clean abstractions that enable rapid evolution of each individual component, including a generalized state channel and sidechain suite that supports fast and generic off-chain state transitions; a provably optimal value transfer routing mechanism that achieves an order of magnitude higher throughput compared to state-of-the-art solutions; a powerful development framework and runtime for off-chain applications; and a new cryptoeconomic model that provides network effect, stable liquidity, and high availability for the off-chain ecosystem.
[1]
Andrew Miller,et al.
Sprites: Payment Channels that Go Faster than Lightning
,
2017,
ArXiv.
[2]
P. F. Tsuchiya.
The landmark hierarchy: a new hierarchy for routing in very large networks
,
1988,
SIGCOMM.
[3]
Gade Krishna,et al.
A scalable peer-to-peer lookup protocol for Internet applications
,
2012
.
[4]
Ian Goldberg,et al.
Settling Payments Fast and Private: Efficient Decentralized Routing for Path-Based Transactions
,
2017,
NDSS.
[5]
Jyrki Wallenius,et al.
European Journal of Operational Research Multi-attribute Online Reverse Auctions: Recent Research Trends
,
2022
.
[6]
H. Varian,et al.
The VCG Auction in Theory and Practice
,
2014
.
[7]
Rami Khalil,et al.
Revive: Rebalancing Off-Blockchain Payment Networks
,
2017,
IACR Cryptol. ePrint Arch..
[8]
Leandros Tassiulas,et al.
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
,
1990,
29th IEEE Conference on Decision and Control.
[9]
Giulio Malavolta,et al.
SilentWhispers: Enforcing Security and Privacy in Decentralized Credit Networks
,
2017,
NDSS.
[10]
Paul F. Syverson,et al.
Anonymous connections and onion routing
,
1997,
Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097).
[11]
Eytan Modiano,et al.
Dynamic power allocation and routing for time-varying wireless networks
,
2005
.
[12]
Stefanie Roos,et al.
Anonymous addresses for efficient and resilient routing in F2F overlays
,
2016,
IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.