The security of the web3 ecosystem relies on the correctness of implementations of advanced mathematical formalisms, such as those underpinning various DeFi products or zk proof systems. The complexity of these formalisms, however, makes automated reasoning about said correctness challenging, if not intractable. In this talk, we give an overview of how some of these challenges can be tackled successfully in the world of interactive theorem proving. In particular, we focus on what it means to build an infrastructure for scalable reasoning about correctness of zk circuits, cryptographic algorithms, protocol models, and EVM/Yul-based smart contracts in the Lean proof assistant. Along the way, we give examples of how Nethermind was able to leverage such infrastructure in a number of real-world engagements.
@InProceedings{sutherland:OASIcs.FMBC.2025.2, author = {Sutherland, Julian}, title = {{Bringing the Power of Interactive Theorem Proving to Web3}}, booktitle = {6th International Workshop on Formal Methods for Blockchains (FMBC 2025)}, pages = {2:1--2:1}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-371-3}, ISSN = {2190-6807}, year = {2025}, volume = {129}, editor = {Marmsoler, Diego and Xu, Meng}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FMBC.2025.2}, URN = {urn:nbn:de:0030-drops-230299}, doi = {10.4230/OASIcs.FMBC.2025.2}, annote = {Keywords: Formal verification, Interactive Theorem Proving, web3} }
Feedback for Dagstuhl Publishing