Verification of the Incremental Merkle Tree Algorithm with Dafny

05/13/2021
by   Franck Cassez, et al.
0

The Deposit Smart Contract (DSC) is an instrumental component of the Ethereum 2.0 Phase 0 infrastructure. We have developed the first machine-checkable version of the incremental Merkle tree algorithm used in the DSC. We present our new and original correctness proof of the algorithm along with the Dafny machine-checkable version. The main results are: 1) a new proof of total correctness; 2) a software artefact with the proof in the form of the complete Dafny code base and 3) new provably correct optimisations of the algorithm.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset