DeepAI AI Chat
Log In Sign Up

Verification of the Incremental Merkle Tree Algorithm with Dafny

by   Franck Cassez, et al.

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.


page 1

page 2

page 3

page 4


Complexity of correctness for pomset logic proof nets

We show that it is coNP-complete to decide whether a given proof structu...

A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs

The Moore-Hodgson Algorithm minimizes the number of late jobs on a singl...

An Incremental Slicing Method for Functional Programs

Several applications of slicing require a program to be sliced with resp...

Proof of the tree module property for exceptional representations of the quiver 𝔼_6

This document (together with the ancillary file e6_proof.pdf) is an appe...

Beyond Structured Programming

The correctness of a structured program is, at best, plausible. Though t...

Linearizability Analysis of the Contention-Friendly Binary Search Tree

We present a formal framework for proving the correctness of set impleme...

Realizability Checking of Contracts with Kind 2

We present a new feature of the open-source model checker Kind 2 which c...