Dissimilar Redundancy in DeFi
Daniel Perez, Lewis Gudgeon

TL;DR
This paper proposes a novel dissimilar redundancy approach for smart contracts in DeFi to reduce exploits, inspired by avionics safety systems, and introduces an algorithm for its implementation.
Contribution
It introduces a new dissimilar redundancy method for smart contracts, using different programming languages to enhance security against exploits in DeFi.
Findings
Reduces frequency of DeFi exploits
Decreases severity of financial losses
Provides a novel algorithm for dissimilar redundancy
Abstract
The meteoric rise of Decentralized Finance (DeFi) has been accompanied by a plethora of frequent and often financially devastating attacks on its protocols There have been over 70 exploits of DeFi protocols, with the total of lost funds amounting to approximately 1.5bn USD. In this paper, we introduce a new approach to minimizing the frequency and severity of such attacks: dissimilar redundancy for smart contracts. In a nutshell, the idea is to implement a program logic more than once, ideally using different programming languages. Then, for each implementation, the results should match before allowing the state of the blockchain to change. This is inspired by and has clear parallels to the field of avionics, where on account of the safety-critical environment, flight control systems typically feature multiple redundant implementations. We argue that the high financial stakes in DeFi…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security
